UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Automated cyclic entailment proofs in separation logic

Brotherston, J; Distefano, D; Petersen, RL; (2011) Automated cyclic entailment proofs in separation logic. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). (pp. 131 - 146).

Full text not available from this repository.

Abstract

We present a general automated proof procedure, based upon cyclic proof, for inductive entailments in separation logic. Our procedure has been implemented via a deep embedding of cyclic proofs in the HOL Light theorem prover. Experiments show that our mechanism is able to prove a number of non-trivial entailments involving inductive predicates. © 2011 Springer-Verlag Berlin Heidelberg.

Type:Proceedings paper
Title:Automated cyclic entailment proofs in separation logic
DOI:10.1007/978-3-642-22438-6_12
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record