A monad for basic Java semantics

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

Volumn 1816, Issue , 2000, Pages 150-164

  Jacobs, Bart ^a   Poll, Erik ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SOFTWARE; SEMANTICS;

DENOTATIONAL SEMANTICS; JAVA PROGRAM; PROOF TOOLS;

JAVA PROGRAMMING LANGUAGE;

EID: 84974727248     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45499-3_12     Document Type: Conference Paper

References (17)

1. J. Alves-Foss and F. S. Lam. Dynamic Denotational Semantics of Java. In Formal Syntax and Semantics of Java, volume 1523 of Lect. Notes Comp. Sci., pages 201-240. Springer-Verlag, 1998.
2. J. Van den Berg, M. Huisman, B. Jacobs, and E. Poll. A type-theoretic memory model for verification of sequential Java programs. Techn. Rep. CSI-R9924, Comput. Sci. Inst., Univ. Of Nijmegen, 1999.
3. P. Cenciarelli. An algebraic view of program composition. In A.M. Haeberer, editor, Algebraic Methodology and Software Technology, number 1548 in Lect. Notes Comp. Sci., pages 325-340. Springer, Berlin, 1998.
4. M.P. Fiore. Axiomatic Domain Theory in Categories of Partial Maps. Cambridge Univ. Press, 1996.
5. J. Gosling, B. Joy, and G. Steele. The Java Language Specification. Addison-Wesley, 1996.
6. M. Huisman and B. Jacobs. Inheritance in Higher Order Logic: Modeling and Reasoning. Techn. Rep. CSI-R0004, Comput. Sci. Inst., Univ. Of Nijmegen, 2000.
7. M. Huisman and B. Jacobs. Java program verification via a Hoare logic with abrupt termination. In Fundamental Approaches to Software Engineering, number 1783 in Lect. Notes Comp. Sci. Springer, Berlin, 2000.
8. M. Huisman, B. Jacobs, and J. Van den Berg. A case study in class library verification: Java’s Vector class. In B. Jacobs, G. T. Leavens, P. Müller, and A. Poetzsch-Heffter, editors, Formal Techniques for Java Programs. Proceedings of the ECOOP’99 Workshop, pages 37-44. Techn. Rep. 251, Fernuniversität Hagen, 1999.
9. B. Jacobs. Inheritance and cofree constructions. In P. Cointe, editor, European Conference on Object-Oriented Programming, number 1098 in Lect. Notes Comp. Sci., pages 210-231. Springer, Berlin, 1996.
10. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62:222-259, 1997.
11. B. Jacobs, J. Van den Berg, M. Huisman, M. Van Berkum, U. Hensel, and H. Tews. Reasoning about classes in Java (preliminary report). In Object-Oriented Program-ming, Systems, Languages and Applications, pages 329-340. ACM Press, 1998.
12. E. Moggi. Notions of computation and monads. Inf. & Comp., 93(1):55-92, 1991.
13. S. Owre, J.M. Rushby, N. Shankar, and F. Von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Trans. On Softw. Eng., 21(2):107-125, 1995.
14. L.C. Paulson. Isabelle: The next 700 theorem provers. In P. Odifreddi, editor, Logic and computer science, pages 361-386. Academic Press, London, 1990. The APIC series, vol. 31.
15. Loop Project. Http://www.cs.kun.nl/~bart/LOOP/.
16. H. Reichel. An approach to object semantics based on terminal co-algebras. Math. Struct. In Comp. Sci., 5:129-152, 1995.
17. J.E. Stoy. Denotational Semantics: the Scott-Strachey Approach to Programming Language Semantics. MIT Press, Cambridge, MA, 1977.