Some practical problems and their influence on semantics

  • Cliff B Jones
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1058)


This paper offers an assessment of what has been achieved in three decades of work on the semantics of programming languages and pinpoints some practical problems in computing which might stimulate further research. The examples sketched in this paper come from the author's own research on concurrent object oriented languages, from database practice, and from more speculative research on Internet issues.


Programming Language Formal Method Formal Semantic Abstract Syntax Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Acz82]
    P. Aczel. A note on program verification. manuscript, January 1982.Google Scholar
  2. [Ame89]
    Pierre America. Issues in the design of a parallel object-oriented language. Formal Aspects of Computing, 1(4), 1989.Google Scholar
  3. [B+87]
    P. A. Bernstein et al. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.Google Scholar
  4. [B+94]
    Ed Brinksma et al. Verifying sequential consistet memory. Technical Report Project P6021, ESPRIT, August 1994.Google Scholar
  5. [Bae90]
    J. C. M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.Google Scholar
  6. [Bes93]
    E. Best, editor. CONCUR'93: 4th International Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science. Springer-Verlag, 1993.Google Scholar
  7. [Dat94]
    C J Date. An Introduction to Database Systems. Addison-Wesley, sixth edition, 1994.Google Scholar
  8. [GJ93]
    M-C. Gaudel and J-P. Jouannaud, editors. TAPSOFT'93: Theory and Practice of Software Development, volume 668 of Lecture Notes in Computer Science. Springer-Verlag, 1993.Google Scholar
  9. [GJ96]
    J. R. Gurd and C. B. Jones. The global-yet-personal information system. In Computing Tomorrow. Cambridge University Press, 1996.Google Scholar
  10. [Har67]
    G. H. Hardy. A Mathematician's Apology. Cambridge University Press, 1967.Google Scholar
  11. [HJ96]
    S. J. Hodges and C. B. Jones. Non-interference properties of a concurrent object-based language: Proofs based on an operational semantics. In C. Lengauer, editor, to be published. Kluwer, 1996.Google Scholar
  12. [HMT89]
    R. Harper, R. Milner, and M. Tofte. The definition of standard ML — Version 3. Technical Report ECS-LFCS-89-81, University of Edinburgh, LFCS, Department of Computer Science, University of Edinburgh, The Kings Buildings, Edinburgh, 1989.Google Scholar
  13. [Hoa75]
    C. A. R. Hoare. Recursive data structures. International Journal of Computer & Information Sciences, 4(2):105–132, June 1975.Google Scholar
  14. [Hoa96]
    C. A. R. Hoare. How did software get so reliable without proof? In M-C Gaudel, editor, Proceedings FME'96. Springer-Verlag, 1996. Lecture Notes in Computer Science.Google Scholar
  15. [HT91]
    K. Honda and M. Tokoro. A small calculus for concurrent objects. ACM, OOPS Messenger, 2(2):50–54, 1991.Google Scholar
  16. [IM91]
    T. Ito and A. R. Meyer, editors. TACS'91 — Proceedings of the International Conference on Theoretical Aspects of Computer Science, Sendai, Japan, volume 526 of Lecture Notes in Computer Science. Springer-Verlag, 1991.Google Scholar
  17. [JJLM91]
    C. B. Jones, K. D. Jones, P. A. Lindsay, and R. Moore. mural: A Formal Development Support System. Springer-Verlag, 1991. ISBN 3-540-19651-X.Google Scholar
  18. [Jon80]
    C. B. Jones. Software Development: A Rigorous Approach. Prentice Hall International, 1980. ISBN 0-13-821884-6.Google Scholar
  19. [Jon89]
    C. B. Jones. Data reification. In J. A. McDermid, editor, The Theory and Practice of Refinement, pages 79–89. Butterworths, 1989.Google Scholar
  20. [Jon90]
    C. B. Jones. Systematic Software Development using VDM. Prentice Hall International, second edition, 1990. ISBN 0-13-880733-7.Google Scholar
  21. [Jon93a]
    C. B. Jones. Constraining interference in an object-based design method. In [GJ93], pages 136–150, 1993.Google Scholar
  22. [Jon93b]
    C. B. Jones. A pi-calculus semantics for an object-based design notation. In [Bes93], pages 158–172, 1993.Google Scholar
  23. [Jon96]
    C. B. Jones. Accommodating interference in the formal design of concurrent object-based programs. Formal Methods in System Design, 8(2):105–122, 1996.Google Scholar
  24. [Knu73]
    Donald E Knuth. The dangers of computer-science theory. In Logic, Methodology and Philosophy of Science IV, pages 189–195. North-Holland, 1973.Google Scholar
  25. [L+94]
    Nancy Lynch et al. Atomic Transactions. MIT Press, 1994.Google Scholar
  26. [MPW92]
    R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1–77, 1992.CrossRefGoogle Scholar
  27. [Nip86]
    T. Nipkow. Non-deterministic data types: Models and implementations. Acta Informatica, 22:629–661, 1986.CrossRefGoogle Scholar
  28. [Pla54]
    Plato. The Last Days of Socrates. Penguin Classics, 1954.Google Scholar
  29. [Plo76]
    G. D. Plotkin. A powerdomain construction. SIAM J. Comput., 5(3), 1976.Google Scholar
  30. [Plo81]
    G. D. Plotkin. A structural approach to operational semantics. Technical report, Aarhus University, 1981.Google Scholar
  31. [Ste66]
    T. B. Steel. Formal Language Description Languages for Computer Programming. North-Holland, 1966.Google Scholar
  32. [Vaa90]
    F. W. Vaandrager. Process algebra semantics of POOL. In [Bae90], pages 173–236, 1990.Google Scholar
  33. [Wal91]
    D. Walker. π-calculus semantics for object-oriented programming languages. In [IM91], pages 532–547, 1991.Google Scholar
  34. [Wal93]
    D. Walker. Process calculus and parallel object-oriented programming languages. In In T. Casavant (ed), Parallel Computers: Theory and Practice. Computer Society Press, to appear, 1993.Google Scholar
  35. [WSL93]
    M. Weber, M. Simons, and Ch. Lafontaine. The Generic Development Language Deva: Presentation and Case Studies, volume 738 of Lecture Notes in Computer Science. Springer-Verlag, 1993. ISBN 3-540-57335-6.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Cliff B Jones
    • 1
  1. 1.Department of Computer ScienceManchester UniversityUK

Personalised recommendations