The ASM Refinement Method

Formal Aspects of Computing

Volumn 15, Issue 2-3, 2003, Pages 237-257

  Börger, Egon ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Models of computation; Specifying and Verifying and Reasoning about Programs

Indexed keywords

CODES (STANDARDS); FORMAL LOGIC; FUNCTIONS; SEMANTICS; SOFTWARE ENGINEERING;

ABSTRACT STATE MACHINE (ASM); MODELS OF COMPUTATION; SPECIFYING AND VERIFYING AND REASONING ABOUT PROGRAMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0842305097     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-003-0012-7     Document Type: Conference Paper

References (85)

1. [Abr96] Abrial, J.-R.: The B-Book. Cambridge University Press, 1996.
2. [AbM98] Abrialm, J.-R. and Mussat, L.: Introducing dynamic constraints in b. In Bert, D., editor, B'98: Recent Advances in the Development and Use of the B Method, volume 1393 of LNCS, Springer, 1998, pp. 82-128.
3. [AlD94] Alur, R. and Dillm, D. L.: A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
4. [Bac79] Back, R. J. R.: On correct refinement of programs. Journal of Computer and System Sciences, 23(1):49-68, 1979.
5. [Bav98] Back, R. J. R. and von Wright, J.: Refinement Calculus: A Systematic Introduction. Springer, 1998.
6. [BBG00] Barnett, M., Börger, E., Gurevich, Y., Schulte, W. and Veanes, M.: Using Abstract State Machines at Microsoft: A case study. In Y. Gurevich, P. Kutter, M. Odersky and L. Thiele, editors, Abstract State Machines: Theory and Applications, volume 1912 of LNCS, Springer 2000, pp. 367-380.
7. [BeB92] Beierle, C. and Börger, E.: Correctness proof for the WAM with types. In E. Börger, G. Jäger, H. Kleine Büning and M. M. Richter, editors, Computer Science Logic, volume 626 of LNCS, Springer 1992, pp. 15-34.
8. [BeB96a] Beierle, C. and Börger, E.: Refinement of a typed WAM extension by polymorphic order-sorted types. Formal Aspects of Computing, 8(5):539-564, 1996.
9. [BeB96b] Beierle, C. and Börger, E.: Specification and correctness proof of a WAM extension with abstract type constraints. Formal Aspects of Computing, 8(4):428-162, 1996.
10. [BoB87] Bolognesi, T. and Brinksma, E.: Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14(1):25-59, 1987.
11. [Bor89] Börger, E.: Computability, Complexity, Logic (English translation of Berechenbarkeit, Komplexität, Logik), volume 128 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1989.
12. [Bor90a] Börger, E.: A logical operational semantics for full Prolog. Part I: Selection core and control. In Börger, E., Kleine Büning, H., Richter, M. M. and Schönfeld, W., editors, CSL'89. 3rd Workshop on Computer Science Logic, volume 440 of LNCS, Springer, 1990, pp. 36-64.
13. [Bor90b] Börger, E.: A logical operational semantics of full Prolog. Part II: Built-in predicates for database manipulation. In B. Rovan, editor, Mathematical Foundations of Computer Science, volume 452 of LNCS, Springer, 1990, pp. 1-14.
14. [Bor92] Börger, E.: A logical operational semantics for full Prolog. Part III: Built-in predicates for files, terms, arithmetic and input-output. In Y. Moschovakis, editor, Logic From Computer Science, volume 21 of Berkeley Mathematical Sciences Research Institute Publications, Springer, 1992, pp. 17-50.
15. [Bor94] Börger, E.: Logic programming: The evolving algebra approach. In B. Pehrson and I. Simon, editors, IFIP 13th World Computer Congress, volume I: Technology/Foundations, Elsevier, Amsterdam, 1994, pp. 391-395.
16. [Bor99] Börger, E.: 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), volume 1641 of LNCS, Springer, 1999, pp. 1-43.
17. [Bor02a] Börger, E.: Computation and specification models: a comparative study. In P. D. Mosses, editor, Proceedings of the Fourth International Workshop on Action Semantics, volume NS-02-8 of BRICS Series, Department of Computer Science at University of Aarhus, December 2002, pp. 107-130.
18. [Bor02b] Börger, E.: The origins and the development of the ASM method for high level system design and analysis. Journal of Universal Computer Science, 8(1):2-74, 2002.
19. [Bor03] Börger, E.: Abstract State Machines: a unifying view of models of computation and of system design frameworks. Annals of Pure and Applied Logic, 2003.
20. [BoB03] Börger, E. and Bolognesi, T.: Remarks on turbo ASMs for computing functional equations and recursion schemes. In E. Börger, A. Gargantini and E. Riccobene, editors, Abstract State Machines 2003, volume 2589 of LNCS. Springer, 2003.
21. [BCR00] Börger, E., Cavarra, A. and Riccobene, E.: An ASM semantics for UML activity diagrams. In T. Rus, editor, Algebraic Methodology and Software Technology, 8th International Conference, AMAST 2000, Iowa City, Iowa, USA, May 20-27, 2000, volume 1816 of LNCS, Springer 2000, pp. 293-308.
22. [BoD90] Börger, E. and Dässler, K.: Prolog: DIN papers for discussion. ISO/IEC JTCI SC22 WG17 Prolog Standardisation Document 58, National Physical Laboratory, Middlesex, UK, 1990.
23. [BoD95] B̈orger, E. and Del Castillo, G.: A formal method for provably correct composition of a real-life processor out of basic components (APE100 Reverse Engineering Study). In B. Werner, editor, Proceedings of the First IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'95), November 1995, pp. 145-148.
24. [BoD96] Börger, E. and Durdanović, I.: Correctness of compiling Occam to Transputer code. Computer Journal, 39(1):52-92, 1996.
25. [BDR94] Börger, E., Durdanović, I. and Rosenzweig, D.: Occam: specification and compiler correctness. Part I: Simple mathematical interpreters. In U. Montanari and E. R. Olderog, editors, Proceedings of PROCOMET'94 (IFIP Working Conference on Programming Concepts, Methods and Calculi), North-Holland, 1994, pp. 489-508.
26. [BGM94] Börger, E., Glässer, U. and Müller, W.: The semantics of behavioral VHDL'93 descriptions. In EURO-DAC94. European Design Automation Conference with EURO-VHDL'94, Los Alamitos, CA, 1994. IEEE Computer Society Press, pp. 500-505.
27. [BGM95] Börger, E., Glässer, U. and Müller, W.: Formal definition of an abstract VHDL'93 simulator by ea-machines. In C. Delgado Kloos and P. T. Breuer, editors, Formal Semantics for VHDL, Kluwer, 1995, pp. 107-139
28. [BGR95] Börger, E., Gurevich, Y. and Rosenzweig, D.: The bakery algorithm: yet another specification and verification. In E. Börger, editor, Specification and Validation Methods, Oxford University Press, 1995, pp. 231-243
29. [BLR94] Börger, E., López-Fraguas, F. J. and Rodríguez-Artalejo, M.: A model for mathematical analysis of functional logic programs and their implementations. In B. Pehrson and I. Simon, editors, IFIP 13th World Computer Congress, volume I: Technology/Foundations, Elsevier, Amsterdam, 1994, pp. 410-415.
30. [BoM97a] Börger, E. and Mazzanti, S.: A practical method for rigorously controllable hardware design. In J. P. Bowen, M. B. Hinchey and D. Till, editors, ZUM'97: The Z Formal Specification Notation, volume 1212 of LNCS, Springer, 1997, pp. 151-187.
31. [BoM97b] Börger, E. and Mearelli, L.: Integrating ASMs into the software development life cycle. Journal of Universal Computer Science, 3(5):603-665, 1997.
32. [BoR92a] Börger, E. and Riccobene, E.: A mathematical model of concurrent Prolog. Research Report CSTR-92-15, Department of Computer Science, University of Bristol, UK, 1992.
33. [BoR93] Börger, E. and Riccobene, E.: A formal specification of Parlog. In M. Droste and Y. Gurevich, editors, Semantics of Programming Languages and Model Theory, Gordon & Breach, 1993, pp. 1-2.
34. [BoR94] Börger, E. and Riccobene, E.: Logic + control revisited: an abstract interpreter for Gödel programs. In G. Levi, editor, Advances in Logic Programming Theory, Oxford University Press, 1994, pp. 231-154.
35. [BoR91] Börger, E. and Rosenzweig, D.: From Prolog algebras towards WAM: a mathematical study of implementation. In E. Börger, H. Kleine Büning, M. M. Richter and W. Schönfeld, editors, CSL'90, 4th Workshop on Computer Science Logic, volume 533 of LNCS, Springer 1991, pp. 31-66.
36. [BoR92b] Börger, E. and Rosenzweig, D.: WAM algebras: a mathematical study of implementation, Part 2. In A. Voronkov, editor, Logic Programming, volume 592 of Lecture Notes in Artificial Intelligence, Springer, 1992, pp. 35-54.
37. [BoR95a] Börger, E. and Rosenzweig, D.: A mathematical definition of full Prolog. Science of Computer Programming, 24:249-286, 1995.
38. [BoR95b] Börger, E. and Rosenzweig, D.: The WAM: definition and compiler correctness. In C. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence, chapter 2, North-Holland, 1995, pp. 20-90.
39. [BoS95] Börger, E. and Salamone, R.: CLAM specification for provably correct compilation of CLP(R) programs. InE. Börger, editor, Specification and Validation Methods, Oxford University Press, 1995, pp. 97-130.
40. [BoS00a] Börger, E. and Schmid, J.: Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL 2000), volume 1862 of LNCS, Springer, 2000, pp. 41-60.
41. [BoS91] Börger, E. and Schmitt, P.: A formal operational semantics for languages of type Prolog III. In E. Börger, H. Kleine Büning, M. M. Richter and W. Schönfeld, editors, CSL'90, 4th Workshop on Computer Science Logic, volume 533 of LNCS, Springer, 1991, pp. 67-79.
42. [BoS98] Börger, E. and Schulte, W.: Programmer friendly modular definition of the semantics of Java. In J. Alves-Foss, editor, Formal Syntax and Semantics of Java, volume 1523 of LNCS. Springer, 1998.
43. [BoS00b] Börger, E. and Schulte, W.: A practical method for specification and analysis of exception handling: a Java/JVM case study. IEEE Transactions on Software Engineering, 26(10):872-887, October 2000.
44. [BoS03] Börger, E. and Stärk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, 2003.
45. [BPR84] Brüggemann, A., Priese, L., Rödding, D. and Schätz, R.: Modular decomposition of automata. In E. Börger, G. Hasenjäger and D. Rödding, editors, Logic and Machines: Decision Problems and Complexity, volume 171 LNCS, Springer, 1984, pp. 198-236.
46. [CoS00] Cohen, J. and Slissenko, A.: On verification of refinements of asynchronous timed distributed algorithms. In Y. Gurevich, P. Kutter, M. Odersky and L. Thiele, editors, Abstract State Machines: Theory and Applications, volume 1912 of LNCS, Springer, 2000, pp. 34-49.
47. [DDH72] Dahl, O., Dijkstra, E. W. and Hoare, C.: Structured Programming. Academic Press, 1972.
48. [deE98] de Roever, W. P. and Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge University Press, 1998.
49. [DeB01] Derrick, J. and Boiten, E.: Refinement in Z and Object-Z. Springer, 2001.
50. [Dij72] Dijkstra, E.: Notes on structured programming. In Structured Programming, Academic Press, 1972, pp. 1-82.
51. [Dol98] Dold, A.: A formal representation of Abstract State Machines using PVS. Verifix Technical Report Ulm/6.2, Universität Ulm, July 1998.
52. [DGV98] Dold, A., Gaul, T., Vialard, V. and Zimmermann, W.: ASM-based mechanised verification of compiler back-ends. In U. Glässer and P. Schmitt, editors, Proceedings of the Fifth International Workshop on Abstract State Machines, Magdeburg University, 1998, pp. 50-67.
53. [Eil74] Eilenberg, S.: Automata, Machines and Languages Vol. A. Academic Press, 1974.
54. [EGG00] Eschbach, R., Glässer, U., Gotzhein, R. and Prinz, A.: On the formal semantics of SDL-2000: a compilation approach based on an abstract SDL machine. In Y. Gurevich, P. Kutter, M. Odersky and L. Thiele, editors, Abstract State Machines: Theory and Applications, volume 1912 of LNCS, Springer, 2000, pp. 242-265.
55. [FiL98] Fitzgerald, J. and Larsen, P. G.: Modelling Systems. Practical Tool and Techniques in Software Development. Cambridge University Press, 1998.
56. [Gla99] Glässer, U.: Analysis and Validation of Formal Requirement Specifications in Model-Based Engineering of Concurrent Systems. Habilitationsschrift, University of Paderborn, Germany, 1999.
57. [GGP99] Glässer, U., Gotzhein, R. and Prinz, A.: Towards a new formal SDL semantics based on Abstract State Machines. In G. v. Bochmann, R. Dssouli and Y. Lahav, editors, SDL'99: The Next Millennium, Proceedings of the 9th SDL Forum, Elsevier Science, 1999, pp. 171-190.
58. [GoZ00] Goos, G. and Zimmermann, W.: Verifiying compilers and ASMs. In Y. Gurevich, P. Kutter, M. Odersky and L. Thiele, editors, Abstract State Machines: Theory and Applications, volume 1912 of LNCS, Springer, 2000, pp. 177-202.
59. [Gur85] Gurevich, Y.: A new thesis. Abstracts, American Mathematical Society, page 317, August 1985.
60. [Gur95] Gurevich, Y.: Evolving algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, Oxford University Press, 1995, pp. 9-36.
61. [HaM01] Hartel, P. and Moreau, L.: Formalising the safety of Java, the Java Virtual Machine and Java Card. ACM Computing Surveys, 33(4):517-558, 2001.
62. [Heb00] Heberle, A.: Korrekte Transformationsphase: der Kern korrekter Übersetzer. PhD thesis, Universität Karlsruhe, 2000.
63. [HuV98] Huggins, J. and Van Campenhout, D.: Specification and verification of pipelining in the ARM2 RISC microprocessor. ACM Transactions on Design Automation of Electronic Systems, 3(4):563-580, October 1998.
64. [ITU00] ITU-T. SDL formal semantics definition. ITU-T Recommendation Z.100 Annex F, International Telecommunication Union, November 2000.
65. [Jan00] Janneck, J. W.: Syntax and Semantics of Graphs. PhD thesis, ETH Zürich, 2000.
66. [JoM94] Johnson, D. E. and Moss, L. S.: Grammar formalisms viewed as evolving algebras. Linguistics and Philosophy, 17:537-560, 1994.
67. [Mor87] Morris, J. M.: A theoretical basis for stepwise refinement. Science of Computer Programming, 9(3), 1987.
68. [Lav00] Lavagno, L., Sangiovanni-Vincentelli, A. and Sentovitch, E. M.: Models of computation for system design. In E. Börger, editor, Architecture Design and Validation Methods, Springer, 2000, pp. 243-295.
69. [Mor94] Morgan, C.: Programming from Specifications. Prentice-Hall, 1990, 1994.
70. [Mul94a] Müller, B.: Eine objektorientierte Prolog-Erweiterung zur Entwicklung wissensbasierter Systeme. PhD thesis, University of Oldenburg, Germany, 1994.
71. [Mul94b] Müller, B.: A semantics for hybrid object-oriented Prolog systems. In B. Pehrson and I. Simon, editors, IFIP 13th World Computer Congress, volume I: Technology/Foundations. Elsevier, Amsterdam, 1994.
72. [Pri00] Prinz, A.: Formal Semantics for SDL. Definition and Implementation. Habilitationsschrift, Humboldt University, Berlin, 2000.
73. [Ric92] Riccobene, E.: A formal computational model for PANDORA. Technical Report CSTR-92-16 and ACRC-92-15, University of Bristol, Department of Computer Science, 1992.
74. [Ric91] Riccobene, E.: Modelli Matematiciper Linguaggi Logici. PhD thesis, University of Catania, Academic year 1991/92.
75. [Sch01] Schellhorn, G.: Verification of ASM refinements using generalised forward simulation. Journal of Universal Computer Science, 7(11):952-979, 2001.
76. [ScA97] Schellhorn, G. and Ahrendt, W.: Reasoning about Abstract State Machines: the WAM case study. Journal of Universal Computer Science, 3(4):377-413, 1997.
77. [ScA98] Schellhorn, G. and Ahrendt, W.: The WAM case study: verifying compiler correctness for Prolog with KIV. In W. Bibel and P. Schmitt, editors, Automated Deduction: A Basis for Applications. Kluwer, 1998.
78. [Sta93] Standardisation, I.: IEEE standard VHDL language reference manual. Technical Report Std 1076-1993 IEEE. 1993.
79. [SSB01] Stärk, R. F., Schmid, J. and Börger, E.: Java and the Java Virtual Machine: Definition, Verification, Validation. Springer, 2001..
80. [TWF00] Teich, J., Weper, R., Fischer, D. and Trinkert, S.: A joint architecture/compiler design environment for asips. In Proceedings of International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES2000), ACM Press, November 2000, pp. 26-33.
81. [Weg97] Wegner, P.: Why interaction is more powerful than algorithms. Communications of the ACM, 40:80-91, 1997.
82. [Wir71] Wirth, N.: Program development by stepwise refinement. Communications of the ACM, 14(4), 1971.
83. [WoD96] Woodcock, J. C. P. and Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice-Hall, 1996.
84. [ZiG97] Zimmerman, W. and Gaul, T.: On the construction of correct compiler back-ends: An ASM approach. Journal of Universal Computer Science, 3(5):504-567, 1997.
85. [ZiD03] Zimmermann, W. and Dold, A.: A framework for modelling the semantics of expression evaluation with Abstract State Machines. In E. Börger, A. Gargantini and E. Riccobene, editors. Abstract State Machines 2003: Advances in Theory and Applications, volume 2589 of LNCS. Springer, 2003.