Sciweavers

2 search results - page 1 / 1
» Refinement-Based Verification for Possibly-Cyclic Lists
Sort
View
BIRTHDAY
2006
Springer
14 years 2 months ago
Refinement-Based Verification for Possibly-Cyclic Lists
In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an...
Alexey Loginov, Thomas W. Reps, Mooly Sagiv
POPL
2008
ACM
14 years 11 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...