A survey of semantic description frameworks for programming languages

ACM SIGPLAN Notices

Volumn 39, Issue 3, 2004, Pages 14-30

  Zhang, Yingzhou ^a   Xu, Baowen ^a,b  

^a SOUTHEAST UNIVERSITY   (China)

^b Jiangsu Institute of Software Quality   (China)

Author keywords

Axiomatic semantics; Denotational semantics; Formal semantics; Hybrid semantics; Operational semantics; Semantic description frameworks

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; CONTEXT SENSITIVE GRAMMARS; OPTIMIZATION; PROGRAM COMPILERS; SOFTWARE ENGINEERING; SYNTACTICS;

AXIOMATIC SEMANTICS; DENOTATIONAL SEMANTICS; FORMAL SEMANTICS; HYBRID SEMANTICS; OPERATIONAL SEMANTICS; SEMANTIC DESCRIPTION FRAMEWORKS;

SEMANTICS;

EID: 2942538078     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/981009.981013     Document Type: Review

References (181)

1. [ABV1994] Aceto, L., Bloom, B. and Vaandrager, F., Tuming SOS rules into equations. Information and Computation, 1994, 111(1): 1-52.
2. [Acz1989] Aczel, P., Algebraic semantics for intensional logics. In: Chierchia, G., Partee, B. and Turner, R. eds. Properties, Types and Meaning, Volume I: Foundational Issues, Dordrecht, 1989. 17-45.
3. [AHM1998] Abramsky, S., Honda, K. and McCusker, G., A fully abstract game semantics for general references. In: 13th Annual IEEE Symposium on Logic in Computer Science, New York: IEEE Computer Society Press, 1998. 334-344.
4. [Ait1986] Aït-Kaci, H., An algebraic semantics approach to the effective resolution of type equations. Theoretical Computer Science, 1986, 45:293-351.
5. [AJM2000] Abramsky, S., Jagadeesan, A.R. and Malacaria, P., Full abstraction for PCF. Information and Computation, 2000, 163(2): 409-470.
6. [ALP1998] Alferes, J.J., Leite, J.A. Pereira, L.M., Przymusinska, H. and Przymusinski, T.C., Dynamic logic programming, In: 6th International Conference on Principles of Knowledge Representation and Reasoning, KR'98, Morgan, 1998. 98-111.
7. [AM1997a] Abramsky, S. and McCusker, G., Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: O'Heam, P.W. and Tennent, R.D. eds. Algol-like Languages, 1997, 2:297-329.
8. [AM1997b] Abramsky, S. and McCusker, G., Call-by-value games. In: Nielsen, M. and Thomas, W. eds. Computer Science Logic: 11th International Workshop on Annual Conference of the EACSL, CSL'97. LNCS 1414, Berlin: Springer-Verlag, 1997. 1-17.
9. [AM1998] Abramsky, S. and McCusker, G., Game semantics. In: Schwichtenberg, H. and Berger, U., eds. Logic and Computation: Proceedings of the 1997 Marktoberdorf Summer School, Berlin: Springer-Verlag, 1998.
10. [AM1999] Abramsky, S. and McCusker, G., Full abstraction for Idealized Algol with passive expressions. Theoretical Computer Science, 1999, 227:3-42.
11. [AR1987] Astesiano, E. and Reggio, G., SMoLCS-driven concurrent calculi. In: Proceedings of International Joint Conference on Theory and Practice of Software Development, TAPSOFT'87. LNCS 249, Berlin: Springer-Verlag, 1987. 169-201.
12. [Att1996] Attali, I., A natural semantics for Eiffel dynamic binding, ACM Transactions on Programming Language and Systems, 1996, 18(6):711-729.
13. [AVV1997] Abiteboul, S., Vardi, M.Y. and Vianu, V., Fixpoint logics, relational machines, and computational complexity. Journal of ACM, 1997, 44(1):30-56.
14. [AW2003] ASM-Webste. 2003. http://www.eecs.umich.edu/gasm/.
15. [BBKL1982] Bodwin, J., Bradley, L., Kanda, K., Litle, D. and Pleban, U.F., Experience with an experimental compiler generator based on denotational semantics. In: Proceeding of the SIGPLAN'82 Symposium on Compiler construction, Boston, 1982. 216-229.
16. [BD1990] Börger, E. and Dässler, K., Prolog: DIN papers for discussion ISO/IEC JTCI SC22 WG17 Proglog Standardization Document 58, Middlesex, England: National Physical Laboratory, 1990.
17. [BD1996] Börger, E. and Durdanovic, I., Correctness of compiling Occam to transputer code. Computer Journal, 1996, 39(1): 52-92.
18. [Bec2001] Beckert, B., A dynamic logic for the formal verification of Jave card programs. In: 1st International Workshop of JavaCard 2000 Cannes. LNCS 2041, Berlin: Springer-Verlag, 2001. 6-25.
19. [BG1994] Borba, P. and Goguen, J.A., An operational semantics for FOOPS. Technical Report PRG-16-94, Programming Research Group, University of Oxford, 1994. http://web.comlab.ox.ac.uk/oucl/publications/tr/tr-16-94.html.
20. [BGM1994] Börger, E., Glässer, U. and Müller, W., The semantics of behavioral VHDL'93 descriptions. In: European Design Automation Conference with EURO-VHDL'94, EURO-DAC'94, New York: IEEE Computer Society Press, 1994. 500-505.
21. [BJ1978] Bjørner, D. and Jones, C.B., The Vinenna Development Method:- the meta-language. LNCS 61, Berlin: Springer-Verlag, 1978.
22. [Bla1992] Blass, A., A game semantics for linear logic. Annals of Pure and Applied Logic. 1992, 56(1-3): 183-220.
23. [Blo1989] Bloom, B., Ready simulation, bisimulation, and the semantics of CCS-like language [Ph.D. thesis]. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1989.
24. [BMW1992] Brown, D.F., Moura, H. and Watt, D.A., Actress: an action semantics directed compiler generator. In: 4th International Conference on Compiler Construction, CC'92. LNCS 641, Berlin: Springer-Verlag, 1992. 95-109.
25. [Bor1990] Börger, E., A logical operational semantics for full Prolog. In: 3rd Workshop on Computer Science Logic, CSL'89. LNCS 440, Berlin: Springer-Verlag, 1990. 36-64.
26. [BR1994] Börger, E. and Rosenzweig, D., The WAM - definition and compiler correctness. In: Logic Programming: Formal Methods and Practical Applications. North-Holland: Computer Science and Art. Int., 1994.
27. [BR1995] Börger, E. and Rosenzweig, D., A mathematical definition of full Prolog. Science of Computer Programming, 1995, 24:249-286.
28. [BS2003] Börger, E. and Stärk, R., Abstract state machine: a method for high-level system design and analysis. Berlin: Springer-Verlag, 2003.
29. [BT1983] Blikle, A. and Tarlecki, A., Naïve denotational semantics. In: Proceedings of IFIP Congress on Information Processing, North-Holland, 1983.
30. [Bun1996] Bundgaard, J., An ANDF based Ada 95 compiler system. In: Toussaint, M. ed. 2nd International Ada- Europe Symposium on Reliable Software Technologies,. LNCS 1031, Berlin: Springer-Verlag, 1996. 81-91.
31. [BW1982] Broy, M. and Wirsing, M., Algebraic definition of a functional programming language. IEEE Transactions on Information Theory, 1982, 17(2):137-161.
32. [BWP1987] Broy, M., Wirsing, M. and Pepper, P., On the algebraic definition of programming languages. ACM Transactions on Programming Languages and Systems, 1987, 9(1):54-99.
33. [Byu2003] Byun, S., Introduction to linear logic and game semantics. Lecture Notes, University of Kyungsung, 2003. http:/licomr.org/2003_1/.
34. [BZ1992] Bakker, J.W., and Zucker, J.I., Denotational semantics of concurrency. In: Proceeding of the 14th Annual ACM Symposium on Theory of Computing, San Francisco, 1982. 153-158.
35. [CF1994] Cartwright, R. and Felleisen, M., Extensible denotational semantics specifications. In: Proceedings of Symposium on Theoretical Aspects of Computer Software, TACS'94. LNCS 789, Berlin: Springer-Verlag, 1994. 244-272.
36. [Chr2000] Chroboczek, J., Game semantics and subtyping. In: 15th Annual IEEE Symposium on Logic in Computer Science, New York: IEEE Computer Society Press, 2000. 192-204.
37. [CHT2002] Calcagno, C., Helsen, S. and Thiemann, P., Syntactic type soundness results for me region calculus. Information and Computation, 173 (2): 199-221.
38. [CJO1994] Clerici, S., Jimenez, R. and Orejas, F., Semantic constructions in the specification language Glider. In: Ehrich, H.D. and Orejas, F. eds. Recent Trends in Data Type Specification. LNCS 785, Berlin: Springer-Verlag, 1994. 144-157.
39. [Cle2003] Clem, B., Principles of programming languages: the semantics of programming languages. Lecture Notes: COMP3610, Department of Computer Science, Australian National University, 2003. http://cs.anu.edu.au/Student/comp3610/.
40. [CLR1996] Carles, S., Lluis, G., Ramon, L.M. and Mara, M., Descriptive dynamic logic and its application to reflective architectures. Future Generation Computer Systems, 1996, 12(2-3): 157-171.
41. [CP1994] Cook, W. and Palsberg, J., A denotational semantics of inheritance and its correctness. Information and Computation, 1994, 114(2): 329-350.
42. [Dav1999] David von O., Hoare logic for mutual recursion and local variables. In: Rangan, C.P., Raman, V. and Ramanujam, R. eds. 19th Conference on Formal Software Theory and Theoretical Computer Science, FST&TCS'99. LNCS 1738, Berlin: Springer-Verlag, 1999. 168-480.
43. [DDR1997] Dong, J.S., Duke, R. and Rose, G., An object-oriented denotational semantics of a small programming language. Object-Oriented Systems journal, 1997, 4(1): 29-52.
44. [DE1999] Drossopoulou, S. and Eisenbach, S., Describing the semantics of Java and proving type soundness. In: Foss, A. ed. Formal Syntax and Semantics of Java. LNCS 1523, Berlin: Springer-Verlag, 1999. 41-82.
45. [Dij1975] Dijkstra, E.W., Guarded commands, non-determinacy, and formal derivations of programs. Communications of ACM, 1975, 18: 453-457.
46. [DM1996] Deursen, A. and Mosses, P.D., ASD: The action semantic description tools. In: Proceeding of 5th International Conference on Algebraic Methodology and Software Technology, AMAST'96. LNCS 1101, Berlin: Springer-Verlag, 1996. 579-582.
47. [DM2003] Doh, K. and Mosses, P.D., Composing programming languages by combining action semantics modules. Science of Computer Programming, 2003, 47(1): 3-36.
48. [DP1996] Degano, P. and Priami, C., Enhanced operational semantics. ACM Computing Survey, 1996, 28 (2): 352-354.
49. [DP2001] Degano, P. and Priami, C., Enhanced operational semantics: a tool for describing and analyzing concurrent systems. ACM Computing Survey, 2001, 33 (2): 135-176.
50. [DS1990] Dijkstra, E.W. and Scholten, C.S., Predicate calculus and program semantics. New York: Springer Press, 1990.
51. [EJ1996] van Eijck. J. and Jaspars, J., Ambiguity and reasoning. Technical Report CS-9616, Nertherlands: Centrum voor Wiskunde en Informatica (CWI), 1996. http://ftp.cwi.nl/CWIreports/INDEX.
52. [Esp1993] Espinosa, D.A., Modular Denotational semantics. Unpublished manuscript, 1993.
53. [Esp1995] Espinosa, D.A., Semantic Lego [Ph.D. thesis]. Graduate School of Arts and Sciences, Columbia University, 1995.
54. [FF1986] Fellesisen, M. and Friedman, D.P., Control operators, the SECD machine, and the λ -calculus. In: Proceedings of MP TC2 Working Conference, Formal Description of Programming Concepts III, North-Holland, 1986. 193-217.
55. [Fit1985a] Fitting, M., A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 1985, 2(4): 295-312.
56. [Fit1985b] Fitting, M., A deterministic Prolog fixpoint semantics. Journal of Logic Programming, 1985, 2(2): 111-118.
57. [Fit2002] Fitting, M., Fixpoint semantics for logic programming a survey. Theoretical Computer Science, 2002, 278(1-2):25-51.
58. [FM2001] Fikes, R. and McGuinness, D.L., An axiomatic semantics for RDF, RDF-Schema, and DAML+OIL. Technical Report KSL-01-01, University of Stanford, 2001. http://www.ksl.stanford.edu/people/dlm/daml-semantics/.
59. [Fro2003] Fronk, A., An approach to algebraic semantics of object-oriented languages. In: 7th Brazilian Symposium on Programming language, 2003. 195-209.
60. [GD1992] Goguen, J.A. and Diaconescu, R., Towards an algebraic semantics for the object paradigm. In: Ehrig, H. and Orejas, F. eds. Recent Trends in Data Type Specification. LNCS 785, Berlin: Springer-Verlag, 1992. 1-59.
61. [GGP1999] Glässer, U., Gotzhein, R. and Prinz, A., Towards a new formal SDL semantics based on abstract slate machines. In: von Bochmann, G., Dssouli, R. and Lahav, Y. eds. Proceeding of the 9th SDL Forum, SDL'99, Elsevier Science B.V., 1999. 171-190.
62. [GH1993] Gurevich, Y. and Huggins, J.K., The semantics of the C programming language. In: Selected papers from CSL'92 (Computer Science Logic). LNCS 702, Berlin: Springer-Verlag, 1993. 274-308.
63. [GH1995] Gogolla, M. and Herzig, R., An algebraic semantics for the object specification language TROLL light. In: Astesiano, E., Reggio, G. and Tarlecki, A. eds. Recent Trends in Date Type Specification. LNCS 906, Berlin: Springer-Verlag, 1995. 290-306.
64. [GK1997] Glässer, U. and Karges, R., Abstract state machine semantics of SDL. Journal of Universal Computer Science, 1997, 3(12): 1382-1414.
65. [Gle1999] Glesner, S., Natural semantics for imperative and obj ect-oriented programming language. GI Jahrestagung, 1999. 370-379.
66. [Gle2003] Glesner, S., ASMs versus natural semantics: a comparison with new insights. Abstract State Machines Advances in Theory and Apllications, ASM 2003, Berlin: Springer-Verlag, 2003. 293-308.
67. [GM1988] Gurevich, Y. and Moss, L.S., Algebraic operational semantics and Modula-2. 1st Workshop on Computer Science Logic, CSL'87. LNCS 329, Berlin: Springer-Verlag, 1988. 81-101.
68. [GM1990] Gurevich, Y. and Moss, L.S., Algebraic operational semantics and Occam. In: 3rd Workshop on Computer Science Logic, CSL'89. LNCS 440, Berlin: Springer-Verlag, 1990. 176-192.
69. [GM1996] Goguen, J.A. and Malcolm, G., Algebraic semantics of imperative programs. USA: MTT Press, 1996.
70. [Gog1990] Goguen, J., A algebraic approach to refinement. In: Bjorner, D., Hoare, C.A.R. and Langmaack, H. eds. Proceedings of VDM and Z: Formal Methods in Software Development, VDM'90. LNCS 428, Berlin: Springer-Verlag, 1990. 12-28.
71. [GP1981] Goguen, J.A. and Parsaye, K.G., Algebraic denotational semantics using parameterized abstract modules. In: Diaz, J. and Ramos, I. Eds. Proceedings of International Colloquium on Formalization of Programming Concepts. LNCS 107, Berlin: Springer-Verlag, 1981. 292-309.
72. [GRS1991] Gelder A.V., Ross, K.A. and Schlipf, J.S., The well-founded semantics for general logic programs. Journal of ACM, 1991, 38:620-650.
73. [GTWW1977] Goguen, J.A., Thatcher, J.W., Wagner, E.G., and Wright, J.B. Initial algebra semantics and continuous algebras. Journal of the ACM, 1977, 24:68-95.
74. [Gue1981] Guessarian, I., Algebraic semantics. LNCS 99, Berlin: Springer Press, 1981.
75. [Gur1987] Gurevich, Y., Algebraic operational semantics. In: Nori, K.V. ed. Foundations of Software Technology and Theoretical Computer Science, FSTTCS'87. LNCS 287, Berlin: Springer-Verlag, 1987.
76. [Gur1993] Gurevich, Y., Evolving algebras 1993: Lipari guide. In: Börger, E., ed. Specification and Validation Methods. USA: Oxford University Press, 1995. 9-36.
77. [GZ1998] Glesner, S. and Zimmermann, W., Using many-sorted natural semantics to specify and generate semantics analysis. In: Proceeding of Systems Implementation Conference, IFIP WG 2.4, Chapman & Hall, 1998.
78. [GZ1999] Goos, G. and Zimmermann, W., Verification of Compilers. In: Correct System Design. LNCS 1710, Berlin: Springer-Verlag, 1999. 201-230.
79. [Har1984] Harel, D., Dynamic logic. In: Gabbay, D. and Guenther, F. eds. Handbook of Philosophical Logic Volume II Extensions of Classical Logic. Netherlands: Reidel Publishing Company, 1984. 497-604.
80. [Hen1990] Hennessy, M., The semantics of programming languages: an elementary introduction using structural operational semantics. New York: John Wiley & Sons, 1990.
81. [HJ2000] Huisman, M. and Jacobs, B., Java program verification via a Hoare logic with abrupt termination. In: Maibaum, T. ed. 3rd International Conference on Fundamental Approaches to Software Engineering, FASE'00, LNCS 1783. Springer-Verlag, 2000. 284-303.
82. [HKT2000] Harel, D., Kozen, D. and Tiuryn, J., Dynamic logic. USA: The MTT Press, 2000.
83. [HL1994] Harper, R. and Lillibridge, M., A type-theoretic approach to higer-order modules with sharing. In: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'94, Portland, 1994. 123-137.
84. [HM1999] Harmer, R. and McCusker, G., A fully abstract game semantics for finite nondeterminism. In: 14th Annual IEEE Symposium on Logic in Computer Science, New York: IEEE Computer Society Press, 1999. 422-430.
85. [HO2000] Hyland, M. and Ong, L., On full abstraction for PCF: I, II and III. Information and Computation, 2000, 163(2): 285-408.
86. [Hoa1969] Hoare, C.A.R., An axiomatic basis for computer programming. Communications of the ACM, 1969, 12(10):576-583.
87. [HS1998] Harper, R. and Stone, C., A type-theoretic interpretation of Standard ML. In: Plotkin, G., Stirling, C. and Tofte, M. eds. Proof, Language and Interaction: Essays in Honour of Robin Milner. USA: MIT Press, 1998.
88. [HT1994] Hansen, B.S. and Toft, T.U., The formal specification of ANDF, An application of action semantics. In: Mosses, P.D. ed. 1st International Workshop on Action Semantics, Edinburgh: University of Aarhus, 1994. 34-42.
89. [HW1973] Hoare, C.A.R. and Wirth, N., An axiomatic definition of the programming language Pascal. Acta Informatica, 1973, 2:335-355.
90. [ILL1975] Igarashi, S., London, R.L. and Luckham, D.C., Automatic program verification I: a logic basis and its implementation. Acta Information, 1975, 4:145-182.
91. [ITU2000] ITU-T., SDL formal semantics definition. ITU-T Recommendation Z.100 Annex F., International Telecommunication Union, 2000.
92. [JMK1998] Joxan, J., Michael, M., Kim, M. and Peter, S., The semantics of constraint logic programs. The Journal of Logic Programming, 1998, 37(1-3): 1-46.
93. [Kem1982] Kemmerer, R.A., Formal verification of an operating system security kernel. Michigan: UMI Research Press, 1982.
94. [KLNS2002] Klein, G., Loetzbeyer, H., Nipkow, T. and Sandner, R., A WHILE-language and its semantics, Technical Report, 2002. http://isabelle.in. tum.de/PSV2000/library/HOL/IMP/README.html
95. [KOC1991] Kurtz, B.L., Oliver, R.L. and Collins, M., The design, implementation, and use of DSTutor: a tutoring system for denotational semantics. ACM SIGCSE Bulletin, 1991,23(1): 169-177.
96. [Lab1998] Labra, J., An implementation of modular monadic semantics using folds and monadic folds. In: 3rd International Summer School on Advanced Functional Programming, Portugal, 1998.
97. [Lai1997] Laird, J., Full abstraction for functional languages with control. In: 12th Annual IEEE Symposium on Logic in Computer Science, New York: IEEE Computer Society Press, 1997. 58-67.
98. [Lan1964] Landin, P.J., The mechanical evaluation of expressions. Computer Journal, 1964, 6(4):308-320.
99. [Lan1966] Landin, P.J., A formal description of Algol60. In: Proceedings of IFIP TC2 Working Conference, Formal Language Description Languages for Computer Programming, North-Holland, 1966. 266-294.
100. [Lau1968] Lauer, L., Formal definition of Algol 60, Technical Report TR. 25.088, IBM Lab. Vienna, 1968.
101. [LCLC2001] Labra Gayo, J.E., Cueva Lovelle, J.M., Luengo Diez, M.C. and Cemuda del Rio, A., Reusable monadic semantics of logic programs with arithmetic predicates. In: Proceedings 2001 APPIA-GULP-PRODE Joint Conference on Declarative Programming, AGP'01, Portugal: University of Evora Publisher, 2001. 31-45.
102. [LCLC2002] Labra Gayo, J.E., Cueva Lovelle, J.M., Luengo Diez, M.C. and Cemuda del Rio, A., Reusable monadic semantics of object oriented programming languages. In: 6th Brazilian Symposium on Programming Languages, SBLP'02, Brazil: PUC-Rio University, 2002.
103. [LH1996] Liang, L. and Hudak, P., Modular denotational semantics for compiler construction. In: 6th European Synposium on Programming Languages and Systems, ESOP'96. LNCS 1058, Berlin: Springer-Verlag, 1996. 219-234.
104. [LHJ1995] Liang, S., Hudak, P. and Jones, M., Monad transformers and modular interpreters. In: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'95, New York: ACM Press, 1995. 333-343.
105. [Lia1998] Liang, S., Modular monadic semantics and compilation [Ph.D. thesis]. Yale: University of Yale, 1998.
106. [LLCC2001] Labra Gayo, J.E., Luengo Diez, M.C., Cueva Lovelle, J.M. and Cemuda del Rio, A., A language prototyping system using modular monadic semantics. In: Workshop on Language Definitions, Tools and Applications, LDTA'01. ENTCS 44, Netherlands: Elesvier, 2001.
107. [LP1995] Larsen, P.G. and Pawlowski, W., The formal semantics of ISO VDM-SL. Computer Standards and Interfaces, 1995, 17(5-6): 585-602.
108. [LS2002] Loetzbeyer, H. and Sandner, R., A WHILE-language and two Semantics, Technical Report, 2002. http://wwwbroy.informatik.tu-mucnchen.de/ ~isabelle/library/ZF/IMP/README.html.
109. [LW1995] Li, Z. and Wang, B., On denotational semantics of Smalltalk-80. Chinese Science Abstracts Series Part A, 1995, A14(5): 50-50.
110. [MA1986] Manes, E.G. and Arbib, M.A., Algebraic Approaches to Program Semantics. Berlin: Springer Press, 1986.
111. [McC1996] McCusker, G., Games and full abstraction FPC. In: 11th Annual IEEE Symposium on Logic in Computer Science, LICS'96, New York: IEEE Computer Society Press, 1996. 174-183.
112. [MH1998] Malacaria, P. and Hankin, C., A new approach to control flow analysis. In: 7th International Conference on Compiler Construction, CC'98, Lisbon, 1998. 95-108.
113. [MH1999] Malacaria, P. and Hankin, C., Non-deterministic games and program analysis: an application to security. In: 14th Annual IEEE Symposium on Logic in Computer Science, New York: IEEE Computer Society Press, 1999. 443-452.
114. [Mit1996] Mitchell, J.C., Foundations for programming languages. USA: MIT Press, 1996.
115. [MM2003] Maarten, M. and Michael, M., Regular equivalence and dynamic logic. Social Networks, 2003, 25(1):51-65.
116. [Mog1989] Moggi, E., An abstract view of programming languages. LFCS Report, ECS-LFCS-90-113, University of Edinburgh, 1989. http://www.lfcs. informatics.ed.ac.uk/reports/90/ECS-LFCS-90-113/.
117. [Mog1991] Moggi, E., Notions of computation and monads. Information and Computation, 1991, 93:55-92.
118. [Mos1986] Mosses, P.D., Action semantics. In: 4th Workshop on Abstract Data Type, ADT'86, University of Braunschweig, 1986.
119. [Mos1989] Mosses, P.D., Unified algebras and action semantics, In: 6th Annual Symposium on Theoretical Aspects of Computer Science, STACS'89, 1989. 17-35.
120. [Mos1992a] Mosses, P.D., Action semantics. Cambridge, UK:Cambridge University Press, 1992.
121. [Mos1992b] Mosses, P.D., On the action semantics of concurrent programming languages. In: Semantics: Foundations and Applications, Proceeding of REX Workshop. LNCS 666, Berlin: Springer-Verlag, 1992. 398-424.
122. [Mos1996a] Mosses, P.D., Theory and practice of action semantics. In: Penczek, W., Szalas, A. and Wierzbicki, T. eds. 21th International Symposium on Mathematical Foundations of Computer Science, MFCS'96. LNCS 1113, Berlin: Springer-Verlag, 1996. 37-61.
123. [Mos1996b] Mosses, P.D., A tutorial on action semantics. Tutorial notes for FME'96: Formal Methods Europe, Oxford, 1996.
124. [Mos1998] Mosses, P.D., Semantics, modularity, and rewriting logic. In: Kirchner, C. and Kirchner, H., eds. 2nd International Workshop on Rewriting Logic and its Applications, ENTCS 15. Netherlands: Elesvier, 1998.
125. [Mos1999] Mosses, P.D., Foundations of modular SOS (extended abstract). In: Kutylowski, M., Pacholski, L. and Wierzbicki, T. eds. 24th International Symposium on Mathematical Foundations of Computer Science, MFCS'99. LNCS 1672, Berlin: Springer-Verlag, 1999. 70-80.
126. [Mos2001a] Mosses, P.D., What use is formal semantics. PSI Report, Perspective of System Informatics 2001, Russia, 2001. http://www.iis.nsk.su/ psi01/reports/mosses_e.shtml.
127. [Mos2001b] Mosses, P.D., The varieties of programming language semantics and their uses. In: Bjørner, D., Broy, M. and Zamulin, A.V, eds. 4th International Andrei Ershov Memorial Conference on Perspective of System Informatics, PST'01, LNCS 2244. Berlin: Springer-Verlag, 2001. 165-190.
128. [Mos200lc] Mosses, P.D., Action semantics and compiler generation. Course Lecture, Department of Computer Science, University of Aarhus, 2001. http://wiki.daimi.au.dk:8000/ascg-01/.
129. [Mos2002a] Mosses, P.D., Fundamental concepts and formal semantics of programming language. Lecture Notes, BRICS & Department of Computer Science, University of Aarhus, 2002. http://wiki.daimi.au.dk:8000/dSprogSem-02/.
130. [Mos2002b] Mosses, P.D., Pragmatics of Modular SOS. In: Kirchner, H. and Ringeissen, C. eds. 9th International Conference on Algebraic Methodology and Software Technology, AMAST'02. LNCS 2422, Berlin: Springer-Verlag, 2002. 21-40.
131. [Mou1993] Moura, H.P., Action notation transformations [Ph.D. thesis]. Department of Computer Science, University of Glasgow, 1993.
132. [MTH1990] Milner, R., Tofte, M. and Harper, R., The definition of standard ML. USA: MTT Press, 1990.
133. [MTHM1997] Milner, R., Tofte, M., Harper, R. and MacQueen, D., The Definition of standard ML (revised). USA: MIT Press, 1997.
134. [MW1987], Mosses, P.D. and Watt, D.A., The use of action semantics. In: Formal Description of Programming Concepts III, Proceedings of IFIP TC2 Working Conference, North-Holland, 1987. 135-166.
135. [MW1993] Mosses, P.D. and Watt, D.A., Pascal action semantics. Technical Report 17.08, University of Aarhus, 1993. http://www.brics.dk/Projects/AS/ action-semantics/93/.
136. [Nau2001] Naumann, D.A., Predicate transformer semantics of a higher-order imperative language with record subtyping. Science of Computer Programming, 2001, 41(1): 1-51.
137. [Nic1994] Nickau, H., Hereditarily sequential functionals. In: Proceedings of the Symposium on Logical Foundations of Computer Science, LFCS'94, Berlin: Springer, 1994. 240-252.
138. [NN1992] Nielson, H.R. and Nielson, F., Semantics with applications: a formal introduction. Wiley Professional Computing Series, Chichester, England: John Wiley & Sons, 1992.
139. [ON1999] von Oheimb, D. and Nipkow, T., Machine-cheking and Jave specification: proving type-safety. In: Alves-Foss, J. ed. Formal Syntax and Semantics of Java. LNCS 1523, Berlin: Springer-Verlag, 1999.
140. [Ørb1994] Ørbæk, P., OASIS: an optimizing action-based compiler generator. In: 5th International Conference on Compiler Construction, CC'94. LNCS 786, Berlin: Springer-Verlag, 1994. 1-15.
141. [Pal1992a] Palsberg, J., An automatically generated and provably correct compiler for a subset of ada. In: 4th IEEE International Conference on Computer Languages, ICCL'92, New York: IEEE Press, 1992. 117-126.
142. [Pal1992b] Palsberg, J., A provably correct compiler generator. In: Proceedings of European Symposium on Programming, ESOP'92. LNCS 582, Berlin: Springer-Verlag, 1992. 418-434.
143. [PDG1986] PL/I Definition Group. Formal definition of PL/I version 1, Report TR 25.071, American: Nat Standards Institute, 1986.
144. [Plo1981] Plotkin, G.D., A structural approach to operational semantics. Technical Report, DAIMI FN-19, Department of Computer Science, University of Aarhus, 1981.
145. [Plo1983] Plotkin, G.D., An operational semantics for CSP. In: Bjørner, D. ed. Proceeding IFIP TC2 Working Conference on Formal Description of Programming Concepts- II, North-Holland, 1983. 199-225.
146. [Pol1981] Polak, W., Program verification based on denotation semantics. In: Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, Williamsburg, 1981. 149-158.
147. [Pow2000] Power, J., Modularity in denotational semantics. In: 13th Annual Conference on Mathematical Foundations of Programming Semantics, MFPS XIII (6), New York: Elsevier Press, 2000.
148. [PS1995] Palsberg, J. and Schwartzbach, M.I., Safety analysis versus type inference. Information and Computation, 1995, 118(1): 128-141.
149. [Rep1991] Reppy, J., CML: a higher-order concurrent language. In: Programming Language Design and Implementation, ACM SIGPLAN, 1991. 293-259.
150. [Rin1997] Ringström, J., Compiler generation for data-parallel programming languages from two-level semantics specifications [Ph.D. Thesis]. Sweden: University of Linköping, 1997.
151. [Ru1992] Ru-zhan, L., Formal semantics of programming languages. Beijing: Science Press, 1992 (in Chinese).
152. [Sch1986] Schmidt, D.A., Denotational semantics: a methodology for language development. Boston, Massachusetts: Allyn and Bacon, 1986.
153. [Sch1995] Schellekens, M., The Smyth completion: a common foundation for denotational semantics and complexity analysis. In: Proceeding of Electronic Notes in Theoretical Computer Science, MFPS 11, 1995, 1: 211-232.
154. [SK1995] Slonneger, K. and Kurtz, B., Formal syntax and semantics of programming languages: a laboratory based approach. Iowa, USA: Addison & Wesley, 1995.
155. [Sou1984] Soundararajan, N., Axiomatic semantics of Communicating sequential processes. ACM Transaction on Programming Language and System, 1984, 6(4): 647-662.
156. [SSB2001] Stärk, R., Schmid, J., and Börger, E., Java and the Java virtual machine: definition, verification, validation. Berlin: Springer-Verlag, 2001.
157. [Ste1996] Stephenson, K., An algebraic approach to syntax, semantics and compilation [Ph.D. thesis]. Department of Computer Science, University of Wales Swansea, 1996.
158. [Ste1997] Stephenson, K., Compiler correctness using algebraic operational semantics. Technical Report CSR 1-97, University of Wales Swansea, 1997. http://www-compsci.swan.ac.uk/reports/yr1997/CSR1-97.pdf.
159. [Sto1977] Stoy, J., Denotational semantics: the Scott-Strachey approach to programming language theory. USA: MIT Press, 1977.
160. [Sym1999] Syme, D., Proving Java type soundness. In: Foss, A. ed. Formal Syntax and Semantics of Java. LNCS 1523, Berlin: Springer-Verlag, 1999. 83-118.
161. [Ten1976] Tennent, R.D., The denotational semantics of programming languages. Communications of the ACM, 1976, 19 (8): 437-453.
162. [Tof1993] Toft, J.U., Feasibility of using RSL as the specification language for the ANDF formal specification. Technical Report 202104-RPT-12, Denmark, 1993.
163. [TZ1988] Tucker, J.V. and Zucker, J.I., Program correctness over abstract data types, with error-state semantics. New York: Elsevier Science Inc., 1988.
164. [UP2002] Ulidowski, L. and Phillips, L., Ordered SOS process languages for branching and eager bisimulations. Information and Computation, 2002, 178 (1): 180-213.
165. [Var1982] Vardi, M.Y., The complexity of relational query languages. In: 14th ACM Symposium on Theory of Computing, 1982. 137-146.
166. [vON1999] von Oheimb, D. and Nipkov, T., Machine-checking the Java specification: proving type-safety. In: Foss, A. ed. Formal Syntax and Semantics of Java. LNCS 1523, Berlin: Springer-Verlag, 1999. 83-118.
167. [Wad1990] Wadler, P.L., Comprehending monads. In: proceedings of the 1990 ACM Conference on Lisp and Functional Programming. New York: ACM Press, 1990. 61-78.
168. [Wan1997] Wansbrough, K., A modular monadic action semantics [MS Thesis]. Department of Computer Science, University of Auckland, 1997.
169. [Wat1986] Watt, D.A., Executable semantic descriptions. Software: Practice and Experience, 1986, 16: 13-43.
170. [Wat1988] Watt, D.A., An action semantics of Standard ML. In: Proceeding of 3rd Workshop on Mathematics Foundations of Programming Language Semantics. LNCS 298, Berlin: Springer-Verlag, 1988. 572-598.
171. [Wat1999] Watt, D.A., JAS: a Java action semantics. In: Mosses, P.D. and Watt, D.A. eds. 2nd International Workshop on Action Semantics, University of Aarhus, Denmark: BRICS NS, 1999,3:43-56.
172. [WBB1993] Weber, S., Bloom, B. and Brown, G., Compiling Joy into silicon: an exercise in applied structural operational semantics. In: Bakker, J., Roever, W. and Rozenberg, G. eds. Proceedings REX Workshop on Semantics: Foundations and Applications. LNCS 666, Berlin: Springer-Verlag, 1993. 639-659.
173. [Weg1972] Wegner, P., The Vienna definition language. ACM Computer Survey, 1972, 4(1): 5-63.
174. [WF1994] Wright, A. and Felleisen, M., A syntactic approach to type soundness. Information and Computation, 1994, 115 (1): 38-94.
175. [WH1997] Wansbrough, K. and Hamer, J., A modular monadic action semantics. In: Proceeding of the Conference on Domain-Specific Language, Santa Barbara, California: The USENIX Association, 1997. 157-170.
176. [Wil1982] Williams, J.H., On the development of the algebra of funtcional programs. ACM Transactions on Programming Languages and Systems, 1982, 4(4):733-757.
177. [Yeu1997] Yeung, W.L., Denotational semantics for JSD. In: 4th Asia-Pacific Software Engineering and International Computer Science Conference, APSEC'97, Hong Kong, 1997. 72-82.
178. [YR1998] Yan-bing, W. and Ru-zhan, L., Semantics of program base on trace part I: trace and semantics objects. Journal of Software, 1998, 9 (5): 366-370 (in Chinese).
179. [YZJ1995] Yuzhong, Q., Zhijian, W. and Jiafu, X., Denotational Semanitcs of a simple model Eiffel. Journal of Computer Science of Technology, 1995, 10(3): 214-226.
180. [Zam1997] Zamulin, A.V., Algebraic semantics of object-oriented data models. In: Technology of Object-oriented languages and System-Tools-24, Beijing, 1997. 43-53.
181. [ZG1997] Zimmermann, W. and Gaul, T., On the construction of correct compiler backends: an ASM approach. Journal of Universal Computer Science, 1997, 3(5): 504-567.