Sciweavers

12 search results - page 3 / 3
» Recursive proofs for inductive tree data-structures
Sort
View
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 5 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
SAS
2004
Springer
13 years 10 months ago
On Logics of Aliasing
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
Marius Bozga, Radu Iosif, Yassine Lakhnech