Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving

Authors:
John M. Rushby
Affiliations:
-
Venue:
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Year:
1999

Citing 11
Cited 4

Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Subtypes for Specifications: Predicate Subtyping in PVS

IEEE Transactions on Software Engineering
Proceedings of the 10th International Conference on Computer Aided Verification

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Minimalist Proof Assistants: Interactions of Technology and Methodology in Formal System Level Verification (abstract)

FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Experiments in Theorem Proving and Model Checking for Protocol Verification

FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
InVeST: A Tool for the Verification of Invariants

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
An Integration of Model Checking with Automated Proof Checking

Proceedings of the 7th International Conference on Computer Aided Verification
Powerful Techniques for the Automatic Generation of Invariants

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification

Towards a Computer-Aided Design of Reactive Systems

Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Making abstraction-refinement efficient in model checking

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
An efficient approach for abstraction-refinement in model checking

Theoretical Computer Science
Detecting spurious counterexamples efficiently in abstract model checking

Proceedings of the 2013 International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mechanized formal methods that use both model checking and theorem proving seem to hold most promise for the future. Effective use of both technologies requires they be recast as methods for calculating properties of speciflcations, rather than merely verifying them. The most valuable properties are those that contribute to the development of invariants and property-preserving abstractions. We outline an architecture for verification tools based on iterated use of such capabilities.