Formal Verification of Infinite State Systems Using Boolean Methods

2007-04-01T00:00:00Z (GMT) by Randal E. Bryant
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.