Sciweavers

718 search results - page 20 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
APLAS
2005
ACM
15 years 5 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ENTCS
2007
107views more  ENTCS 2007»
14 years 11 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
NJC
2006
86views more  NJC 2006»
14 years 11 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
POPL
2010
ACM
15 years 9 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
67
Voted
IJDAR
2000
60views more  IJDAR 2000»
14 years 11 months ago
Integrated text and line-art extraction from a topographic map
Our proposed approach to text and line-art extraction requires accurately locating a text-string box and identifying external line vectors incident on the box. The results of extra...
Luyang Li, George Nagy, Ashok Samal, Sharad C. Set...