Abstract State Machines: A unifying view of models of computation and of system design frameworks

Annals of Pure and Applied Logic

Volumn 133, Issue 1-3 SPEC. ISS., 2005, Pages 149-171

  Börger, Egon ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14644412475     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.10.007     Document Type: Article

References (47)

1. J.-R. Abrial The B-Book 1996 Cambridge University Press
2. J.-R. Abrial Extending B without changing it (for developing distributed systems) In: H. Habrias (Eds.) 1st Conference on the B Method 1996 2-906082-25-2 pp. 169-190
3. J.-R. Abrial L. Mussat Specification and design of a transmission protocol by successive refinements using B In: M. Broy B. Schieder (Eds.) Mathematical Methods in Program Development 1996 Springer-Verlag
4. J.-R. Abrial L. Mussat Introducing dynamic constraints in B In: D. Bert (Eds.) B'98: Recent Advances in the Development and Use of the B Method LNCS vol. 1393 1998 Springer-Verlag 82-128
5. R. Alur D.L. Dill A theory of timed automata Theoretical Computer Science 126 1994 183-235
6. C. Beierle E. Börger Refinement of a typed WAM extension by polymorphic order-sorted types Formal Aspects of Computing 8 5 1996 539-564
7. C. Beierle E. Börger Specification and correctness proof of a WAM extension with abstract type constraints Formal Aspects of Computing 8 4 1996 428-462
8. A. Blass Y. Gurevich Abstract state machines capture parallel algorithms ACM Transactions on Computational Logic 3 2002
9. C. Böhm G. Jacopini Flow diagrams, Turing machines, and languages with only two formation rules Communications of the ACM 9 5 1966 366-371
10. T. Bolognesi E. Börger Abstract state processes In: E. Börger A. Gargantini E. Riccobene (Eds,) Abstract State Machines 2003 - Advances in Theory and Applications LNCS vol. 2589 2003 Springer-Verlag pp. 22-32
11. E. Börger Computability, Complexity, Logic (English translation of Berechenbarkeit, Komplexität, Logik) Studies in Logic and the Foundations of Mathematics vol. 128 1989 North-Holland
12. E. Börger High level system design and analysis using abstract state machines In: D. Hutter W. Stephan P. Traverso M. Ullmann (Eds.) Current Trends in Applied Formal Methods, FM-Trends 98 LNCS vol. 1641 1999 Springer-Verlag pp. 1-43
13. E. Börger, Computation and specification models. A comparative study. in: P.D. Mosses (Ed.), Proceedings of the Fourth International Workshop on Action Semantics, December 2002, Department of Computer Science at University of Aarhus, BRICS Series, vol. NS-02-8, 2002, pp. 107-130
14. E. Börger The origins and the development of the ASM method for high level system design and analysis Journal of Universal Computer Science 8 1 2002 2-74
15. E. Börger T. Bolognesi Remarks on turbo ASMs for computing functional equations and recursion schemes In: E. Börger A. Gargantini E. Riccobene (Eds.) Abstract State Machines 2003 - Advances in Theory and Applications LNCS vol. 2589 2003 Springer-Verlag pp. 218-228
16. E. Börger I. Durdanović Correctness of compiling occam to transputer code Computer Journal 39 1 1996 52-92
17. E. Börger F.J. López-Fraguas M. Rodríguez-Artalejo A model for mathematical analysis of functional logic programs and their implementations In: B. Pehrson I. Simon (Eds.) IFIP 13th World Computer Congress Technology/Foundations vol. I 1994 Elsevier, Amsterdam The Netherlands pp. 410-415
18. E. Börger D. Rosenzweig A mathematical definition of full prolog Science of Computer Programming 24 1995 249-286
19. E. Börger D. Rosenzweig The WAM - definition and compiler correctness In: C. Beierle L. Plümer (Eds.) Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence 1995 North-Holland pp. 20-90
20. E. Börger R. Salamone CLAM specification for provably correct compilation of CLP(R) programs In: E. Börger (Eds.) Specification and Validation Methods 1995 Oxford University Press pp. 97-130
21. E. Börger J. Schmid Composition and submachine concepts for sequential ASMs In: P. Clote H. Schwichtenberg (Eds,) Computer Science Logic, Proceedings of CSL 2000 LNCS vol. 1862 2000 Springer-Verlag pp. 41-60
22. E. Börger D. Sona A neural abstract machine Journal of Universal Computer Science 7 11 2001 1007-1024
23. E. Börger R. Stärk Abstract State Machines. A Method for High-Level System Design and Analysis 2003 Springer-Verlag
24. K.M. Chandy J. Misra Parallel Program Design. A Foundation 1988 Addison Wesley
25. M. Davis The Universal Computer: The Road from Leibniz to Turing 2000 W.W. Norton New York
26. E.W. Dijkstra Structure of the T.H.E. multiprogrammming system Communications of the ACM 11 1968 341-346
27. S. Eilenberg Automata, Machines and Languages vol. A 1974 Academic Press
28. L.M.G. Feijs H.B.M. Jonkers Formal Specification and Design 1992 Cambridge University Press
29. J. Fitzgerald P.G. Larsen Modelling Systems. Practical Tool and Techniques in Software Development 1998 Cambridge University Press
30. N.G. Fruja R.F. Stärk The hidden computation steps of turbo abstract state machines In: E. Börger A. Gargantini E. Riccobene (Eds.) Abstract State Machines 2003-Advances in Theory and Applications Lecture Notes in Computer Science vol. 2589 2003 Springer-Verlag pp. 244-262
31. U. Glässer Y. Gurevich M. Veanes High-level executable specification of the universal plug and play architecture Proceedings of 35th Hawaii International Conference on System Sciences - 2002 2002 IEEE Computer Society Press pp. 1-10
32. Y. Gurevich Evolving algebras 1993: Lipari guide In: E. Börger (Eds.) Specification and Validation Methods 1995 Oxford University Press pp. 9-36
33. Y. Gurevich Sequential abstract state machines capture sequential algorithms ACM Transactions on Computational Logic 1 1 2000 77-111
34. Y. Gurevich M. Spielmann Recursive abstract state machines Journal of Universal Computer Science 3 4 1997 233-246
35. J.A. Hall Taking Z seriously ZUM'97 LNCS vol. 1212 1997 Springer-Verlag
36. C. Heitmeyer, Using SCR methods to capture, document, and verify computer system requirements, in: E. Börger, B. Hörger, D.L. Parnas, D. Rombach (Eds.), Requirements Capture, Documentation, and Validation, Dagstuhl Seminar Report 99241, 1999
37. J.W. Janneck, Syntax and semantics of graphs. Ph.D. Thesis, ETH Zürich, 2000
38. D.E. Johnson L.S. Moss Grammar formalisms viewed as evolving algebras Linguistics and Philosophy 17 1994 537-560
39. E. Kohlbrenner D. Morris B. Morris The history of virtual machines Web pages at: http://cne.gmu.edu/itcore/virtualmachine/history.htm
40. L. Lavagno A. Sangiovanni-Vincentelli E.M. Sentovitch Models of computation for system design In: E. Börger (Eds.) Architecture Design and Validation Methods 2000 Springer-Verlag 243-295
41. Y.N. Moschovakis What is an algorithm? In: B. Engquist W. Schmid (Eds.) Mathematics Unlimited - 2001 and Beyond 2001 Springer-Verlag
42. D. Parnas J. Madey Functional documents for computer systems Science of Computer Programming 25 1995 41-62
43. W. Reisig Elements of Distributed Algorithms 1998 Springer-Verlag
44. D. Scott Definitional suggestions for automata theory Journal of Computer and System Sciences 1 1967 187-212
45. R. Stärk J. Schmid E. Börger Java and the Java Virtual Machine: Definition, Verification, Validation 2001 Springer-Verlag
46. P. Wegner Why interaction is more powerful than algorithms Communications of the ACM 40 1997 80-91
47. J.C.P. Woodcock J. Davies Using Z: Specification, Refinement, and Proof 1996 Prentice-Hall