Skip to main content
SpringerLink
Log in

Abstract State Machines at the Cusp of the Millenium

  • Conference paper
  • First Online:
Book cover Abstract State Machines - Theory and Applications (ASM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1912))

Included in the following conference series:

Abstract

The ASM’2000 Workshop marks for the ASM method the transition from its adolescence to the maturation period. The goals which have been achieved open new frontiers and put us into the position to embark on new challenges.

The initially present construct to shrink domains, which was motivated by concerns about resource bounds, was abandoned because it belongs to garbage collection rather than to high-level specication. Some technical variation was later introduced concerning the treatment of non determinism and of inconsistent update sets.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abstract State Machines. http://www.eecs.umich.edu/gasm/.

  2. ISO/IEC 13211-1. Prolog-Part 1: General Core. In Information Technology-Programming Languages. International Standards Organization, 1995.

    Google Scholar 

  3. M. Barnett, E. Börger, Y. Gurevich, W. Schulte, and M. Veanes. Using ASMs at Microsoft: A Case Study. In This volume.

    Google Scholar 

  4. E. Börger. Logic Programming: The Evolving Algebra Approach. In B. Pehrson and I. Simon, editor, IFIP 13th World Computer Congress, number I (Techno-logy/Foundations), pages 391–395. Elsevier, 1994.

    Google Scholar 

  5. E. Börger. High Level System Design and Analysis using Abstract State Machines. In D. Hutter and W. Stephan and P. Traverso and M. Ullmann, editor, Current Trends in Applied Formal Methods (FM-Trends 98), number 1641 in LNCS, pages 1–43. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  6. E. Börger, A. Cavarra, and E. Riccobene. Modeling the Dynamics of UML State Machines. In This volume.

    Google Scholar 

  7. E. Börger and K. Dässler. PROLOG. DIN Papers for Discussion. Report 58, ISO/IEC JTC1 SC22 WG17, April 1990.

    Google Scholar 

  8. E. Börger and B. Demoen. The view on database updates in Standard Prolog: a proposal and a rationale. Report 74, ISO/IEC JTC1 SC22 WG17, February 1991.

    Google Scholar 

  9. E. Börger and I. Durdanovic. Correctness of Compiling Occam to Transputer Code. Computer Journal, (39(1)):52–92, 1996.

    Article  Google Scholar 

  10. E. Börger and D. Rosenzweig. An Analysis of Prolog Database Views and Their Uniform Implementation. In K. Dässler and R. Scowen, editor, Prolog. Paris Papers-2, number 80, pages 87–130. National Physical Laboratory, Middlesex, July 1991.

    Google Scholar 

  11. E. Börger and D. Rosenzweig. The Mathematics of Set Predicates in Prolog. In K. Dässler and R. Scowen, editor, Prolog. Copenhagen Papers-2, number 105, pages 33–42. National Physical Laboratory, Middlesex, 1993.

    Google Scholar 

  12. E. Börger and D. Rosenzweig. The WAM-Definition and Compiler Correctness. In Ch. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, pages 20–90. Elsevier Science B.V./ North-Holland, 1995.

    Google Scholar 

  13. E. Börger and J. Schmid. Composition and Submachine Concepts for Sequential ASMs. In P. Clote and H. Schwichtenberg, editor, Gurevich Festschrift CSL 2000, LNCS. Springer-Verlag, 2000. (In print).

    Google Scholar 

  14. E. Börger, J. Schmid, and P. Päppinghaus. Report on a Practical Application of ASMs in Software Design. In This volume.

    Google Scholar 

  15. E. Börger, J. Schmid, and E. Riccobene. Capturing Requirements by Abstract State Machines: The Light Control Case Study. J. Universal Computer Science, 2000. Special Requirement Engineering Issue, to appear.

    Google Scholar 

  16. E. Börger, J. Schmid, R. Stärk, and W. Schulte. Java and the Java Virtual Machine. Springer-Verlag, 2000. to appear.

    Google Scholar 

  17. R. Eschbach, U. Glässer, R. Gotzhein, and A. Prinz. On the Formal Semantics of SDL-2000: a Compilation Approach Based on an Abstract SDL Machine. In This volume.

    Google Scholar 

  18. U. Glässer, R. Gotzhein, and A. Prinz. Towards a New Formal SDL Semantics Based on Abstract State Machines. In R. Dssouli and G.v. Bochmann and Y. Lahav, editor, SDL’99-The Next Millenium (Proc. of the 9th SDL FORUM). Elsevier Science B.V., 1999.

    Google Scholar 

  19. Y. Gurevich. Reconsidering Turing’s Thesis: Toward More Realistic Semantics of Programs. Technical Report CRL-TR-36-84, University of Michigan, Computing Research Lab, 1984.

    Google Scholar 

  20. Y. Gurevich. A New Thesis. Notices of the American Mathematical Society, page 317, 1985. abstract 85T-68-203, received May 13.

    Google Scholar 

  21. Y. Gurevich. Logic and the Challenge of Computer Science. In E. Börger, editor, Current Trends in Theoretical Computer Science, pages 1–57. Computer Science Press, 1988.

    Google Scholar 

  22. Y. Gurevich. Evolving Algebras: An Attempt to Discover Semantics. In G. Rozenberg and A. Salomaa, editors, Current Trends in Theoretical Computer Science, pages 225–234. World Scientific, 1993. A reprint of the article in the Bulletin of the European Association for Theoretical Computer Science, Number 35 (1991), pp.71–82.

    Google Scholar 

  23. Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9–36. Oxford University Press, 1995.

    Google Scholar 

  24. Y. Gurevich. Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic, 1, 2000.

    Google Scholar 

  25. Y. Gurevich and J. Morris. Algebraic operational semantics and modula-2. In Börger, E. et al., editor, CSL’87, 1st Workshop on Computer Science Logic, number 329 in LNCS, pages 81–101. Springer-Verlag, 1988.

    Google Scholar 

  26. Y. Gurevich and L. A. Moss. Algebraic operational semantics and occam. In Börger, E. et al., editor, CSL’89, 3d Workshop on Computer Science Logic, number 440 in LNCS, pages 176–192. Springer-Verlag, 1990.

    Google Scholar 

  27. C. Hofmeister, R.L. Nord, and D. Soni. Applied Software Architecture. Addison Wesley, 1999.

    Google Scholar 

  28. A.M. Kappel. Implementation of Dynamic Algebras with an Application to Prolog. Master’s thesis, CS Dept., University of Dortmund, Germany, November 1990. An extended abstract “Executable Specifications based on Dynamic Algebras” appeared in A. Voronkov (ed.): Logic Programming and Automated Reasoning, volume 698 of LNAI, Springer, 1993, pages 229–240.

    Google Scholar 

  29. B. Pehrson and I. Simon. IFIP 13th World Computer Congress. Vol.I: Technology/Foundations. Elsevier, 1994.

    Google Scholar 

  30. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison Wesley, 1999.

    Google Scholar 

  31. G. Schellhorn. Verifikation abstrakter Zustandsmaschinen. Phd thesis, CS Dept., University of Ulm, Germany, 1999. For an English version consult http://www.informatik.uni-ulm.de/pm/kiv/papers/verif-asms-english.ps.gz.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, I-56125, Pisa, Italy

    Egon Börger

Authors
  1. Egon Börger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA

    Yuri Gurevich

  2. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Philipp W. Kutter

  3. EPFL Lausanne, DI IN-Ecublens, 1015, Lausanne, Switzerland

    Martin Odersky

  4. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Lothar Thiele

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Börger, E. (2000). Abstract State Machines at the Cusp of the Millenium. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds) Abstract State Machines - Theory and Applications. ASM 2000. Lecture Notes in Computer Science, vol 1912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44518-8_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-44518-8_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67959-2

  • Online ISBN: 978-3-540-44518-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation