Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computer Aided Systems Theory

EUROCAST 2001: Computer Aided Systems Theory — EUROCAST 2001 pp 20–35Cite as

Design for Reuse via Structuring Techniques for ASMs

  • Conference paper
  • First Online:

  • 425 Accesses

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

Abstract

Gurevich’s [26] Abstract State Machines (ASMs), characterized by the parallel execution of abstract atomic actions in a global state, have been equipped in [13] with a refinement by standard composition concepts for structuring large machines that allows reusing machine components. Among these concepts are parameterized (possibly recursive) sub-ASMs. Here we illustrate their power for incremental and modular system design by unfolding, via appropriate ASM components, the architecture of the Java Virtual Machine (JVM), resulting from the language layering in combination with the functional decomposition of the JVM into loader, verifier, and interpreter.We survey the ASM models for Java and the JVM that appear in [34], together with the mathematical and experimental analysis they support.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. R. Abrial. The B-Book. Assigning Programs to Meanings. Cambridge University Press, 1996.

    Google Scholar 

  2. E. Börger. A logical operational semantics for full Prolog. Part I: Selection core and control. In E. Börger, H. Kleine-Büning, and M. Richter, editors, CSL 89, number 440 in Lecture Notes in Computer Science, pages 36–64. Springer-Verlag, 1989.

    Google Scholar 

  3. E. Börger. A logical operational semantics for full Prolog. Part II: Built-in predicates for database manipulations. In B. Rovan, editor, MFCS’90. Mathematical Foundations of Computer Science, number 452 in Lecture Notes in Computer Science, pages 1–14. Springer-Verlag, 1990.

    Google Scholar 

  4. E. Börger. Logic programming: The evolving algebra approach. In B. Pehrson and I. Simon, editors, IFIP 13th World Computer Congress 1994. Volume I: Technology and Foundations, pages 391–395. Elsevier, Amsterdam, 1994.

    Google Scholar 

  5. E. Börger. High level system design and analysis using Abstract State Machines. In D. Hutter, W. Stephan, P. Traverso, and M. Ullmann, editors, Current Trends in Applied Formal Methods (FM-Trends 98), number 1641 in Lecture Notes in Computer Science, pages 1–43. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  6. E. Börger. Abstract State Machines at the cusp of the millenium. In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, Abstract State Machines. Theory and Applications, number 1912 in Lecture Notes in Computer Science, pages 1–8. Springer-Verlag, 2000.

    Chapter  Google Scholar 

  7. E. Börger, A. Cavarra, and E. Riccobene. An ASM semantics for UML Activity Diagrams. In T. Rust, editor, Proc. AMAST 2000, number 1912 in Lecture Notes in Computer Science, pages 361–366. Springer-Verlag, 2000.

    Google Scholar 

  8. E. Börger, A. Cavarra, and E. Riccobene. Modeling the Dynamics of UML State Machines. In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, Abstract State Machines. Theory and Applications, number 1912 in Lecture Notes in Computer Science, pages 223–241. Springer-Verlag, 2000.

    Chapter  Google Scholar 

  9. E. Börger and K. Dässler. Prolog: DIN papers for discussion. In ISO/IEC JTCI SC22 WG17 Prolog standardization document, number 58 in ISO/IEC Documents, pages 92–114. NPL Middlesex, 1990.

    Google Scholar 

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

    Article  Google Scholar 

  11. E. Börger, E. Riccobene, and J. Schmid. Capturing Requirements by Abstract State Machines: The Light Control Case Study. J. Universal Computer Science, 6.7:597–620, 2000. Special Requirement Engineering Issue.

    Google Scholar 

  12. E. Börger and D. Rosenzweig. The WAM-Definition and Compiler Correctness. In C. 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. In P. G. Clote and H. Schwichtenberg, editors, Computer Science Logic (CSL 2000), number 1862 in Lecture Notes in Computer Science, pages 41–60. Springer-Verlag, 2000.

    Chapter  Google Scholar 

  14. E. Börger, J. Schmid, and P. Päppinghaus. Report on a Practical Application of ASMs in Software Design. In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, Abstract State Machines. Theory and Applications, number 1912 in Lecture Notes in Computer Science, pages 361–366. Springer-Verlag, 2000.

    Chapter  Google Scholar 

  15. U. Glässer, Y. Gurevich, and M. Veanes. Universal Plug and PlayMachine Models. Technical Report MSR-TR-2001-59, Microsoft Research, 2001.

    Google Scholar 

  16. W. Goerigk and H. Langmaack. Compiler Implementation Verification and Trojan Horses. In D. Bainov, editor, Proc. 9th International Colloquium on Numerical Analysis and Computer Science with Applications, Plovdiv, Bulgaria, 2001. Extended Draft Version available at http://www.informatik.uni-kiel.de/~wg/-Berichte/Plovdiv.ps.gz.

  17. W. Goerigk and H. Langmaack. Will Informatics be able to Justify the Construction of Large Computer Based Systems? Technical Report 2015, CS Department University of Kiel, 2001.

    Google Scholar 

  18. G. Goos and W. Zimmermann. Verification of compilers. In Correct System Design, number 1710 in Lecture Notes in Computer Science, pages 201–230. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  19. G. Goos and W. Zimmermann. Verifying compilers and ASMs. In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, Correct System Design, number 1912 in Lecture Notes in Computer Science, pages 177–202. Springer-Verlag, 2000.

    Google Scholar 

  20. J. Gosling, B. Joy, and G. Steele. The Java(tm) Language Specification. Addison Wesley, 1996.

    Google Scholar 

  21. J. Gosling, B. Joy, G. Steele, and G. Bracha. The Java(tm) Language Specification. Addison Wesley, second edition, 2000.

    Google Scholar 

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

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

    Google Scholar 

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

  25. Y. Gurevich. Evolving algebras: An attempt to discover semantics. Bulletin of the EATCS, 43:264–284, 1991.

    MATH  Google Scholar 

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

  27. J. Huggins. Abstract State Machines. ASM Web pages, maintained at http://www.eecs.umich.edu/gasm/<http://www.eecs.umich.edu/gasm/>.

  28. ISO. ISO/IEC 13211-1 Information Technology-Programming Languages-Prolog-Part 1: General Core. ISO, 1995.

    Google Scholar 

  29. ITU. ITU-T Recommendation Z-100: Languages for Telecommunications Applications-Specification and Description Language SDL. Annex F: SDL formal semantics definition, 2000.

    Google Scholar 

  30. A. 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 

  31. T. Lindholm and F. Yellin. The Java(tm) Virtual Machine Specification. Addison Wesley, second edition, 1999.

    Google Scholar 

  32. M. Russo. Java et ses aspect concurrents: semantiques formelle, visualisation et proprietes, 2001. PhD thesis University of Nice-Sophia-Antipolis.

    Google Scholar 

  33. J. Schmid. Executing ASM specifications with AsmGofer, 1999. Web pages at http://www.tydo.de/AsmGofer<http://www.tydo.de/AsmGofer>.

  34. R. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine. Definition, Verification, Validation. Springer-Verlag, 2001.

    Google Scholar 

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. Universidad de Las Palmas de Gran Canaria, Instituto Universitario de Ciencias y Tecnologías Cibernéticas, Campus de Tafira, 35017, Las Palmas de Gran Canaria, Spain

    Roberto Moreno-Díaz

  2. University of Linz, Research Institute for Symbolic Computation, 232, Schloss Hagenberg, Austria

    Bruno Buchberger

  3. University ofA Coruña, Facultad de Informática, LFCIA, Dpto. of Computer Science, Campus de Elviña, 15071, A Coruña, Spain

    José Luis Freire

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Börger, E. (2001). Design for Reuse via Structuring Techniques for ASMs. In: Moreno-Díaz, R., Buchberger, B., Luis Freire, J. (eds) Computer Aided Systems Theory — EUROCAST 2001. EUROCAST 2001. Lecture Notes in Computer Science, vol 2178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45654-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45654-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42959-3

  • Online ISBN: 978-3-540-45654-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation