Skip to main content
SpringerLink
Log in

Refinement of State-Based Systems: ASMs and Big Commuting Diagrams (Abstract)

  • Conference paper
Abstract State Machines, B and Z (ABZ 2008)

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

Included in the following conference series:

Abstract

Effective and efficient support for the incremental development of verified implementations from abstract requirements has always been of central importance for the successful application of formal methods in practice.

Effective means first, that a modelling language is available that allows an adequate problem specification. Second, a refinement theory must be available that preserves the relevant properties of the abstract specification.

Efficient means, that the refinement theory reduces the problem to the essential proof obligations necessary, and that the theorem prover provides powerful deduction support.

The talk discusses the topic from the experience we have gained from formalizing various refinement theories [1], [2] with the interactive theorem prover KIV [3], as well as from the correctness proofs for various case studies involving refinement.

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 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

References

  1. Boiten, E., Derrick, J., Schellhorn, G.: Relational concurrent refinement part ii: Internal operations and ouputs. In: FAC (2008)

    Google Scholar 

  2. Schellhorn, G.: Completeness of asm refinement. In: Proceedings of REFINE 2008. ENTCS (to appear, 2008)

    Google Scholar 

  3. Reif, W., Schellhorn, G., Stenzel, K., Balser, M.: Structured specifications and interactive proofs with KIV. In: Bibel, W., Schmitt, P. (eds.) Automated Deduction—A Basis for Applications. Systems and Implementation Techniques, vol. II, pp. 13–39. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  4. Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford Univ. Press, Oxford (1995)

    Google Scholar 

  5. Börger, E., Stärk, R.F.: Abstract State Machines—A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  6. Schellhorn, G.: Verification of ASM Refinements Using Generalized Forward Simulation. Journal of Universal Computer Science (J.UCS) 7(11), 952–979 (2001), http://www.jucs.org

    MathSciNet  Google Scholar 

  7. Börger, E.: The ASM Refinement Method. Formal Aspects of Computing 15(1–2), 237–257 (2003)

    Article  MATH  Google Scholar 

  8. Schellhorn, G.: ASM Refinement and Generalizations of Forward Simulation in Data Refinement: A Comparison. Journal of Theoretical Computer Science 336(2-3), 403–435 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Schellhorn, G.: ASM Refinement Preserving Invariants. In: Proceedings of the 14th International ASM Workshop, ASM 2007, Grimstad, Norway (2008); JUCS (to appear), http://ikt.hia.no/asm07/

  10. Derrick, J.: Mechanizing a refinement proof for a lock-free concurrent stack. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol. 5051, pp. 78–95. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Haneberg, D., Schellhorn, G., Grandy, H., Reif, W.: Verification of Mondex Electronic Purses with KIV: From Transactions to a Security Protocol. Formal Aspects of Computing 20(1) (January 2008)

    Google Scholar 

  12. Schellhorn, G., Reif, W., Schairer, A., Karger, P., Austel, V., Toll, D.: Verification of a Formal Security Model for Multiapplicative Smart Cards. special issue of the Journal of Computer Security 10(4), 339–367 (2002)

    Google Scholar 

  13. Schellhorn, G., Ahrendt, W.: Reasoning about Abstract State Machines: The WAM Case Study. Journal of Universal Computer Science (J.UCS) 3(4), 377–413 (1997), http://www.jucs.org

    MATH  MathSciNet  Google Scholar 

  14. Schellhorn, G., Ahrendt, W.: The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV. In: Bibel, W., Schmitt, P. (eds.) Automated Deduction — A Basis for Applications. Applications, vol. III, pp. 165–194. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  15. Schellhorn, G.: Verification of Abstract State Machines. PhD thesis, Universität Ulm, Fakultät für Informatik (1999), http://www.informatik.uni-augsburg.de/lehrstuehle/swt/se/publications/

  16. Börger, E., Rosenzweig, D.: The WAM—definition and compiler correctness. In: Beierle, C., Plümer, L. (eds.) Logic Programming: Formal Methods and Practical Applications. Studies in Computer Science and Artificial Intelligence, vol. 11, pp. 20–90. North-Holland, Amsterdam (1995)

    Google Scholar 

  17. Jifeng, H., Hoare, C.A.R., Sanders, J.W.: Data refinement refined. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 187–196. Springer, Heidelberg (1986)

    Google Scholar 

  18. Woodcock, J.C.P., Davies, J.: Using Z: Specification, Proof and Refinement. Prentice Hall International Series in Computer Science (1996)

    Google Scholar 

  19. Bolton, C., Davies, J., Woodcock, J.: On the refinement and simulation of data types and processes. In: Araki, K., Galloway, A., Taguchi, K. (eds.) Proceedings of the International conference of Integrated Formal Methods (IFM), pp. 273–292. Springer, Heidelberg (1999)

    Google Scholar 

  20. Abrial, J.R., Hallerstede, S.: Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B. Fundamenta Informaticae 21 (2006)

    Google Scholar 

  21. Lynch, N., Vaandrager, F.: Forward and Backward Simulations – Part I: Untimed systems. Information and Computation 121(2), 214–233 (1995); also: Technical Memo MIT/LCS/TM-486.b, Laboratory for Computer Science, MIT

    Article  MATH  MathSciNet  Google Scholar 

  22. Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science 2, 253–284 (1991); Also appeared as SRC Research Report 29

    Article  MathSciNet  Google Scholar 

  23. Derrick, J., Boiten, E.A., Bowman, H., Steen, M.: Weak Refinement in Z. In: Bowen, J., Hinchey, M. (eds.) ZUM 1997. LNCS, vol. 1212, pp. 369–388. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  24. Derrick, J., Wehrheim, H.: Using Coupled Simulations in Non-atomic Refinement. In: Bert, D., Bowen, J., King, S., Walden, M. (eds.) ZB 2003. LNCS, vol. 2651, pp. 127–147. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Stärk, R.F., Nanchen, S.: A Complete Logic for Abstract State Machines. Journal of Universal Computer Science (J.UCS) 7 (11), 981–1006 (2001)

    Google Scholar 

  26. Hesselink, W.H.: Universal extensions to simulate specifications. Information and Computation 206, 106–128 (2008)

    Article  MathSciNet  Google Scholar 

  27. Schellhorn, G., Grandy, H., Haneberg, D., Moebius, N., Reif, W.: A Systematic Verification Approach for Mondex Electronic Purses using ASMs. In: Abrial, J.-R., Glässer, U. (eds.) Dagstuhl Seminar on Rigorous Methods for Software Construction and Analysis. LNCS, vol. 5115, Springer, Heidelberg (2008)

    Google Scholar 

  28. Banach, R., Schellhorn, G.: On the refinement of atomic actions. In: Proceedings of REFINE 2007. ENTCS (2007)

    Google Scholar 

  29. Schellhorn, G., Banach, R.: A concept-driven construction of the mondex protocol using three refinements. In: Proceedings of ABZ conference 2008, vol. 5238. Springer, Heidelberg (2008)

    Google Scholar 

  30. Bäumler, S., Schellhorn, G., Balser, M., Reif, W.: Proving linearizability with temporal logic (submitted, draft available from the authors)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Softwaretechnik und Programmiersprachen, Universität Augsburg, D-86135, Augsburg, Germany

    Gerhard Schellhorn

Authors
  1. Gerhard Schellhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Michael Butler Jonathan P. Bowen Paul Boca

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schellhorn, G. (2008). Refinement of State-Based Systems: ASMs and Big Commuting Diagrams (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. https://doi.org/10.1007/978-3-540-87603-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87603-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87602-1

  • Online ISBN: 978-3-540-87603-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation