Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control-Reference-Cited by-同舟云学术

Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control

Published:2012-04 Issue:3 Volume:81 Page:181-208
ISSN:1567-8326
Container-title:The Journal of Logic and Algebraic Programming
language:en
Short-container-title:The Journal of Logic and Algebraic Programming

Author:

Crolard T.,Polonowski E.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Logic,Theoretical Computer Science,Software

Reference90 articles.

1. Ten years of Hoare’s logic: a survey – part I;Apt;ACM Trans. Program. Lang. Syst.,1981

2. Deriving proof rules from continuation semantics;Audebaud;Formal Aspects Comput.,1999

3. F. Barbanera, S. Berardi, Extracting constructive content from classical logic via control-like reductions, in: LNCS, vol. 662, Springer-Verlag, 1994, pp. 47–59.

4. High Integrity Software: The SPARK Approach to Safety and Security;Barnes,2003

5. Computational types from a logical perspective;Benton;J. Funct. Programming,1998

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

1. A separation logic for effect handlers;Proceedings of the ACM on Programming Languages;2021-01-04

2. Mechanized relational verification of concurrent programs with continuations;Proceedings of the ACM on Programming Languages;2019-07-26

3. Hoare-style reasoning with (algebraic) continuations;ACM SIGPLAN Notices;2013-11-12

4. Hoare-style reasoning with (algebraic) continuations;Proceedings of the 18th ACM SIGPLAN international conference on Functional programming;2013-09-25

5. Automatically Generated Infrastructure for De Bruijn Syntaxes;Interactive Theorem Proving;2013