University of Sussex
Browse
1-s2.0-S0304397513008219-main.pdf (496.38 kB)

An observationally complete program logic for imperative higher-order functions

Download (496.38 kB)
journal contribution
posted on 2023-06-09, 09:26 authored by Kohei Honda, Nobuko Yoshida, Martin BergerMartin Berger
We establish a strong completeness property called observational completeness of the program logic for imperative, higher-order functions introduced in [1]. Observational completeness states that valid assertions characterise program behaviour up to observational congruence, giving a precise correspondence between operational and axiomatic semantics. The proof layout for the observational completeness which uses a restricted syntactic structure called finite canonical forms originally introduced in game-based semantics, and characteristic formulae originally introduced in the process calculi, is generally applicable for a precise axiomatic characterisation of more complex program behaviour, such as aliasing and local state.

History

Publication status

  • Published

File Version

  • Published version

Journal

Theoretical Computer Science

ISSN

0304-3975

Publisher

Elsevier

Volume

517

Page range

75-101

Department affiliated with

  • Informatics Publications

Research groups affiliated with

  • Foundations of Software Systems Publications

Full text available

  • Yes

Peer reviewed?

  • Yes

Legacy Posted Date

2017-12-18

First Open Access (FOA) Date

2017-12-18

First Compliant Deposit (FCD) Date

2017-12-18

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC