找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: NASA Formal Methods; 5th International Sy Guillaume Brat,Neha Rungta,Arnaud Venet Conference proceedings 2013 Springer-Verlag Berlin Heidel

[复制链接]
查看: 10112|回复: 63
发表于 2025-3-21 18:40:18 | 显示全部楼层 |阅读模式
书目名称NASA Formal Methods
副标题5th International Sy
编辑Guillaume Brat,Neha Rungta,Arnaud Venet
视频video
概述Fast-track conference proceedings.State-of-the-art research.Up-to-date results
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: NASA Formal Methods; 5th International Sy Guillaume Brat,Neha Rungta,Arnaud Venet Conference proceedings 2013 Springer-Verlag Berlin Heidel
描述This book constitutes the refereed proceedings of the 5th International Symposium on NASA Formal Methods, NFM 2013, held in Moffett Field, CA, USA, in May 2013. The 28 revised regular papers presented together with 9 short papers talks were carefully reviewed and selected from 99 submissions. The topics are organized in topical sections on model checking; applications of formal methods; complex systems; static analysis; symbolic execution; requirements and specifications; probabilistic and statistical analysis; and theorem proving.
出版日期Conference proceedings 2013
关键词embedded systems; formal verification; gene regulation networks; real-time systems; software engineering
版次1
doihttps://doi.org/10.1007/978-3-642-38088-4
isbn_softcover978-3-642-38087-7
isbn_ebook978-3-642-38088-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2013
The information of publication is updating

书目名称NASA Formal Methods影响因子(影响力)




书目名称NASA Formal Methods影响因子(影响力)学科排名




书目名称NASA Formal Methods网络公开度




书目名称NASA Formal Methods网络公开度学科排名




书目名称NASA Formal Methods被引频次




书目名称NASA Formal Methods被引频次学科排名




书目名称NASA Formal Methods年度引用




书目名称NASA Formal Methods年度引用学科排名




书目名称NASA Formal Methods读者反馈




书目名称NASA Formal Methods读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:03:45 | 显示全部楼层
Regular Model Checking Using Solver Technologies and Automata Learningreby, the handling of regular sets of . and . often imposes a serious restriction in practical applications. We present two new algorithms both utilizing modern . and .. The first one works in a CEGAR-like fashion by iteratively refining an abstraction of the reachable state space using counterexamp
发表于 2025-3-22 03:01:18 | 显示全部楼层
发表于 2025-3-22 05:00:26 | 显示全部楼层
Evaluating Human-Human Communication Protocols with Miscommunication Generation and Model Checkingn procedures with the goal to ensure that they check that verbal air traffic clearances are correctly heard and executed. Such communication protocols should be designed to be robust to miscommunication. However, they can fail in ways unanticipated by designers. In this work, we present a method for
发表于 2025-3-22 10:15:02 | 显示全部楼层
发表于 2025-3-22 14:16:28 | 显示全部楼层
发表于 2025-3-22 20:28:53 | 显示全部楼层
发表于 2025-3-23 00:41:30 | 显示全部楼层
发表于 2025-3-23 03:56:36 | 显示全部楼层
发表于 2025-3-23 07:07:04 | 显示全部楼层
Incremental Invariant Generation Using Logic-Based Automatic Abstract Transformersently one of the best approaches for discovering useful invariants, in particular numerical ones. However, its application is limited by two orthogonal issues: (.) developing an abstract interpretation is often non-trivial; each transfer function of the system has to be represented at the abstract l
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-14 17:44
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表