Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking

Authors:
Tommi Junttila;Jori Dubrovin
Affiliations:
Department of Information and Computer Science, Helsinki University of Technology TKK, TKK, Finland FIN-02015;Department of Information and Computer Science, Helsinki University of Technology TKK, TKK, Finland FIN-02015
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 15
Cited 1

Reasoning About Recursively Defined Data Structures

Journal of the ACM (JACM)
Model checking

Model checking
Checking Safety Properties Using Induction and a SAT-Solver

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Modeling and Verification of Out-of-Order Microprocessors in UCLID

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Decision Procedure for an Extensional Theory of Arrays

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Integrating decision procedures for temporal verification

Integrating decision procedures for temporal verification
Verification of Embedded Memory Systems using Efficient Memory Modeling

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures

Journal of Automated Reasoning
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Fast congruence closure and extensions

Information and Computation
Symbolic Step Encodings for Object Based Communicating State Machines

FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A tutorial on satisfiability modulo theories

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

Exploiting step semantics for efficient bounded model checking of asynchronous systems

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a Satisfiability Modulo Theories (SMT) solver as the back-end in SAT-based software model checking allows common data types to be represented directly in the language of the solver. A problem is that many software systems involve first-in-first-out queues but current SMT solvers do not support the theory of queues. This paper studies how to encode queues in the context of SMT-based bounded model checking, using only widely supported theories such as linear arithmetic and uninterpreted functions. Various encodings with considerably different compactness and requirements for available theories are proposed. An experimental comparison of the relative efficiency of the encodings is given.