A complete bounded model checking algorithm for pushdown systems

Authors:
Gérard Basler;Daniel Kroening;Georg Weissenbacher
Affiliations:
Computer Systems Institute, ETH Zurich, Zurich, Switzerland;Computer Systems Institute, ETH Zurich, Zurich, Switzerland;Computer Systems Institute, ETH Zurich, Zurich, Switzerland
Venue:
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Year:
2007

Citing 15
Cited 2

Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
A generic approach to the static analysis of concurrent programs with procedures

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Efficient Computation of Recurrence Diameters

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Efficient Algorithms for Model Checking Pushdown Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Over-Approximating Boolean Programs with Unbounded Thread Creation

FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Saturn: A scalable framework for error detection using Boolean satisfiability

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
A SAT characterization of boolean-program correctness

SPIN'03 Proceedings of the 10th international conference on Model checking software
SAT-based summarization for Boolean programs

Proceedings of the 14th international SPIN conference on Model checking software
Improving pushdown system model checking

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Context-Bounded model checking of concurrent software

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic model checking for asynchronous boolean programs

SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Rewriting models of boolean programs

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

LTL Model Checking for Recursive Programs

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Satisfiability modulo recursive programs

SAS'11 Proceedings of the 18th international conference on Static analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.