2010 8th IEEE International Conference on Software Engineering and Formal Methods最新文献

Parallel Partial Order Reduction with Topological Sort Proviso 具有拓扑排序条件的平行偏序约简

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.35

J. Barnat, L. Brim, Petr Ročkai

{"title":"Parallel Partial Order Reduction with Topological Sort Proviso","authors":"J. Barnat, L. Brim, Petr Ročkai","doi":"10.1109/SEFM.2010.35","DOIUrl":"https://doi.org/10.1109/SEFM.2010.35","url":null,"abstract":"Partial order reduction and distributed-memory processing are the two essential techniques to fight the well-known state space explosion problem in explicit state model checking. Unfortunately, these two techniques have not been integrated yet to a satisfactory degree. While for verification of safety properties, there are a few rather successful approaches to parallel partial order reduction, for LTL model checking all suggested approaches are either too technically involved to be smoothly incorporated with the existing parallel algorithms, or they are simply weak in the sense that the achieved reduction in the size of the state space is minor. The main source of difficulties is the cycle proviso that requires one fully expanded state on every cycle in the reduced state space graph. This can be easily achieved in the sequential case by employing depth-first search strategy for state space generation. Unfortunately, this strategy is incompatible with parallel (hence distributed-memory) processing, which limits application of partial order reduction technique to the sequential case. In this paper we suggest a new technique that guarantees correct construction of the reduced state space graph w.r.t. the cycle proviso. Our new technique is fully compatible with the parallel graph traversal procedure while at the same time it provides competitive reduction of the state space if compared to the serial case. The new technique has been implemented within the parallel and distributed-memory LTL model checker DiVinE and its performance is reported in this paper.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127149220","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}

引用次数: 36

Integrating Requirements: The Behavior Tree Philosophy 整合需求:行为树哲学

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.13

Kirsten Winter, I. Hayes, R. Colvin

引用次数: 23

Towards the Semi-Automatic Verification of Parameterized Real-Time Systems Using Network Invariants 基于网络不变量的参数化实时系统半自动验证研究

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.38

Thomas Göthel, S. Glesner

{"title":"Towards the Semi-Automatic Verification of Parameterized Real-Time Systems Using Network Invariants","authors":"Thomas Göthel, S. Glesner","doi":"10.1109/SEFM.2010.38","DOIUrl":"https://doi.org/10.1109/SEFM.2010.38","url":null,"abstract":"Real-time systems often have to cope with an unbounded number of components. For example, an operating system scheduler has to be able to manage an arbitrary number of threads. At the same time, the correctness of central control units such as schedulers is crucial for the correctness of the whole system. However, the comprehensive and semi-automatic verification of real-time systems that are parameterized with an unbounded number of components is still an open problem. In this paper, we propose an approach in which parameterized systems can be verified using a combination of theorem proving and model checking. The interactive theorem prover is used for the overall verification task delegating subsequent proof-goals to automatic verification tools. The central proof method is based on network invariants. The idea of network invariants is to over approximate all instances of a parameterized system and to perform the verification on the abstract model. We have adopted an existing network invariant approach for the verification of centralized real-time systems such as schedulers and formalized the theory in the Isabelle/HOL theorem prover. Preliminary results on applying our framework to small examples are promising and make it worth to evaluate the approach with larger case studies in future work.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"2 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133072690","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}

引用次数: 7

Synthesize It: From Design by Contract to Meaningful Test Input Data 综合:从契约式设计到有意义的测试输入数据

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.33

Stefan J. Galler, Martin Weiglhofer, F. Wotawa

{"title":"Synthesize It: From Design by Contract to Meaningful Test Input Data","authors":"Stefan J. Galler, Martin Weiglhofer, F. Wotawa","doi":"10.1109/SEFM.2010.33","DOIUrl":"https://doi.org/10.1109/SEFM.2010.33","url":null,"abstract":"Generating test input data is a complex task and nowadays mostly tackled with random approaches. Random testing of methods, which take non primitive data types as parameters, e.g. objects encapsulating database interactions, is a vain endeavor. Especially, if the precondition of the method under test (MUT) requires a particular object state of the method’s parameters, random approaches rarely succeed. In this paper we present a technique to automatically synthesize implementations for the parameters of a MUT from a given Design by Contract specification. These implementations behave as described by the Design by Contract specification, but do not interact with their environment (e.g. database, network and file system). Furthermore, we can set the initial state of the synthesized implementations to the state required by the MUT’s precondition. Besides a formal discussion of our approach we present results obtained by applying our technique to two case studies: a stack-based calculator and a real-world data collection tool from the telecommunication industry. The presented approach outperforms random data generation on both case studies in terms of amount of methods tested (function coverage) and line coverage.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133147029","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}

引用次数: 5

A Timed Model of Circus with the Reactive Design Miracle 马戏团的时间模型与反应设计奇迹

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.40

Kun Wei, J. Woodcock, A. Burns

引用次数: 12

Testing Web Service Orchestrators in Context: A Symbolic Approach 在上下文中测试Web服务编排器:一种符号方法

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.30

J. Escobedo, Christophe Gaston, P. L. Gall, A. Cavalli

{"title":"Testing Web Service Orchestrators in Context: A Symbolic Approach","authors":"J. Escobedo, Christophe Gaston, P. L. Gall, A. Cavalli","doi":"10.1109/SEFM.2010.30","DOIUrl":"https://doi.org/10.1109/SEFM.2010.30","url":null,"abstract":"An orchestrator in a Web Service system is a locally deployed piece of software used both to allow users to interact with the system and to communicate with remote components (Web Services) in order to fulfill a goal. We propose a symbolic model based approach to test orchestrators in the context of the systems they pilot. Our approach only takes as input a model of the orchestrator and no models of the Web Services. Besides, the testing architecture is a parameter: communications between Web Services and the orchestrator can be either simulated, or hidden or observable. When they are simulated, the orchestrator is tested in isolation and our approach comes to already defined classical model-based unit testing approaches. When the System Under Test is connected with Web Services (that is, in actual usage) it is no longer fully controlled by the tester, but tested in context In that case two situations may occur: either communications with Web Services are observable or they are hidden. Our approach copes with those cases. We give theorems relating our notion of conformance in context with regard to classical conformance of components in isolation. We present a test case generation algorithm based on symbolic execution techniques: it takes into account the status (controllable, hidden, or observable) of communication channels between the orchestrator and Web Services. The algorithm has been implemented and is illustrated on a small case study","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128440825","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}

引用次数: 14

A Formal Model for Work Flows 工作流的正式模型

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.27

C. Leuxner, W. Sitou, B. Spanfelner

引用次数: 10

Static Enforcement of Service Deadlines 服务截止日期的静态执行

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.41

Massimo Bartoletti, R. Zunino

引用次数: 0

Designing Log Architectures for Legal Evidence 为法律证据设计日志架构

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.29

D. Métayer, Eduardo Mazza, Marie-Laure Potet

引用次数: 14

A Scalable Fluid Flow Process Algebraic Approach to Emergency Egress Analysis 紧急出口分析的可扩展流体流动过程代数方法

2010 8th IEEE International Conference on Software Engineering and Formal Methods Pub Date : 2010-09-13 DOI: 10.1109/SEFM.2010.22

M. Massink, D. Latella, A. Bracciali, M. Harrison

引用次数: 13