We present a new approach for proving safety properties of reactive systems, based on tight interaction between static analysis, theorem proving and abstraction techniques. The method incrementally constructs a proof or finds a counterexample. Every step consists of applying one of the techniques and makes constructive use of information obtained from failures in previous steps. The amount of user intervention is limited and is highly guided by the system at each step. We demonstrate the method on three simple examples, and show that by using it one can prove more properties than by using each component as a stand-alone.
CITATION STYLE
Rusu, V., & Singerman, E. (1999). On proving safety properties by integrating static analysis, theorem proving and abstraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1579, pp. 178–192). Springer Verlag. https://doi.org/10.1007/3-540-49059-0_13
Mendeley helps you to discover research relevant for your work.