Formal reasoning about runtime code update

Authors:
Nathaniel Charlton;Ben Horsfall;Bernhard Reus
Affiliations:
School of Informatics, University of Sussex, Brighton, United Kingdom;School of Informatics, University of Sussex, Brighton, United Kingdom;School of Informatics, University of Sussex, Brighton, United Kingdom
Venue:
ICDEW '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering Workshops
Year:
2011

Citing 0
Cited 6

Hoare logic for higher order store using simple semantics

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Specification patterns and proofs for recursion through the store

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Report on the third workshop on hot topics in software upgrades (HotSWUp'11)

ACM SIGOPS Operating Systems Review
Crowfoot: a verifier for higher-order store programs

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Specifying and verifying the correctness of dynamic software updates

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Specification patterns for reasoning about recursion through the store

Information and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show how dynamic software updates can be modelled using a "higher order store" programming language where procedures can be written to the heap. We then show how such updates can be proved correct with a Hoare-calculus that allows for keeping track of behavioural specifications of such stored procedures.