opaal: A Lattice Model Checker

  • Andreas Engelbredt Dalsgaard
  • René Rydhof Hansen
  • Kenneth Yrke Jørgensen
  • Kim Gulstrand Larsen
  • Mads Chr. Olesen
  • Petur Olsen
  • Jiří Srba
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6617)

Abstract

We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstractions of a model into the model itself. This provides an efficient verification procedure, while giving the user fine-grained control of the level of abstraction by using a method similar to Counter-Example Guided Abstraction Refinement. The opaal engine supports a subset of the UPPAAL timed automata language extended with lattice features. We report on the status of the first public release of opaal, and demonstrate how opaal can be used for efficient verification on examples from domains such as database programs, lossy communication protocols and cache analysis.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1-2), 63–92 (2001)CrossRefMATHGoogle Scholar
  2. 2.
    Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL 2002, pp. 58–70. ACM, New York (2002)Google Scholar
  3. 3.
    Ball, T., Rajamani, S.: The SLAM toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 260–264. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Olsen, P., Larsen, K.G., Skou, A.: Present and absent sets: Abstraction for testing of reactive systems with databases. In: Sixth Workshop on Model-Based Testing, Paphos, Cyprus (2010)Google Scholar
  6. 6.
    Garcia-Molina, H.: Elections in a distributed computing system. IEEE Trans. Comput. 31(1), 48–59 (1982)CrossRefGoogle Scholar
  7. 7.
    Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P.P., Staschulat, J., Stenstrm, P.: The Worst-Case Execution Time Problem - Overview of Methods and Survey of Tools. Trans. on Embedded Comp. Sys. 7(3), 1–53 (2008)CrossRefGoogle Scholar
  8. 8.
    Alt, M., Ferdinand, C., Martin, F., Wilhelm, R.: Cache Behavior Prediction by Abstract Interpretation. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145, pp. 52–66. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  9. 9.
    Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111(2), 193–244 (1994)CrossRefMATHGoogle Scholar
  10. 10.
    Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Andreas Engelbredt Dalsgaard
    • 1
  • René Rydhof Hansen
    • 1
  • Kenneth Yrke Jørgensen
    • 1
  • Kim Gulstrand Larsen
    • 1
  • Mads Chr. Olesen
    • 1
  • Petur Olsen
    • 1
  • Jiří Srba
    • 1
  1. 1.Department of Computer ScienceAalborg UniversityAalborg EastDenmark

Personalised recommendations