Logical reasoning for higher-order functions with local state

Logical Methods in Computer Science

Volumn 4, Issue 4, 2008, Pages

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

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Languages; Theory; Verification

Indexed keywords

HIGHER-ORDER; HIGHER-ORDER FUNCTIONS; HOARE LOGIC; LOCAL REFERENCES; LOGICAL REASONING; NON-TRIVIAL; REACHABILITY; THEORY; HIGHER ORDER FUNCTIONS;

COMPUTERS; QUERY LANGUAGES; VERIFICATION; COMPUTER SCIENCE;

COMPUTER SCIENCE; COMPUTER CIRCUITS;

EID: 77149177279     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(4:2)2008     Document Type: Article

References (63)

1. Standard ML home page. http://www. smlnj. org.
2. The Caml home page. http://caml. inria. fr.
3. Martín Abadi and Rustan Leino. A logic for object-oriented programs. In Verification: Theory and Practice, pages 11-41. Springer-Verlag, 2004.
4. Samson Abramsky, Kohei Honda, and Guy McCusker. A fully abstract game semantics for general references. In Thirteenth Annual IEEE Symposium on Logic in Computer Science, LICS 1998, pages 334-344. IEEE Press, 1998.
5. Martin Berger, Kohei Honda, and Nobuko Yoshida. The three completeness results for the higher-order fucntions with alias and local state. http://www. doc. ic. ac. uk/-yoshida/local.
6. Martin Berger, Kohei Honda, and Nobuko Yoshida. A logical analysis of aliasing for higherorder imperative functions. Journal of Functional Programming, 17(4-5): 280-293, 2007.
7. Bodil Biering, Lars Birkedal, and Noah Torp-Smith. BI hyperdoctrines and higher-order separation logic. In Shmuel Sagiv, editor, Programming Languages and Systems, 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, Lecture Notes in Computer Science, pages 233-247. Springer, 2005.
8. Lars Birkedal, Noah Torp-Smith, and Hongseok Yang. Semantics of separation-logic typing and higher-order frame rules. In 20th IEEE Symposium on Logic in Computer Science, LICS 2005, 26-29 June 2005, Chicago, IL, USA, Proceedings, pages 260-269. IEEE, 2005.
9. Richard Bornat, Cristiano Calcagno, and Peter O'Hearn. Local reasoning, separation and aliasing. In Workshop SPACE, 2004.
10. Kim Bruce, Luca Cardelli, and Benjamin Pierce. Comparing object encodings. Infomation and Computation, 155(1/2): 108-133, 1999.
11. Luís Caires and Luca Cardelli. A Spatial Logic for Concurrency (Part I). Information and Computation, 186(2): 194-235, 2003.
12. Murdoch Gabbay and Andrew Pitts. A New Approach to Abstract Syntax Involving Binders. In 15th Annual IEEE Symposium on Logic in Computer Science, LICS 1999, 26-29 June 2000, Santa Barbara, California, USA., pages 214-224. IEEE Computer Society, 1999.
13. Murdoch J. Gabbay and Andy M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13: 341-363, 2001.
14. Carl A. Gunter. Semantics of Programming Languages. MIT Press, 1995.
15. David Harel. Proving the correctness of regular deterministic programs. Theoretical Computer Science, 12(16), 1980.
16. David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. The MIT Press, 2000.
17. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576-580, 1969.
18. C. A. R. Hoare. Proof of correctness of data representations. Acta Inf., 1: 271-281, 1972.
19. C. A. R. Hoare and N. Wirth. Axiomatic semantics of Pascal. Trans. Program. Lang. Syst., 1(2): 226-244, 1979.
20. Kohei Honda. Elementary structures in process theory (1): Sets with renaming. Mathematical Structures in Computer Science, 10(5): 617-663, 2000.
21. Kohei Honda. Processes and games. Electr. Notes Theor. Comput. Sci., 71, 2002.
22. Kohei Honda. From process logic to program logic. In ICFP'04: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming, pages 163-174. ACM Press, 2004.
23. Kohei Honda, Martin Berger, and Nobuko Yoshida. Descriptive and Relative Completeness of Logics for Higher-Order Functions. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, and IngoWegener, editors, Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006 (2), volume 4052 of Lecture Notes in Computer Science, pages 360-371. Springer, 2006.
24. Kohei Honda and Nobuko Yoshida. A compositional logic for polymorphic higher-order functions. In Eugenio Moggi and David ScottWarren, editors, Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP 2004, pages 191-202, Verona, Italy, 2004. ACM.
25. Kohei Honda, Nobuko Yoshida, and Martin Berger. An observationally complete program logic for imperative higher-order functions. In 20th IEEE Symposium on Logic in Computer Science, LICS 2005, 26-29 June 2005, Chicago, IL, USA, Proceedings, pages 270-279. IEEE Computer Society, 2005. Full version is is available at: www. dcs. qmul. ac. uk/-kohei/logics.
26. Furio Honsell, Ian A. Mason, Scott F. Smith, and Carolyn L. Talcott. A variable typed logic of effects. Inf. Comput., 119(1): 55-90, 1995.
27. Vasileios Koutavas and Mitchell Wand. Small bisimulations for reasoning about higher-order imperative programs. In J. Gregory Morrisett and Simon L. Peyton Jones, editors, Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006, pages 141-152. ACM, 2006.
28. Tomasz Kowaltowski. Axiomatic approach to side effects and general jumps. Acta Informatica, 7, 1977.
29. Shuvendu K. Lahiri and Shaz Qadeer. Verifying properties of well-founded linked lists. In Proceedings of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL 2006, pages 115-126. ACM Press, 2006.
30. Gary Leavens and Alber L. Baker. Enhancing the pre-and postcondition technique for more expressive specifications. In FM'99: World Congress on Formal Methods. Springer, 1999.
31. Ian A. Mason and Carolyn L. Talcott. Inferring the equivalence of functional programs that mutate data. Theor. Comput. Sci., 105(2): 167-215, 1992.
32. Ian A. Mason and Carolyn L. Talcott. References, local variables and operational reasoning. In Proceedings, 7th Annual IEEE Symposium on Logic in Computer Science, pages 186-197. IEEE Computer Society Press, 1992.
33. Elliot Mendelson. Introduction to Mathematical Logic. Wadsworth Inc., 1987.
34. Albert R. Meyer and Kurt Sieber. Towards fully abstract semantics for local variables. In the Fifteenth Annual ACM Symposium on Principles of Programming Languages, POPL'1998, pages 191-203, January 1988.
35. Dale Miller and Alwen Tiu. A proof theory for generic judgments. ACM Transactions on Computational Logic, 6(4): 749-783, 2005.
36. Robin Milner. An algebraic definition of simulation between programs. In IJCAI, pages 481-489, 1971.
37. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, parts I and II. Infomation and Computation, 100(1): 1-77, 1992.
38. Robin Milner, Mads Tofte, and Robert W. Harper. The Definition of Standard ML. MIT Press, 1990.
39. Eugenio Moggi. A general semantics for evaluation logic. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 353-362. IEEE Computer Society, 1994.
40. Eugenio Moggi. A semantics for evaluation logic. Fundam. Inform., 22(1/2): 117-152, 1995.
41. Till Mossakowski, Lutz Schröder, and Sergey Goncharov. A generic complete dynamic logic for reasoning about purity and effects. In José Luiz Fiadeiro and Paola Inverardi, editors, Fundamental Approaches to Software Engineering, 11th International Conference, FASE 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, volume 4961 of Lecture Notes in Computer Science, pages 199-214. Springer, 2008.
42. Aleksandar Nanevski, Amal Ahmed, Greg Morrisett, and Lars Birkedal. Abstract predicates and mutable adts in hoare type theory. In Rocco De Nicola, editor, Programming Languages and Systems, 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings, volume 4421 of Lecture Notes in Computer Science, pages 189-204. Springer, 2007.
43. Aleksandar Nanevski, Greg Morrisett, and Lars Birkedal. Polymorphism and separation in Hoare type theory. In Proceedings of the ACM SIGPLAN international conference on Functional programming, ICFP 2006, pages 62-73. ACM Press, 2006.
44. David A. Naumann. Observational purity and encapsulation. In Maura Cerioli, editor, Fundamental Approaches to Software Engineering, 8th International Conference, FASE 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, volume 3442 of Lecture Notes in Computer Science, pages 190-204. Springer, 2005.
45. Greg Nelson. Verifying reachability invariants of linked structures. In Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, POPL 1983, pages 38-47. ACM Press, January 1983.
46. Benjamin C. Pierce. Types and Programming Languages. MIT Press, 2002.
47. Benjamin C. Pierce and David N. Turner. Simple type-theoretic foundations for objecroriented programming. Journal of Functional Programming, 4(2): 207-247, 1993.
48. A. M. Pitts. Reasoning about local variables with operationally-based logical relations. In Algol-Like Languages, volume 2, chapter 17, pages 173-193. Birkhauser, 1997. Reprinted from IEEE Symposium on Logic in Computer Science 1996.
49. A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics, pages 227-273. CUP, 1998.
50. Andrew M. Pitts. Evaluation logic. In G. Birtwistle, editor, Proceedings of the IVth Higher Order Workshop, pages 162-189. Springer-Verlag, 1990.
51. Andy M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186: 165-193, 2003.
52. Vaughan R. Pratt. Six lectures on dynamic logic. In Foundations of Computer Science III, Part 2, number 109 in Mathematical Centre Tracts, pages 53-82, 1980.
53. Bernhard Reus and Jan Schwinghammer. Separation logic for higher-order store. In Computer Science Logic, CSL, volume 4207 of Lecture Notes in Computer Science, pages 575-590, 2006.
54. Bernhard Reus and Thomas Streicher. About Hoare logics for higher-order store. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, and Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, volume 3580 of Lecture Notes in Computer Science, pages 1337-1348. Springer, 2005.
55. John C. Reynolds. Idealized Algol and its specification logic. In Tools and Notions for Program Construction, 1982.
56. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In 17th IEEE Symposium on Logic in Computer Science, LICS 2002, pages 55-74, Copenhagen, Denmark, 2002. IEEE Computer Society.
57. Donald Sannella and Andrzej Tarlecki. Program specification and development in Standard ML. In POPL 1985, Proceedings of the ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 67-77. ACM, 1985.
58. Zhong Shao. An overview of the FLINT/ML compiler. In 1997 ACM Workshop on Types in Compilation (TIC'97), 1997.
59. Ian Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, December 1994.
60. David von Oheimb. Hoare logic for Java in Isabelle/HOL. Concurrency and Computation: Practice and Experience, 13(13), 2001.
61. Jannette Wing, Eugene Rollins, and Amy Zaremski. Thoughts on a Larch/ML and a new Application for LP. In First International Workshop on Larch, Dedham 1992, pages 297-312. Springer-Verlag, 1992.
62. Nobuko Yoshida, Kohei Honda, and Martin Berger. the first full version of this paper. http://www. doc. ic. ac. uk/-yoshida/local.
63. Nobuko Yoshida, Kohei Honda, and Martin Berger. Logical reasoning for higher-order functions with local state. In Helmut Seidl, editor, Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings, volume 4423 of Lecture Notes in Computer Science, pages 361-377. Springer, 2007.