Some practical problems and their influence on semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1058, Issue , 1996, Pages 1-17

  Jones, Cliff B ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

OBJECT-ORIENTED DATABASES; SEMANTICS;

CONCURRENT OBJECTS; PRACTICAL PROBLEMS; SEMANTICS OF PROGRAMMING LANGUAGES;

OBJECT ORIENTED PROGRAMMING;

EID: 84947903966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61055-3_26     Document Type: Conference Paper

References (35)

1. P. Aczel. A note on program verification. manuscript, January 1982.
2. Pierre America. Issues in the design of a parallel object-oriented language. Formal Aspects of Computing, 1(4), 1989.
3. P.A. Bernstein et al. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
4. Ed Brinksma et al. Verifying sequential consistet memory. Technical Report Project P6021, ESPRIT, August 1994.
5. J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.
6. E. Best, editor. CONCUR'93: 4th International Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
7. C J Date. An Introduction to Database Systems. Addison-Wesley, sixth edition, 1994.
8. 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.
9. J.R. Gurd and C.B. Jones. The global-yet-personal information system. In Computing Tomorrow. Cambridge University Press, 1996.
10. G.H. Hardy. A Mathematician's Apology. Cambridge University Press, 1967.
11. 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.
12. 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.
13. C.A.R. Hoare. Recursive data structures. International Journal of Computer & Information Sciences, 4(2):105-132, June 1975.
14. 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.
15. K. Honda and M. Tokoro. A small calculus for concurrent objects. ACM, OOPS Messenger, 2(2):50-54, 1991.
16. 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.
17. 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.
18. C.B. Jones. Software Development: A Rigorous Approach. Prentice Hall International, 1980. ISBN 0-13-821884-6.
19. C.B. Jones. Data reification. In J.A. McDermid, editor, The Theory and Practice of Refinement, pages 79-89. Butterworths, 1989.
20. C.B. Jones. Systematic Software Development using VDM. Prentice Hall International, second edition, 1990. ISBN 0-13-880733-7.
21. C.B. Jones. Constraining interference in an object-based design method. In [GJ93], pages 136-150, 1993.
22. C.B. Jones. A pi-calculus semantics for an object-based design notation. In [Bes93], pages 158-172, 1993.
23. C.B. Jones. Accommodating interference in the formal design of concurrent object-based programs. Formal Methods in System Design, 8(2):105-122, 1996.
24. Donald E Knuth. The dangers of computer-science theory. In Logic, Methodology and Philosophy of Science IV, pages 189-195. North-Holland, 1973.
25. Nancy Lynch et al. Atomic Transactions. MIT Press, 1994.
26. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1-77, 1992.
27. T. Nipkow. Non-deterministic data types: Models and implementations. Acta Informatica, 22:629-661, 1986.
28. Plato. The Last Days of Socrates. Penguin Classics, 1954.
29. G.D. Plotkin. A powerdomain construction. SIAM J. Comput., 5(3), 1976.
30. G.D. Plotkin. A structural approach to operational semantics. Technical report, Aarhus University, 1981.
31. T.B. Steel. Formal Language Description Languages for Computer Programming. North-Holland, 1966.
32. F.W. Vaandrager. Process algebra semantics of POOL. In [Bae90], pages 173-236, 1990.
33. D. Walker. π-calculus semantics for object-oriented programming languages. In [IM91], pages 532-547, 1991.
34. 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.
35. M. Weber, M. Simons, and Ch. Lafontaine. The Generic Development Language Deva: Presentation and Case Studies, volume 738 ofLecture Notes in Computer Science. Springer-Verlag, 1993. ISBN 3-540-57335-6.