In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Automating Modular Verification
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Detecting Errors Before Reaching Them
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Formula-Dependent Equivalence for Compositional CTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Assumption Generation for Software Component Verification
Proceedings of the 17th IEEE international conference on Automated software engineering
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Three-Valued Abstractions of Games: Uncertainty, but with Precision
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Synthesis of interface specifications for Java classes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular Verification of Open Features Using Three-Valued Model Checking
Automated Software Engineering
An Abstraction-Refinement Framework for Multi-Agent Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
3-Valued Abstraction: More Precision at Less Cost
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Automated assume-guarantee reasoning for simulation conformance
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
State/Event software verification for branching-time specifications
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Local Proofs for Linear-Time Properties of Concurrent Programs
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Local proofs for global safety properties
Formal Methods in System Design
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Learning component interfaces with may and must abstractions
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
| Hi-index | 0.00 |
Two of the most promising approaches to fighting the state explosion problem are abstraction and compositional verification. In this work we join their forces to obtain a novel fully automatic compositional technique that can determine the truth value of the full µ-calculus with respect to a given system. Given a system M = M1||M2, we view each component Mi as an abstraction Mi↑ of the global system. The abstract component Mi↑ is defined using a 3-valued semantics so that whenever a µ-calculus formula ϖ has a definite value (true or false) on Mi↑, the same value holds also for M. Thus, ϖ can be checked on either M1↑ or M2↑ (or both), and if any of them returns a definite result, then this result holds also for M. If both checks result in an indefinite value, the composition of the components needs to be considered. However, instead of constructing the composition of M1↑ and M2↑, our approach identifies and composes only the parts of the components in which their composition is necessary in order to conclude the truth value of ϖ. It ignores the parts which can be handled separately. The resulting model is often significantly smaller than the full system. We explain how our compositional approach can be combined with abstraction, in order to further reduce the size of the checked components. The result is an incremental compositional abstraction-refinement framework, which resembles automatic Assume-Guarantee reasoning.