ITU

Verifying object-oriented programs with higher-order separation logic in Coq

Research output: Journal Article or Conference Article in JournalConference articleResearchpeer-review

View graph of relations

We present a shallow Coq embedding of a higher-order separation logic with nested triples for an object-oriented programming language. Moreover, we develop novel specification and proof patterns for reasoning in higher-order separation logic with nested triples about programs that use interfaces and interface inheritance. In particular, we show how to use the higher-order features of the Coq formalisation to specify and reason modularly about programs that (1) depend on some unknown code satisfying a specification or that (2) return objects conforming to a certain specification. All of our results have been formally verified in the interactive theorem prover Coq.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Volume6898
Pages (from-to)22-38
ISSN0302-9743
DOIs
Publication statusPublished - 2011

Downloads

No data available

ID: 34696898