Formal Verification of Infinite State Systems Using Boolean Methods
journal contributionposted on 01.04.2007 by Randal E. Bryant
Any type of content formally published in an academic journal, usually following a peer-review process.
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.