Skip to main content
SpringerLink
Log in

A Relational Encoding for a Clash-Free Subset of ASMs

  • Conference paper
  • First Online:
Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9675))

  • 793 Accesses

Abstract

This paper defines a static check for clash-freedom of ASM rules, including sequential and parallel composition, nondeterministic choice, and recursion. The check computes a formula that, if provable, makes a relational encoding of ASM rules possible, which is an important prerequisite for efficient deduction. The check is general enough to cover all sequential rules as well as many typical uses of parallel composition.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We regard potential clashes that occur only under some specific non-deterministic choices to be even worse than guaranteed clashes in every run. Even simulating runs of the ASM may fail to detect them. We also regard computing the same update twice as undesirable, and our approach will return in both cases.

References

  1. Börger, E., Rosenzweig, D.: The WAM–definition, compiler correctness. In: Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence, vol. 11, pp. 20–90. Elsevier (1995)

    Google Scholar 

  2. Börger, E., Stärk, R.F.: Abstract State Machines–a Method for High-level System Design and Analysis. Springer, Heidelberg (2003)

    Book  MATH  Google Scholar 

  3. Ernst, G., Pfähler, J., Schellhorn, G., Haneberg, D., Reif, W.: KIV - overview and VerifyThis competition. Softw. Tools Techn. Transfer 17(6), 677–694 (2015)

    Article  Google Scholar 

  4. Ferrarotti, F., Schewe, K.-D., Tec, L., Wang, Q.: A logic for non-deterministic parallel Abstract State Machines. In: Gyssens, M. (ed.) FoIKS 2016. LNCS, vol. 9616, pp. 334–354. Springer, Heidelberg (2016). doi:10.1007/978-3-319-30024-5_18

    Chapter  Google Scholar 

  5. Leuschel, M., Börger, E.: A compact encoding of sequential ASMs in Event-B. In: Butler, M., Schewe, K.D., Mashkoor, A., Biro, M. (eds.) ABZ 2016. LNCS, vol. 9675, pp. 119–134. Springer, Heidelberg (2016)

    Google Scholar 

  6. Schellhorn, G., Tofan, B., Ernst, G., Pfähler, J., Reif, W.: RGITL: a temporal logic framework for compositional reasoning about interleaved programs. Ann. Math. Artif. Int. (AMAI) 71, 131–174 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Stärk, R.F., Nanchen, S.: A complete logic for Abstract State Machines. J. Univ. Comput. Sci. (J.UCS) 7(11), 981–1006 (2001)

    MATH  Google Scholar 

  8. Stärk, R.F., Schmid, J., Börger, E.: Java and the Java Virtual Machine: Definition, Verification. Springer, Validation (2001)

    Book  MATH  Google Scholar 

  9. A relational encoding for a clash-free subset of ASMs: Formalization and proofs. https://swt.informatik.uni-augsburg.de/swt/projects/Refinement/ASM-clashfreedom.html

Download references

Author information

Authors and Affiliations

  1. Institute for Software and Systems Engineering, University of Augsburg, Augsburg, Germany

    Gerhard Schellhorn, Gidon Ernst, Jörg Pfähler & Wolfgang Reif

Authors
  1. Gerhard Schellhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gidon Ernst
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jörg Pfähler
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wolfgang Reif
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gerhard Schellhorn .

Editor information

Editors and Affiliations

  1. University of Southampton, Southampton, United Kingdom

    Michael Butler

  2. Software Competence Center, Hagenberg, Austria

    Klaus-Dieter Schewe

  3. Software Competence Center, Hagenberg, Austria

    Atif Mashkoor

  4. Software Competence Center, Hagenberg, Austria

    Miklos Biro

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Schellhorn, G., Ernst, G., Pfähler, J., Reif, W. (2016). A Relational Encoding for a Clash-Free Subset of ASMs. In: Butler, M., Schewe, KD., Mashkoor, A., Biro, M. (eds) Abstract State Machines, Alloy, B, TLA, VDM, and Z. ABZ 2016. Lecture Notes in Computer Science(), vol 9675. Springer, Cham. https://doi.org/10.1007/978-3-319-33600-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33600-8_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33599-5

  • Online ISBN: 978-3-319-33600-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation