On Bounded Reachability of Programs with Set Comprehensions

Authors:
Margus Veanes;Ando Saabas
Affiliations:
Microsoft Research, Redmond, USA;Institute of Cybernetics, Tallinn University of Technology, Tallinn, Estonia
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 25
Cited 2

Hilbert's tenth problem

Hilbert's tenth problem
Evolving algebras 1993: Lipari guide

Specification and validation methods
Logic with equality: partisan corroboration and shifted pairing

Information and Computation
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Generating finite state machines from abstract state machines

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A rewriting approach to satisfiability procedures

Information and Computation - RTA 2001
A Decision Procedure for an Extensional Theory of Arrays

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Semantic essence of AsmL

Theoretical Computer Science - Formal methods for components and objects
Interpolation for data structures

Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Can abstract state machines be useful in language theory?

Theoretical Computer Science
Applications of Hierarchical Reasoning in the Verification of Complex Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Model-Based Software Testing and Analysis with C#

Model-Based Software Testing and Analysis with C#
Model-Based Quality Assurance of Windows Protocol Documentation

ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
An SMT Approach to Bounded Reachability Analysis of Model Programs

FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Decision procedures for multisets with cardinality constraints

VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
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
What else is decidable about integer arrays?

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Model-based testing of object-oriented reactive systems with spec explorer

Formal methods and testing
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
What's decidable about arrays?

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
An algorithm for deciding BAPA: boolean algebra with presburger arithmetic

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Bounded model checking of software using SMT solvers instead of SAT solvers

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

Input-Output Model Programs

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Symbolic bounded conformance checking of model programs

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the bounded reachability problem of programs that use abstract data types and set comprehensions. Such programs are common as high-level executable specifications of complex protocols. We prove decidability and undecidability results of restricted cases of the problem and extend the Satisfiability Modulo Theories approach to support analysis of set comprehensions over tuples and bag axioms. We use the Z3 solver for our implementation and experiments, and we use AsmL as the modeling language.