Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)最新文献

Hardness for Explicit State Software Model Checking Benchmarks 显式状态软件模型检查基准的硬度

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-10-15 DOI: 10.1109/SEFM.2007.23

Neha Rungta, Eric Mercer

引用次数: 14

Testing conformance on Stochastic Stream X-Machines 随机流x机一致性测试

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-10-15 DOI: 10.1109/SEFM.2007.41

Mercedes G. Merayo, M. Núñez

引用次数: 3

The Role of Abstract Interpretation in Formal Methods 抽象解释在形式化方法中的作用

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-10-15 DOI: 10.1109/SEFM.2007.42

P. Cousot

引用次数: 6

Specification-based testing for refinement 基于规范的细化测试

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-10-15 DOI: 10.1109/SEFM.2007.38

Temesghen Kahsai, M. Roggenbach, H. Schlingloff

引用次数: 17

A Scalable Lock-Free Stack Algorithm and its Verification 一种可扩展的无锁堆栈算法及其验证

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-09-10 DOI: 10.1109/SEFM.2007.2

R. Colvin, L. Groves

{"title":"A Scalable Lock-Free Stack Algorithm and its Verification","authors":"R. Colvin, L. Groves","doi":"10.1109/SEFM.2007.2","DOIUrl":"https://doi.org/10.1109/SEFM.2007.2","url":null,"abstract":"The design of efficient software supporting concurrent access to shared data is a challenging task. Often such programs will have at their core algorithms which utilise conceptual locks to restrict access to the data, and which are significantly more complex than their sequential (non-concurrent) counterparts. Lock-free algorithms, which have been developed to avoid problems such as priority inversion and deadlock, are more complex still due to the larger scope for interference between processes. These algorithms become even more complex when further mechanisms are added to achieve good performance under a wide range of workloads. In this paper we present a lock-free algorithm that efficiently manages interference on a shared stack, by allowing complementary stack operations to be eliminated without altering the stack. The algorithm we present is based on a published algorithm due to Hendler, Shavit and Yerushalmi (2004), and incorporates simplifications and improvements that we discovered while attempting to verify the original algorithm. We present a high-level view of the formal verification of our algorithm, which was machine-checked using the PVS theorem prover.","PeriodicalId":212544,"journal":{"name":"Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130404471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Sound reasoning about unchecked exceptions 关于未检查异常的合理推理

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-09-10 DOI: 10.1109/SEFM.2007.36

B. Jacobs, Peter Müller, F. Piessens

{"title":"Sound reasoning about unchecked exceptions","authors":"B. Jacobs, Peter Müller, F. Piessens","doi":"10.1109/SEFM.2007.36","DOIUrl":"https://doi.org/10.1109/SEFM.2007.36","url":null,"abstract":"In most software development projects, it is not feasible for developers to handle explicitly all possible unusual events which may occur during program execution, such as arithmetic overflow, highly unusual environment conditions, heap memory or call stack exhaustion, or asynchronous thread cancellation. Modern programming languages provide unchecked exceptions to deal with these circumstances safely and with minimal programming overhead. However, reasoning about programs in the presence of unchecked exceptions is difficult, especially in a multithreaded setting where the system should survive the failure of a subsystem. We propose a static verification approach for multithreaded programs with unchecked exceptions. Our approach is an extension of the Spec# verification methodology for object-oriented programs. It verifies that objects encapsulating shared resources are always ready to be disposed of, by allowing ownership transfers to other threads only through well-nested parallel execution operations. Also, the approach prevents developers from relying on invariants that may have been broken by a failure. We believe the programming style enforced by our approach leads to better programs, even in the absence of formal verification. The proposed approach enables developers using mainstream languages to gain some of the benefits of approaches based on isolated sub-processes. We believe this is the first verification approach that soundly verifies common exception handling and locking patterns in the presence of unchecked exceptions.","PeriodicalId":212544,"journal":{"name":"Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127914281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs 面向对象程序强特性分析的Case-Optimal符号执行算法

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-09-10 DOI: 10.1109/SEFM.2007.43

Xianghua Deng, Robby, J. Hatcliff

引用次数: 21

Flexible Behavioural Compatibility and Substitutability for Component Protocols: A Formal Specification 组件协议的灵活行为兼容性和可替代性:一种正式规范

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-09-10 DOI: 10.1109/SEFM.2007.19

N. Hameurlain

{"title":"Flexible Behavioural Compatibility and Substitutability for Component Protocols: A Formal Specification","authors":"N. Hameurlain","doi":"10.1109/SEFM.2007.19","DOIUrl":"https://doi.org/10.1109/SEFM.2007.19","url":null,"abstract":"Component compatibility and substitutability are widely recognized as the main issues in component- based software engineering (CBSE). Most of existing approaches suffer from the problem of component adaptation. Indeed, components compatibility and substitutability are performed component-to- component without taking into account the context. This paper proposes a new framework where more flexible component protocols compatibility and substitutability relations that depend on the context (environment) can be defined. The proposed approach is based on the notion of component protocol's usability, that is a component such that there exists an environment ensuring the completion and / or the proper termination of the composition of the involved component protocol and that environment. Two optimistic protocols compatibility relations together with two optimistic protocols behavioral subtyping relations related to the principle of substitutability are proposed. Moreover, behavioral refinement of component protocols is studied, and a link between protocols refinement and their usability is established. The soundness of the approach is shown.","PeriodicalId":212544,"journal":{"name":"Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116392910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 16

Formal verification of tamper-evident storage for e-voting 电子投票的防篡改存储的正式验证

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-09-10 DOI: 10.1109/SEFM.2007.21

Dominique Cansell, John Paul Gibson, D. Méry

{"title":"Formal verification of tamper-evident storage for e-voting","authors":"Dominique Cansell, John Paul Gibson, D. Méry","doi":"10.1109/SEFM.2007.21","DOIUrl":"https://doi.org/10.1109/SEFM.2007.21","url":null,"abstract":"The storage of votes is a critical component of any voting system. In traditional systems there is a high level of transparency in the mechanisms used to store votes, and thus a reasonable degree of trustworthiness in the security of the votes in storage. This degree of transparency is much more difficult to attain in electronic voting systems, and so the specific mechanisms put in place to ensure the security of stored votes require much stronger verification in order for them to be trusted by the public. There are many desirable properties that one could reasonably expect a vote store to exhibit. From the point of view of security, we argue that tamper-evident storage is one of the most important requirements: the changing, or deletion of already validated and stored votes should be detectable; as should the addition of unauthorised votes after the election is concluded. We propose the application of formal methods (in this paper, event- B) for guaranteeing, through construction, the correctness of a vote store with respect to the requirement for tamper- evident storage. We illustrate the utility of our refinement- based approach by verifying - through the application of a reusable formal design pattern - a store design that uses a specific PROM technology and applies a specific encoding mechanism.","PeriodicalId":212544,"journal":{"name":"Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124740769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 26

A Thread-tag Based Semantics for Sequence Diagrams 基于线程标记的序列图语义

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007) Pub Date : 2007-09-10 DOI: 10.1109/SEFM.2007.3

Haitao Dan, R. Hierons, S. Counsell

引用次数: 9