Sciweavers

899 search results - page 60 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
ESOP
2000
Springer
15 years 7 months ago
A Kleene Analysis of Mobile Ambients
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
120
Voted
TLDI
2009
ACM
140views Formal Methods» more  TLDI 2009»
16 years 25 days ago
Design patterns in separation logic
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
Neelakantan R. Krishnaswami, Jonathan Aldrich, Lar...
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 8 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 7 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
234
Voted
POPL
2007
ACM
16 years 4 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