An introduction to operational semantics

The Compiler Design Handbook: Optimizations and Machine Code Generation

Volumn , Issue , 2002, Pages 841-889

  Prasad, Sanjiva ^a   Arun Kumar, S ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 81455150506     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420040579     Document Type: Chapter

References (77)

1. R.M. Amadio and P.-L. Curien, Domains and Lambda-Calculi, Cambridge University Press, London, 1998.
2. L. Aceto, W. Fokkink and C. Verhoef, Structural operational semantics, in Handbook of Process Algebra, J.A. Bergstra, A. Ponse and S.A. Smolka, Eds., Elsevier, Amsterdam, 2000.
3. E. Astesiano, C. Bendix Nielsen, N. Botta, A. Fantechi, A. Giovini, P. Inverardi, E. Karlsen, F. Mazzanti, G. Reggio and E. Zucca, The Trial Definition of Ada, Deliverable 7 of the CEC MAP Project: The Draft Formal Definition of ANSI/MIL-STD 1815 Ada, CEC MAP, 1986.
4. A.W. Appel, Compiling with Continuations, Cambridge University Press, London, 1992.
5. E. Astesiano, Inductive and Operational Semantics, in Formal Description of Programming Concepts, Springer-Verlag, 1991, pp. 53-134.
6. H.P. Barendregt, The Lambda Calculus, Its Syntax and Semantics, Vol. 103, Studies in Logic and the Foundation of Mathematics, North-Holland, Amsterdam, 1984.
7. G. Berry and L. Cosserat, The Esterel synchronous programming language and its mathematical semantics, in S.D. Brookes, A.W. Roscoe and G.Winskel, Eds., Seminar on Concurrency, Lecture Notes in Computer Science, Vol. 197, Springer-Verlag, New York, 1984, pp. 389-448.
8. G. Berry and G. Gonthier, The ESTEREL synchronous programming language: design, semantics, implementation, Sci. Comput. Programming, 19(2), pp. 87-152, 1992.
9. R. Burstall and F. Honsell, A natural deduction treatment of operational semantics, in Proceedings of FST & TCS 8, Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 287, Springer-Verlag, New York, 1987.
10. R. Bornat, Proving pointer programs in Hoare Logic, in Mathematics of Program Construction, 2000, pp. 102-126.
11. E. Borger and P.H. Schmitt, A formal operational semantics for languages of type prolog III, in CSL, 1990, pp. 67-79.
12. L. Cardelli, Compiling a Functional Language, in Proceedings of 1984 Symposium on LISP and Functional Programming, 1984, pp. 208-217.
13. L. Cardelli, Amber, in Combinators and Functional Programming Language, G. Cousineau, P-L. Curien and B. Robinet, Eds., Lecture Notes in Computer Science, Vol. 242, Springer-Verlag, New York, 1986.
14. L. Cardelli, The amber machine, in Combinators and Functional Programming Languages, G. Cousineau, P.-L. Curien and B. Robinet, Eds., Lecture Notes in Computer Science, Vol. 242, Springer-Verlag, New York, 1986.
15. G. Cousineau, P. Curien, and M. Mauny, The Categorical Abstract Machine, Functional Programming Languages and Computer Architecture, In J.-P. Jouannaud, Ed., Lecture Notes in Computer Science, Vol. 201, Springer-Verlag, New York, 1985, pp. 50-64.
16. C. Calcagno, S. Ishtiaq and P.W. O’Hearn, Semantic Analysis of Pointer Aliasing, Allocation and Disposal in Hoare Logic, in Proceedings 2nd International Conference on Principles and Practice of Declarative Programming, Maurizio Gabbrielli and Frank Pfenning, Eds., ACMPress, New York, 2000.
17. P. Cenciarelli, A. Knapp, B. Reus and M.Wirsing, An Event-Based Structural Operational Semantics of Multi-Threaded Java, in Formal Syntax and Semantics of Java, 1999, pp. 157-200.
18. R. Cleaveland, E. Madelaine and S. Sims, A front-end generator for verification tools, in Tools and Algorithms for the Construction and Analysis of Systems, E. Brinksma, R. Cleaveland, K.G. Larsen and B. Steffen, Eds., Lecture Notes in Computer Science, Vol. 1019, Springer-Verlag, New York, 1995, pp. 153-173.
19. P.-L. Curien, An abstract framework for environment machines, Theor. Comput. Sci., 82(2), 389-402, 1991.
20. F.Q.B. da Silva, Correctness Proofs of Compilers and Debuggers: An Approach Based on Structural Operational Semantics, Ph.D. thesis, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, Edinburgh, EH9 3JZ, Scotland, September 1992; available as LFCS Report Series ECS-LFCS-92-241 or CST-95-92.
21. M. Felleisen, D. Friedman, E. Kohlbecker and B. Duba, A syntactic theory of sequential control, Theor. Comput. Sci., 52(3), 205-237, 1987.
22. A. Giacalone, P. Mishra and S. Prasad, Facile: A symmetric integration of concurrent and functional programming, Int. J. Parallel Programming, 18(2), 121-160, 1989.
23. G. Gonthier, Sémantiques et Modèles d’Exécution des Langages Réactifs Synchrone; Application à Esterel, Thèse d’informatique, Université d’Orsay, 1988.
24. T.G. Griffin, The formulae-as-types notion of control, in Conference Record 17th Annual ACM Symposium on Principles of Programming Languages, POPL '90, San Francisco, CA, January 17-19, 1990, ACM Press, New York, 1990, pp. 47-57.
25. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, Foundations of Computing, MIT Press, Cambridge, MA, 1992.
26. Y. Gurevich, Evolving algebras: an attempt to discover semantics, in Current Trends in Theoretical Computer Science, G. Rozenberg and A. Salomaa, Eds., World Scientific, 1993, pp. 266-292.
27. J. Hannan, Making abstract machines less abstract, in Functional Programming Languages and Computer Architecture, 5th ACM Conference, J. Hughes, Ed., Lecture Notes in Computer Science, Vol. 523, Springer-Verlag, Heidelberg, 1991, pp. 618-635.
28. J. Hannan, Operational semantics-directed compilers and machine architectures, ACM Trans. Programming Languages Syst., 16(4), 1215-1247, 1994.
29. P. Henderson, Functional Programming: Application and Implementation, Prentice Hall International, Englewood Cliffs, NJ, 1980.
30. M. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, MA, 1988.
31. S. Haridi, S. Janson and C. Palamidessi, Structural operational semantics of AKL, Future Generation Comput. Syst., 1992.
32. C.A.R. Hoare and P.E. Lauer, Consistent and complementary formal theories of the semantics of programming languages, Acta Inf., 3, 135-153, 1974.
33. C.A.R. Hoare, An axiomatic basis for computer programming, Commun. ACM, 12(10), 1969.
34. C.A.R. Hoare, Communicating sequential processes, Commun. ACM, 21(8), 666-677, 1978.
35. C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall International, Englewood Cliffs, NJ, 1985.
36. J. Hannan and F. Pfenning, Compiler verification in Seventh Annual IEEE Symposium on Logic in Computer Science, IEEE, 1992, pp. 407-418.
37. S.L.P. Jones, The Implementation of Functional Programming Languages, Prentice Hall International, London, 1987.
38. G. Kahn, Natural semantics, in Proceedings of STACS '87, F.J. Brandenburg, G. Vidal-Naquet and M.Wirsing, Eds., Lecture Notes in Computer Science, Vol. 247, Springer-Verlag, Heidelberg, 1987, pp. 22-39.
39. R.Kennaway and R. Sleep, Director strings as combinators, ACMTrans. Programming Languages Syst., 10(4), pp. 602-626, 1988.
40. P.J. Landin, The mechanical evaluation of expressions, Comput. J., 6(5), 308-320, 1964.
41. P.J. Landin, An abstract machine for designers of computing languages, in Proc. IFIP Congr., 1965, pp. 438-439.
42. P.J. Landin, Acorrespondence between ALGOL 60 and Church’s lambda-notation, Part I, Commun. ACM, 8(2), pp. 89-101, 1965.
43. L.P. Lauer, Formal Definition of Algol 60, Technical report TR.25.088, IBM Lab, Vienna, 1968.
44. J.J. Leifer, Operational Congruences for Reactive Systems, Ph.D. thesis, University of Cambridge Computer Laboratory, 2001.
45. J. McCarthy, Towards a Mathematical Science of Computation, in Information Processing 1962, C.M. Popplewell, Ed., 1963, pp. 21-28.
46. D. Miller and J. Hannan, From operational semantics to abstract machines: preliminary results, in Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, ACM Press, New York, 1990.
47. M. Miculan, The expressive power of structural operational semantics with explicit assumptions, in Types for Proofs and Programs, H. Barendregt and T. Nipkow, Eds., Springer-Verlag, New York, Lecture Notes in Computer Science, Vol. 806, 1994, pp. 263-290.
48. R. Milner, Processes: A mathematical model of computing agents, in Proceedings Logic Colloquium 1973, H.E. Rose and J.C. Shepherdson, Eds., North-Holland, Amsterdam, 1973, pp. 158-173.
49. R. Milner, Program semantics and mechanized proof, in Foundations of Computer Science II, K.R. Apt and J.W. de Bakker, Eds., Mathematical Centre, Amsterdam, 1976, pp. 3-44.
50. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, New York, 1980.
51. R. Milner, Communication and Concurrency, Prentice Hall International, Englewood Cliffs, NJ, 1989.
52. J. Morris, A general axiom of assignment and linked data structure, in Theoretical Foundations of Programming Methodology, M. Broy and G. Schmidt, Eds., 1982, pp. 25-41.
53. J. Morris, Algebraic Operational Semantics for Modula 2, Ph.D. thesis, University of Michigan, 1988.
54. P.D. Mosses, Action Semantics, Vol. 26, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, London, 1992.
55. D. Le Metayer and D. Schmidt, Structural operational semantics as a basis for static program analysis, ACM Comput. Surv., 28, 340-343, 1996.
56. R. Milner, M. Tofte, R. Harper and D. MacQueen, The Definition of Standard ML (Revised), MIT Press, Cambridge, MA, 1997.
57. C.-H.L. Ong, Correspondence between operational and denotational semantics: the full abstraction problem for PCF, in Handbook of Theoretical Computer Science, S. Abramsky, Ed., Vol. 3, Oxford University Press, Oxford, 1999.
58. J. Palsberg, A provably correct compiler generator, in ESOP '92, 4th European Symposium on Programming, Proceedings, B. Krieg-Bruckner, Ed., Vol. 582, Springer-Verlag, New York, 1992, pp. 418-434.
59. D. Park, Concurrency and automata on infinite sequences, in 5th GI Conference, P. Deussen, Ed., Lecture Notes in Computer Science, Vol. 104, Springer-Verlag, New York, 1981, pp. 167-183.
60. PL/I Definition Group, Formal definition of PL/I version 1, report TR25.071, American National Standards Institute, 1986.
61. G.D. Plotkin, Call-by-name, call-by-value and the lambda-calculus, Theor. Comput. Sci., 1, 125-159, 1975.
62. G.D. Plotkin, LCF considered as a programming language, Theor. Comput. Sci., 5, 223-256, 1977.
63. G.D. Plotkin, A Structural Approach to Operational Semantics, report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
64. G.D. Plotkin, An operational semantics for CSP, in Proceedings IFIP TC2 Working Conference on Formal Description of Programming Concepts - II, Garmisch-Partenkirchen, D. Bjørner, Ed., North-Holland, Amsterdam, 1983, pp. 199-225.
65. D. Sands, From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages, in Conference Record 24th ACM Symposium on Principles of Programming Languages, Paris, France, 1997, pp. 428-441.
66. D.A. Schmidt, Denotational Semantics: A Methodology for Language Development, Allyn & Bacon, 1986.
67. P. Sewell, From rewrite rules to bisimulation congruences, in Proceedings of CONCUR '98, Lecture Notes in Computer Science, Vol. 1466, Springer-Verlag, New York, 1998, pp. 269-284.
68. J. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977.
69. R.D. Tennent, Principles of Programming Languages, Prentice Hall International, 1981.
70. S. Tini, An axiomatic semantics for Esterel, Theor. Comput. Sci., 269, 2001.
71. D.A. Turner, A new implementation technique for applicative languages, Software Pract. Exp., 9(1), pp. 31-49, 1979.
72. D.H.D. Warren, An Abstract Prolog Instruction Set, Technical note 309, SRI International, Menlo Park, CA, 1983.
73. D.A. Watt, Programming Concepts and Paradigms, Prentice Hall, New York, 1990.
74. S. Weber, B. Bloom and G. Brown, Compiling Joy to Silicon: A Verified Silicon Compilation Scheme, in Proceedings of the Advanced Research in VLSI and VLSI and Parallel Systems Conference, Providence, RI, 1992.
75. A. Wright and M. Felleisen, A syntactic approach to type soundness, Inf. Computation, 115(1), pp. 38-94, 1994.
76. G. Winskel, The Formal Semantics of Programming Languages: An Introduction, Foundations of Computing Science, MIT Press, Cambridge, MA, 1993.
77. M. Wand and D.P. Oliva, Proving the Correctness of Storage Representations, in Proceedings of the 1992 ACM Conference on LISP and Functional Programming, New York, 1992, pp. 151-160.