University of Sussex
Browse

File(s) under permanent embargo

Program logics for sequential higher-order control

chapter
posted on 2023-06-08, 00:30 authored by Martin BergerMartin Berger
We introduce a Hoare logic for call-by-value higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an explicit logical representation of jumps and their dual 'places-to-jump-to'. This enables the assertion language to capture precisely the intensional and extensional effects of jumping by internalising rely/guarantee reasoning, leading to simple proof rules for higher-order functions with callcc. We show that the logic can reason easily about non-trivial uses of callcc. The logic matches exactly with the operational semantics of the target language (observational completeness), is relatively complete in Cook's sense and allows efficient generation of characteristic formulae.

History

Publication status

  • Published

Publisher

Springer Verlag

Volume

5961

Page range

194-211

Pages

470.0

Event name

3rd IPM International Conference on Fundamentals of Software Engineering (FSEN)

Event location

Kish Island, IRAN

Event type

conference

Event date

April 15-17, 2009

Book title

Fundamentals of software engineering: Third IPM International Conference, FSEN 2009, Kish Island, Iran, April 15-17, 2009, Revised Selected Papers

Place of publication

Berlin

ISBN

978-3-642-11622-3

Series

Lecture Notes in Computer Science

Department affiliated with

  • Informatics Publications

Full text available

  • No

Peer reviewed?

  • Yes

Editors

M Sirjani, F Arbab

Legacy Posted Date

2012-02-06

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC