An observationally complete program logic for imperative higher-order functions

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 270-279

  Honda, Kohei ^a   Yoshida, Nobuko ^b   Berger, Martin ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONAL PROGRAM LOGIC; FINITE CANONICAL FORMS; HIGHER-ORDER FUNCTIONS; PROGRAM LOGIC;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FORMAL LOGIC; FUNCTIONS;

LOGIC PROGRAMMING;

EID: 26844488215     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2005.5     Document Type: Conference Paper

References (43)

1. C-home page. http://www.cminusminus.org.
2. A full version of this paper. Available at: http://www.dcs.qmul.ac.uk/ ~kohei/logics.
3. The Java Modeling Language (JML) home page. http://www.jmlspecs.org/.
4. M. Abadi and R. Leino. A logic for object-oriented programs. In Verification: Theory and Practice, pages 11-41. Springer-Verlag, 2004.
5. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Inf. & Comp., 163:409-470, 2000.
6. K. R. Apt. Ten Years of Hoare Logic: a survey. TOPLAS, 3:431-483, 1981.
7. M. Berger, K. Honda, and N. Yoshida. A logical analysis of aliasing for higher-order imperative functions. Available at: www.dcs.qmul.ac.uk/~kohei/ logics, 2005.
8. G. M. Bierman and M. J. Parkinson. Separation logic and abstractions. In POPL'05, 2005.
9. E. Clarke. Programming language constructs for which it is impossible to obtain good hoare axiom systems. J. ACM, 26(1):129-147, 1979.
10. P. Cousot. Methods and logics for proving programs. In Handbook of Theoretical Computer Science, volume B, pages 843-993. Elsevier, 1999.
11. W. Damm and B. Josko. A sound and relatively* complete hoare-logic for a language with higher type procedures. Acta Inf., 1983.
12. R. W. Floyd. Assigning meaning to programs. In Symp. in Applied Mathematics, volume 19, 1967.
13. S. M. German, E. M. Clarke, and J. Y. Halpern. Reasoning about procedures as parameters. In IBM Workshop on Logic of Programs, volume 131 of LNCS, pages 206-220, 1981.
14. D. Grossman, G. Morrisett, T. Jim, M. Hicks, Y. Wang, and J. Cheney. Region-based memory management in cyclone. In PLDI'02. ACM, 2002.
15. C. A. Gunter. Semantics of Programming Languages. MIT Press, 1995.
16. th POPL, pages 262-271. ACM Press, 1984.
17. M. Hennessy and R. Milner. Algebraic Laws for Non-Determinism and Concurrency. JACM, 32(1), 1985.
18. T. Hoare. An axiomatic basis of computer programming. CACM, 12, 1969.
19. K. Honda. From process logic to program logic. In ICFP' 04, pages 163-174. ACM Press, 2004.
20. K. Honda. Process Logic and Duality: Part (1) Sequential Processes. Available at: www.dcs.qmul.ac.uk/~kohei/logics, March 2004. Typescript, 234 pages.
21. K. Honda and N. Yoshida. Game-theoretic analysis of call-by-value computation. TCS, 221:393-456, 1999.
22. K. Honda and N. Yoshida. A compositional logic for polymorphic higher-order functions. In PPDP'04, pages 191-202, 2004.
23. J. M. E. Hyland and C. H. L. Ong. On full abstraction for PCF. Inf. & Comp., 163:285-408, 2000.
24. T. Kowaltowski. Axiomatic approach to side effects and general jumps. Acta Informatica, 7, 1977.
25. P. Landin. The mechanical evaluation of expressions. Computer Journal, 6:308-320, 1964.
26. P. Landin. A correspondence between algol 60 and church's lambda-notation. Comm. ACM, 8:2, 1965.
27. G. Leavens and A. L. Baker. Enhancing the pre- and post-condition technique for more expressive specifications. In FM'99: World Congress on Formal Methods. Springer, 1999.
28. I. Mason and C. Talcott. Equivalence in functional languages with effects. JFP, 1(3):287-327, 1991.
29. E. Mendelson. Introduction to Mathematical Logic. Wadsworth Inc., 1987.
30. A. R. Meyer. Floyd-Hoare logic defines semantics (preface version). In LICS'86, 1986.
31. A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables. In POPL'88, 1988.
32. R. Milner, M. Tofte, and R. W. Harper. The Definition of Standard ML. MIT Press, 1990.
33. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. ACM Trans. Program. Lang. Syst., 21(3):527-568, 1999.
34. E.-R. Olderog. Sound and complete hoare-like calculi based on copy rules. Acta Inf., 16:161-197, 1981.
35. th Theory of Computing, pages 320-329, 1983.
36. B. C. Pierce. Types and Programming Languages. MIT Press, 2002.
37. A. Pitts and I. Stark. Operational reasoning for functions with local state. In HOOTS'98, CUP, pages 227-273, 1998.
38. G. D. Plotkin. A structural approach to operational semantics. Technical report, DAIMI, Aarhus University, 1981.
39. J. C. Reynolds. Idealized Algol and its specification logic. In Tools and Notions for Program Construction, 1982.
40. J. C. Reynolds. Separation logic: a logic for shared mutable data structures. In LICS'02, 2002.
41. Z. Shao. An overview of the FLINT/ML compiler. In 1997 ACM SIGPLAN Workshop on Types in Compilation (TIC'97), Amsterdam, The Netherlands, June 1997.
42. B. A. Trakhtenbrot, J. Y. Halpern, and A. R. Meyer. From denotational to operational and axiomatic semantics for algol-like languages. In CMU Workshop on Logic of Programs, pages 474-500, 1984.
43. D. von Oheimb. Hoare logic for Java in Isabelle/HOL. Concurrency and Computation: Practice and Experience, 13(13), 2001.