On Bounded Reachability of Programs with Set Comprehensions
- 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
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.
Unable to display preview. Download preview PDF.