Sciweavers

122 search results - page 2 / 25
» Completeness of Pointer Program Verification by Separation L...
Sort
View
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
13 years 6 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders
LFCS
2007
Springer
13 years 11 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
FORTE
2010
13 years 6 months ago
Heap-Dependent Expressions in Separation Logic
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
Jan Smans, Bart Jacobs, Frank Piessens
POPL
2007
ACM
14 years 5 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
POPL
2007
ACM
14 years 5 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty