About Hoare logics for higher-order store

Reus, Bernhard and Streicher, Thomas (2005) About Hoare logics for higher-order store. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C. and Yung, M. (eds.) Automata, Languages and Programming: Proceedings of the 32nd International Colloquim, ICALP 2005, Lisbon, Portugal. Lecture Notes in Computer Science, 3580 . Springer Verlag, Berlin, Germany, pp. 1337-1348. ISBN 9783540275800

Download (175kB) | Preview


We present a Hoare logic for a simple imperative while-language with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called higher-order. Soundness of our logic is established by using denotational rather than operational semantics. The former is employed to elegantly account for an inherent difficulty of higher-order store, namely that assertions necessarily describe recursive predicates on a recursive domain. In order to obtain proof rules for mutually recursive procedures, assertions have to explicitly refer to the code of the procedures. Both authors have been partially supported by APPSEM II (Applied Semantics), a thematic network funded by the IST programme of the European Union, IST-2001-38957.

Item Type: Book Section
Additional Information: Publisher's version available at official url
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: Q Science > QA Mathematics > QA0075 Electronic computers. Computer science
Depositing User: Chris Keene
Date Deposited: 13 Aug 2007
Last Modified: 24 Sep 2019 11:55
URI: http://sro.sussex.ac.uk/id/eprint/1428
Google Scholar:15 Citations

View download statistics for this item

📧 Request an update