Descriptive and relative completeness of logics for higher-order functions

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

Volumn 4052 LNCS, Issue , 2006, Pages 360-371

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

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; FUNCTION EVALUATION; HIERARCHICAL SYSTEMS; PROGRAM PROCESSORS; SEMANTICS;

COMPLETENESS; HIERARCHY; HIGHER-ORDER FUNCTIONS; LOGICS;

FORMAL LOGIC;

EID: 33746327486     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_31     Document Type: Conference Paper

References (33)

1. A full version of this paper. Available at: http://www.dcs.qmul.ac.uk/ ~kohei/logics.
2. A prototype implementation of an algorithm deriving characteristic formulae. http://www.dcs.qmul.ac.uk/~martinb/capg, October 2005.
3. M. Berger, K. Honda, and N. Yoshida. A logical analysis of aliasing for higher-order imperative functions. In ICFP'05, pages 280-293, 2005.
4. A. Blass and Y. Gurevich. The Underlying Logic of Hoare Logic. In Current Trends in Theoretical Computer Science, pages 409-436. 2001.
5. E. M. Clarke. The characterization problem for Hoare logics. In Proc. Royal Society meeting on Mathematical logic and programming languages, pages 89-106, 1985.
6. S. A. Cook. Soundness and completeness of an axiom system for program verification. SIAM J. Comput., 7(1):70-90, 1978.
7. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. CUP, 1990.
8. J. W. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1980.
9. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005.
10. E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
11. R. W. Floyd. Assigning meaning to programs. In Symp. in Applied Math., volume 19, 1967.
12. G. Gorelick. A complete axiomatic system for proving assertions about recursive and nonrecursive programs. Technical Report 75, Univ. of Toronto, 1975.
13. S. Graf and J. Sifakis. A Modal Characterization of Observational Congruence on Finite Terms of CCS. In ICALP'84, pages 222-234, London, UK, 1984. Springer-Verlag.
14. C. A. Gunter. Semantics of Programming Languages. MIT Press, 1995.
15. J. Y. Halpern. A good Hoare axiom system for an ALGOL-like language, In 11th POPL, pages 262-271. ACM Press, 1984.
16. K. Honda. From process logic to program logic. In ICFP'04, pages 163-174. ACM, 2004.
17. K. Honda. From process logic to program logic (full version of [16]). Available at: www.dcs.qmul.ac.uk/~kohei/logics, November 2004. Typescript, 52 pages.
18. K. Honda and N. Yoshida. A compositional logic for polymorphic higher-order functions. In PPDP'04, pages 191-202. ACM, 2004.
19. K. Honda, N. Yoshida, and M. Berger. An observationally complete program logic for imperative higher-order functions. In LICS'05, pages 270-279, 2005.
20. J. C. King. A program verifier. In IFIP Congress (I), pages 234-249, 1971.
21. T. Kleymann. Hoare logic and auxiliary variables. Technical report, University of Edinburgh, LFCS ECS-LFCS-98-399, October 1998.
22. D. Leivant. Logical and mathematical reasoning about imperative programs: preliminary report. In Proc. POPL'85, pages 132-140, 1985.
23. D. Leivant. Partial correctness assertions provable in dynamic logics. In FoSSaCS, volume 2987 of LNCS, pages 304-317, 2004.
24. E. Mendelson. Introduction to Mathematical Logic. Wadsworth Inc., 1987.
25. E.-R. Olderog. Sound and Complete Hoare-like Calculi Based on Copy Rules. Acta Inf., 16:161-197, 1981.
26. S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM Trans. Program. Lang. Syst., 4(3):455-495, 1982.
27. B. C. Pierce. Types and Programming Languages. MIT Press, 2002.
28. G. D. Plotkin and C. Stirling. A framework for intuitionistic modal logics. In Theor. Aspects of Reasoning about Knowledge, pages 399-406. Morgan Kaufmann, 1986.
29. M. Smyth. Power domains and predicate transformers: A topological view. In ICALP'83, volume 154 of LNCS, pages 662-675, 1983.
30. S. Sokołowski. Axioms for total correctness. Acta Inf., 9:61-71, 1977.
31. B. Steffen. Characteristic formulae. In ICALP'89, pages 723-732. Springer-Verlag, 1989.
32. B. Steffen and A. Ingólfsdóttir. Characteristic formulae for processes with divergence. Inf. Comput., 110(1): 149-163, 1994.
33. D. von Oheimb. Hoare logic for mutual recursion and local variables. In FSTTCS, volume 1738 of LNCS, pages 168-180, 1999.