Title
Mutation in linked data structures
Abstract
Separation logic was developed as an extension to Hoare logic with the aim of simplifying pointer program proofs. A key feature of the logic is that it focuses the reasoning effort on only those parts of the heap that are relevant to a program - so called local reasoning. Underpinning this local reasoning are the separating conjunction and separating implication operators. Here we present an automated reasoning technique called mutation that provides guidance for separation logic proofs. Specifically, given two heap structures specified within separation logic, mutation attempts to construct an equivalence proof using a difference reduction strategy. Pivotal to this strategy is a generalised decomposition operator which is essential when matching heap structures. We show how mutation provides an effective strategy for proving the functional correctness of iterative and recursive programs within the context of weakest precondition analysis. Currently, mutation is implemented as a proof plan within our CORE program verification system. CORE combines results from shape analysis with our work on invariant generation and proof planning. We present our results for mutation within the context of the CORE system.
Year
DOI
Venue
2011
10.1007/978-3-642-24559-6_20
ICFEM
Keywords
Field
DocType
core system,mutation attempt,automated reasoning technique,separation logic proof,reasoning effort,core program verification system,difference reduction strategy,hoare logic,separation logic,data structure,local reasoning
Predicate transformer semantics,Automated reasoning,Separation logic,Programming language,Computer science,Correctness,Hoare logic,Heap (data structure),Theoretical computer science,Bunched logic,Mathematical proof
Conference
Volume
ISSN
Citations 
6991
0302-9743
3
PageRank 
References 
Authors
0.44
13
2
Name
Order
Citations
PageRank
Ewen Maclean1384.77
Andrew Ireland212215.39