Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Inferring Invariants in Separation Logic for Imperative List-processing Programs
 

Summary: Inferring Invariants in Separation Logic for Imperative
List-processing Programs
Stephen Magill
Carnegie Mellon University
smagill@cs.cmu.edu
Aleksandar Nanevski
Harvard University
aleks@eecs.harvard.edu
Edmund Clarke,
Peter Lee
Carnegie Mellon University
emc@cs.cmu.edu,
petel@cs.cmu.edu
ABSTRACT
An algorithm is presented for automatically inferring loop
invariants in separation logic for imperative list-processing
programs. A prototype implementation for a C-like lan-
guage is shown to be successful in generating loop invariants
for a variety of sample programs. The programs, while rela-
tively small, iteratively perform destructive heap operations

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics