Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract)

  • Margus Veanes
  • Ando Saabas
Conference paper

DOI: 10.1007/978-3-540-87603-8_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5238)
Cite this paper as:
Veanes M., Saabas A. (2008) Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract). In: Börger E., Butler M., Bowen J.P., Boca P. (eds) Abstract State Machines, B and Z. ABZ 2008. Lecture Notes in Computer Science, vol 5238. Springer, Berlin, Heidelberg

Abstract

We look at a fragment of ASMs used to model protocol-like aspects of software systems. Such models are used industrially as part of documentation and oracles in model-based testing of application-level network protocols. Correctness assumptions about the model are often expressed through state invariants. An important problem is to validate the model prior to its use as an oracle. We discuss a technique of using Satisfiability Modulo Theories or SMT to perform bounded reachability analysis of such models. We use the Z3 solver for our implementation and we use AsmL as the modeling language.

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