Formal verification of infinite state systems using boolean methods

Authors:
Randal E. Bryant
Affiliations:
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Venue:
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Year:
2006

Citing 5
Cited 0

Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking

Symbolic Model Checking
Modeling and Verification of Out-of-Order Microprocessors in UCLID

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most successful automated formal verification tools are based on a bit-level model of computation, where a set of Boolean state variables encodes the system state. Using powerful inference engines, such as Binary Decision Diagrams (BDDs) and Boolean satisfiability (SAT) checkers, symbolic model checkers and similar tools can analyze all possible behaviors of very large, finite-state systems.