An observationally complete program logic for imperative higher-order functions (2005)
Cached
Download Links
| Venue: | In Proc. LICS’05 |
| Citations: | 34 - 10 self |
BibTeX
@INPROCEEDINGS{Honda05anobservationally,
author = {Kohei Honda and Nobuko Yoshida and Martin Berger},
title = {An observationally complete program logic for imperative higher-order functions},
booktitle = {In Proc. LICS’05},
year = {2005},
pages = {270--279}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We propose a simple compositional program logic for an imperative extension of call-by-value PCF, built on Hoare logic and our preceding work on program logics for pure higher-order functions. A systematic use of names and operations on them allows precise and general description of complex higher-order imperative behaviour. The proof rules of the logic exactly follow the syntax of the language and can cleanly embed, justify and extend the standard proof rules for total correctness of Hoare logic. The logic offers a foundation for general treatment of aliasing and local state on its basis, with minimal extensions. After establishing soundness, we prove that valid assertions for programs completely characterise their behaviour up to observational congruence, which is proved using a variant of finite canonical forms. The use of the logic is illustrated through reasoning examples which are hard to assert and infer using existing program logics.
