Formal verification by symbolic evaluation of partially-ordered trajectories
Formal Methods in System Design - Special issue on symbolic model checking
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking
A framework for multi-valued reasoning over inconsistent viewpoints
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
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
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Word level predicate abstraction and refinement for verifying RTL verilog
Proceedings of the 42nd annual Design Automation Conference
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Latticed simulation relations and games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Systematic construction of abstractions for model-checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Why waste a perfectly good abstraction?
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Compositional verification and 3-valued abstractions join forces
SAS'07 Proceedings of the 14th international conference on Static Analysis
| Hi-index | 0.00 |
We present a framework for fully automated compositional verification of μ -calculus specifications over multi-valued systems, based on multi-valued abstraction and refinement. Multi-valued models are widely used in many applications of model checking. They enable a more precise modeling of systems by distinguishing several levels of uncertainty and inconsistency. Successful verification tools such as STE (for hardware) and YASM (for software) are based on multi-valued models. Our compositional approach model checks individual components of a system. Only if all individual checks return indefinite values, the parts of the components which are responsible for these values, are composed and checked. Thus the construction of the full system is avoided. If the latter check is still indefinite, then a refinement is needed. We formalize our framework based on bilattices, consisting of a truth lattice and an information lattice. Formulas interpreted over a multi-valued model are evaluated w.r.t. to the truth lattice. On the other hand, refinement is now aimed at increasing the information level of model details, thus also increasing the information level of the model checking result. Based on the two lattices, we suggest how multi-valued models should be composed, checked, and refined.