Sciweavers

858 search results - page 25 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
POPL
2007
ACM
14 years 7 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
APLAS
2008
ACM
13 years 9 months ago
Reasoning about Java's Reentrant Locks
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....
Christian Haack, Marieke Huisman, Clément H...
POPL
1999
ACM
13 years 11 months ago
Parametric Shape Analysis via 3-Valued Logic
hought of as abstract interpretation for the heap How we talk about the heap   Program var X points to U that has an N field pointing to V   We use first order predicate logic ¡...
Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm
PTS
2010
175views Hardware» more  PTS 2010»
13 years 5 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
CONCUR
2005
Springer
14 years 29 days ago
Type-Directed Concurrency
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
Deepak Garg, Frank Pfenning