Descriptive and Relative Completeness of Logics for Higher-Order Functions-Reference-Cited by-同舟云学术

Descriptive and Relative Completeness of Logics for Higher-Order Functions

Published:2006 Issue: Volume: Page:360-371
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Honda Kohei,Berger Martin,Yoshida Nobuko

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11787006_31.pdf

Reference33 articles.

1. Lecture Notes in Computer Science;H. Comon,1998

2. A prototype implementation of an algorithm deriving characteristic formulae (October 2005), http://www.dcs.qmul.ac.uk/~martinb/capg

3. Berger, M., Honda, K., Yoshida, N.: A logical analysis of aliasing for higher-order imperative functions. In: ICFP 2005, pp. 280–293 (2005)

4. Blass, A., Gurevich, Y.: The Underlying Logic of Hoare Logic. In: Current Trends in Theoretical Computer Science, pp. 409–436 (2001)

5. Clarke, E.M.: The characterization problem for Hoare logics. In: Proc. Royal Society meeting on Mathematical logic and programming languages, pp. 89–106 (1985)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stable relations and abstract interpretation of higher-order programs;Proceedings of the ACM on Programming Languages;2020-08-02

2. Relatively complete refinement type system for verification of higher-order non-deterministic programs;Proceedings of the ACM on Programming Languages;2018-01

3. An observationally complete program logic for imperative higher-order functions;Theoretical Computer Science;2014-01

4. Automating relatively complete verification of higher-order functional programs;ACM SIGPLAN Notices;2013-01-23

5. Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control;The Journal of Logic and Algebraic Programming;2012-04