Information Reuse for Multi-goal Reachability Analyses

  • Dirk Beyer
  • Andreas Holzer
  • Michael Tautschnig
  • Helmut Veith
Conference paper

DOI: 10.1007/978-3-642-37036-6_26

Volume 7792 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Beyer D., Holzer A., Tautschnig M., Veith H. (2013) Information Reuse for Multi-goal Reachability Analyses. In: Felleisen M., Gardner P. (eds) Programming Languages and Systems. ESOP 2013. Lecture Notes in Computer Science, vol 7792. Springer, Berlin, Heidelberg

Abstract

It is known that model checkers can generate test inputs as witnesses for reachability specifications (or, equivalently, as counterexamples for safety properties). While this use of model checkers for testing yields a theoretically sound test-generation procedure, it scales poorly for computing complex test suites for large sets of test goals, because each test goal requires an expensive run of the model checker. We represent test goals as automata and exploit relations between automata in order to reuse existing reachability information for the analysis of subsequent test goals. Exploiting the sharing of sub-automata in a series of reachability queries, we achieve considerable performance improvements over the standard approach. We show the practical use of our multi-goal reachability analysis in a predicate-abstraction-based test-input generator for the test-specification language FQL.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Dirk Beyer
    • 1
  • Andreas Holzer
    • 2
  • Michael Tautschnig
    • 3
    • 4
  • Helmut Veith
    • 2
  1. 1.University of PassauGermany
  2. 2.Vienna University of TechnologyAustria
  3. 3.University of OxfordUK
  4. 4.Queen Mary, University of LondonUK