Search
Now showing items 1-9 of 9
On Spatial Conjunction as Second-Order Logic
(2004-10-25)
Spatial conjunction is a powerful construct for reasoning about dynamically allocateddata structures, as well as concurrent, distributed and mobile computation. Whileresearchers have identified many uses of spatial ...
A Combined Pointer and Purity Analysis for Java Programs
(2004-05-17)
We present a new method purity analysis for Java programs.A method is pure if it does not mutate any location that exists in the program state right before method invocation.Our analysis is built on top of a combined pointer ...
On Verifying a File System Implementation
(2004-05-06)
We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed-size disk blocks. We prove the implementation correct ...
On Our Experience with Modular Pluggable Analyses
(2004-10-04)
We present a technique that enables the focused applicationof multiple analyses to di erent modules in thesame program. In our approach, each module encapsulatesone or more data structures and uses membershipin abstract ...
On Decision Procedures for Set-Value Fields
(2004-11-30)
An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ...
Enhancing Availability and Security Through Failure-Oblivious Computing
(2004-02-06)
We present a new technique, failure-oblivious computing,that enables programs to continue to execute through memoryerrors without memory corruption. Our safe compilerfor C inserts checks that dynamically detect invalid ...
On Generalized Records and Spatial Conjunction in Role Logic
(2004-04-06)
We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic ...
Data Structure Repair Using Goal-Directed Reasoning
(2004-05-18)
Model-based data structure repair is a promising techniquefor enabling programs to continue to execute successfullyin the face of otherwise fatal data structure corruption errors.Previous research in this eld relied on ...
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
(2004-07-19)
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmetic operations (PA). BAPA can express the ...