Skip to main content

An evolving algebra abstract machine

  • Conference paper
  • First Online:

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

Abstract

Evolving algebras (EAs) as defined by Yuri Gurevich constitute the basis of a powerful and elegant specification and verification method which has successfully been applied to the design and analysis of various kinds of discrete dynamic systems. Aiming at the development of a comprehensive EA-based specification and design environment, we introduce the concept of an evolving algebra abstract machine (EAM) as a platform for the systematic development of EA tools; for instance, as required for machine based analysis and execution of EA specifications. We give a formal definition of the EAM ground model in terms of a universal evolving algebra, where we validate the correctness of the relation between evolving algebras (their theoretical foundations) and their EAM representation and interpretation. Our approach covers sequential as well as distributed evolving algebras.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernhard Beckert and Joachim Posegga. lean EA: A poor's man's evolving algebra compiler. Internal Report 25/95, Fakultät für Informatik, Universität Karlsruhe, April 1995.

    Google Scholar 

  2. Andreas Blass and Yuri Gurevich. Evolving Algebras and Linear Time Hierarchy. In B. Pehrson and I. Simon, editors, Proc. of the IFIP 13th World Computer Congress 1994, Volume I: Technology and Foundations, Elsevier Science Publishers B. V., 1994, pp. 383–390.

    Google Scholar 

  3. Egon Börger. Annotated bibliography on evolving algebras. In E. Börger, editor, Specification and Validation Methods. Oxford University Press, 1995.

    Google Scholar 

  4. Egon Börger, editor. Specification and Validation Methods. Oxford University Press, 1995.

    Google Scholar 

  5. Egon Borger. On the use of evolving algebras for hardware and software engineering. In Proc. of SOFSEM'95 (Nov. 25–Dec. 2, 1995, Bratislava, Czech Republic). To appear in LNCS.

    Google Scholar 

  6. Egon Börger and Igor Đurđanović. Correctness of compiling Occam to Transputer code. Computer Journal, to appear.

    Google Scholar 

  7. Egon Börger and Uwe Glässer. Modelling and analysis of distributed and reactive systems using evolving algebras. Technical Report NS-95-4, BRICS, July 1995.

    Google Scholar 

  8. G. Del Castillo, I. Đurđanovic and U. Glässer. Specification and Design of the EAM (EAM — Evolving Algebra Abstract Machine). Technical Report tr-rsfb-96-003, Paderborn University.

    Google Scholar 

  9. Dag Diesen. Specifying Algorithms using Evolving Algebra. Implementation of Functional Programming Languages. Research Report 199, Department of Informatics, University of Oslo, March 1995.

    Google Scholar 

  10. H. Ehrig and B. Mahr, editors. Fundamentals of Algebraic Specification 1 — Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.

    Google Scholar 

  11. L.M.G. Feijs and H.B.M. Jonkers, editors. Formal Specification and Design. Cambridge Tracts in Theoretical Computer Science 35. Cambridge University Press, 1992.

    Google Scholar 

  12. R.W. Gray, V.P. Heuring, St.P. Levi, A.M. Sloane, W.M. Waite, Eli: A Complete, Flexible Compiler Construction System, Communications of the ACM, Februar 1992, 12 1ff.

    Google Scholar 

  13. Yuri Gurevich. Evolving algebras — a tutorial introduction. Bulletin of the EATCS, (43);264–284, February 1991.

    Google Scholar 

  14. Yuri Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods. Oxford University Press, 1995.

    Google Scholar 

  15. A.M. Kappel. Executable specifications based on dynamic algebras. In A. Voronkov, editor, Logic Programming and Automated Reasoning, volume 698 of INAI, pages 229–240. Springer, 1993.

    Google Scholar 

  16. U. Kastens, W.M. Waite. Modularity and Reusability in Attribute Grammars. Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 102, Juli 1992.

    Google Scholar 

  17. R. Milner, M. Tofte and R. Harper. The Definition of Standard ML. The MIT Press, 1990.

    Google Scholar 

  18. Martin Wirsing. Algebraic specifications. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science B, pages 675–788. Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans Kleine Büning

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Del Castillo, G., Đurđanović, I., Glässer, U. (1996). An evolving algebra abstract machine. In: Kleine Büning, H. (eds) Computer Science Logic. CSL 1995. Lecture Notes in Computer Science, vol 1092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61377-3_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-61377-3_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61377-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics