A logical analysis of aliasing in imperative higher-order functions

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2005, Pages 280-293

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

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Calculus; Aliasing; Functional programming; Hoare Logics; Modalities; Pointers; Typing

Indexed keywords

ALIASING; HOARE-LOGICS; MODALITIES; POINTERS; TYPING;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES;

FUNCTIONAL PROGRAMMING;

EID: 33746226314     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1086365.1086401     Document Type: Conference Paper

References (39)

1. C- home page. http://www.cminusminus.org.
2. A full version of the present paper. Available for download at www.dcs.qmul.ac.uk/~kohei/logics.
3. Samson Abramsky, Kohei Honda, and Guy McCusker. A fully abstract game semantics for general references. In LICS'98, pages 334-344, 1998.
4. K R. Apt. Ten Years of Hoare Logic: a survey. TOPLAS, 3:431-483, 1981.
5. Friedrich L. Bauer, Edsger W. Dijkstra, and Tony Hoare, editors. Theoretical Foundations of Programming Methodology, Lecture Notes of an International Summer School. Reidel, 1982.
6. Patrick Blackburn, Maarten de Rijke, and Yde Venema. Modal Logic. Cambridge University Press, 2001.
7. Richard Bornat. Proving pointer programs in hoare logic. In Conf. on Mathematics of Program Construction, LNCS. Springer-Verlag, 2000.
8. Cristiano Calcagno, Philippa Gardner, and Matthew Hague. From separation logic to first-order logic. In Proc. FoSSaCs'05, LNCS. Springer-Verlag.
9. Robert Cartwright and Derek C. Oppen. Unrestricted procedure calls in Hoare's logic. In POPL, pages 131-140, 1978.
10. Robert Cartwright and Derek C. Oppen. The logic of aliasing. Acta Inf., 15:365-384, 1981.
11. Patrick Cousot. Methods and logics for proving programs. In Handbook of Theoretical Computer Science, volume B, pages 843- 993. Elsevier, 1999.
12. G. W. Kulczycki et al. Reasoning about procedure calls with repeated arguments and the reference-value distinction. Technical Report TR ]02-13a, Dept. of Comp. Sci., Iowa State Univ., December 2003.
13. Jean-Christophe Filliâtre and Nicolas Magaud. Certification of sorting algorithms in the system Coq. In Theorem Proving in Higher Order Logics: Emerging Trends, 1999.
14. Robert W. Floyd. Assigning meaning to programs. In Symp. in Applied Mathematics, volume 19, 1967.
15. Irene Greif and Albert R. Meyer. Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer. ACM Trans. Program. Lang. Syst., 3(4), 1981.
16. David Gries and Gary Levin. Assignment and procedure call proof rules. ACM Trans. Program. Lang. Syst., 2(4):564-579, 1980.
17. Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, and James Cheney. Region-based memory management in cyclone. In PLDI'02. ACM, 2002.
18. Carl A. Gunter. Semantics of Programming Languages. MIT Press, 1995.
19. Matthew Hennessy and Robin Milner. Algebraic Laws for Non- Determinism and Concurrency. JACM, 32(1), 1985.
20. Tony Hoare. An axiomatic basis of computer programming. CACM, 12, 1969.
21. Tony Hoare and He Jifeng. Unifying Theories of Programming. Prentice-Hall International, 1998.
22. Kohei Honda. From process logic to program logic. In ICFP'04, pages 163-174. ACM Press, 2004.
23. Kohei Honda and Nobuko Yoshida. A compositional logic for polymorphic higher-order functions. In PPDP'04, pages 191-202. ACM Press, 2004.
24. Kohei Honda, Nobuko Yoshida, and Martin Berger. An observationally complete program logic for imperative higher-order functions. In Proc. LICS'05, pages 270-279. IEEE, 2005.
25. T. M. V. Janssen and Peter van Emde Boas. On the proper treatment of referencing, dereferencing and assignment. In Proc. ICALP, pages 282-300, 1977.
26. Brian W. Kernighan and Dennis M. Ritchie. The C Programming Language, Second Edition. Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
27. Thomas Kleymann. Hoare logic and auxiliary variables. Technical report, University of Edinburgh, LFCS ECS-LFCS-98-399, October 1998.
28. Etienne Lozes. Elimination of spatial connectives in static spatial logics. TCS, to appear.
29. David C. Luckham and Norihisa Suzuki. Verification of array, record, and pointer operations in pascal. ACM Trans. Program. Lang. Syst., 1(2):226-244, 1979.
30. John L. McCarthy. Towards a mathematical science of computation. In IFIP Congress, pages 21-28, 1962.
31. Elliot Mendelson. Introduction to Mathematical Logic. Wadsworth Inc., 1987.
32. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, parts I and II. Info. & Comp., 100(1):1-77, 1992.
33. Joseph M. Morris. A general axiom of assignment/ assignment and linked data structures/ a proof of the Schorr-Wait algorithm. In [5], pages 25-52. Reidel, 1982.
34. Peter O'Hearn, Hongseok Yang, and John C. Reynolds. Separation and information hiding. In POPL'04, 2004.
35. Benjamin C. Pierce. Types and Programming Languages. MIT Press, 2002.
36. Andrew Pitts and Ian Stark. Operational reasoning for functions with local state. In HOOTS'98, CUP, pages 227-273, 1998.
37. John C. Reynolds. Separation logic: a logic for shared mutable data structures. In LICS'02, 2002.
38. Zhong Shao. An overview of the FLINT/ML compiler. In 1997 ACM SIGPLAN Workshop on Types in Compilation (TIC'97), Amsterdam, The Netherlands, June 1997.
39. Boris Trakhtenbrot, Joseph Halpern, and Albert Meyer. From Denotational to Operational and Axiomatic Semantics for ALGOLlike languages: an overview. In Logic of Programs, volume 164 of LNCS, pages 474-500, 1984.