Learning regular sets from queries and counterexamples
Information and Computation
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Inference of finite automata using homing sequences
Information and Computation
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Model checking
A Proof Technique for Rely/Guarantee Properties
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Assumption Generation for Software Component Verification
Proceedings of the 17th IEEE international conference on Automated software engineering
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Three optimizations for Assume---Guarantee reasoning with L*
Formal Methods in System Design
Modular Conformance Testing and Assume-Guarantee Verification for Evolving Component-Based Software
APSEC '08 Proceedings of the 2008 15th Asia-Pacific Software Engineering Conference
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.00 |
An assume-guarantee verification method has been recognized as a promising approach to verify component-based software with model checking. The method is not only fitted to component-based software but also has a potential to solve the state space explosion problem in model checking. This method allows us to decompose a verification target into components so that we can model check each of them separately. In this method, assumptions which are environments of the components are generated. The number of states of the assumptions should be minimized because the computational cost of model checking is influenced by that number. Thus, we propose a method for generating minimal assumptions for the assume-guarantee verification of component-based software. The key idea of this method is finding the minimal assumptions in the search spaces of the candidate assumptions. These assumptions are seen as the environments needed for the components to satisfy a property and for the rest of the system to be satisfied. The minimal assumptions generated by the proposed method can be used to recheck the whole system at much lower computational cost. We have implemented a tool for generating the minimal assumptions. Experimental results are also presented and discussed.