On Bounded Reachability of Programs with Set Comprehensions

  • Margus Veanes
  • Ando Saabas
Conference paper

DOI: 10.1007/978-3-540-89439-1_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5330)
Cite this paper as:
Veanes M., Saabas A. (2008) On Bounded Reachability of Programs with Set Comprehensions. In: Cervesato I., Veith H., Voronkov A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science, vol 5330. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Margus Veanes
    • 1
  • Ando Saabas
    • 2
  1. 1.Microsoft ResearchRedmondUSA
  2. 2.Institute of CyberneticsTallinn University of TechnologyTallinnEstonia

Personalised recommendations