2008 | OriginalPaper | Buchkapitel
A Complete Bounded Model Checking Algorithm for Pushdown Systems
verfasst von : Gérard Basler, Daniel Kroening, Georg Weissenbacher
Erschienen in: Hardware and Software: Verification and Testing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by (Link öffnet in neuem Fenster)
Pushdown systems (PDSs) consist of a stack and a finite state machine and are frequently used to model abstractions of software. They correspond to sequential recursive programs with finite-domain variables. This paper presents a novel algorithm for deciding reachability of particular locations of PDSs. We exploit the fact that most PDSs used in practice are
shallow
, and propose to use SAT-based Bounded Model Checking to search for counterexamples. Completeness is achieved by computing
universal summaries
of the procedures in the program.