Formal Verification of Infinite State Systems Using Boolean Methods

DOI10.1007/11805618_1MaRDI QIDQ3527279zbMATH OpenOpenAlexFDO

Authors Randal E. Bryant

Publication date 25 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11805618_1

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Bounded model checking of infinite state systems
• scientific article; zbMATH DE number 2084755
• Model-Checking Large Finite-State Systems and Beyond
• BDD-based symbolic model checking
• Symbolic model checking: \(10^{20}\) states and beyond

Cited in

(7)

• Formal Verification of Infinite-State BIP Models
• Automated Deduction – CADE-20
• scientific article; zbMATH DE number 2084755 (Why is no real title available?)
• Generalization strategies for the verification of infinite state systems
• Finite verification of the characteristic specification of discrete systems
• Formally verified algorithms for upper-bounding state space diameters
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Describes a project that uses

Uses Software

• UCLID

This page was built for publication: Formal Verification of Infinite State Systems Using Boolean Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527279)