Search
Now showing items 1-6 of 6
System Dependence Graph Construction for Aspect-Oriented Programs
(2003-03)
We extend previous dependence-based representations called system dependence graphs (SDGs) to represent aspect-oriented programs and present an SDG construction algorithm. This algorithm first constructs a module dependence ...
On Modular Pluggable Analyses Using Set Interfaces
(2003-12-18)
We present a technique that enables the focused applicationof multiple analyses to different modules in the same program. Our researchhas two goals: 1) to address the scalability limitations of preciseanalyses by focusing ...
Efficient Specification-Assisted Error Localization and Correction
(2003-11-13)
We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ...
On the Theory of Structural Subtyping
(2003-01)
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let Sigma be a language consisting of function symbols (representing type constructors) and C a decidable structure in the ...
On Role Logic
(2003-10-24)
We present role logic, a notation for describing propertiesof relational structures in shape analysis, databases, andknowledge bases. We construct role logic using the ideas ofde Bruijn's notation for lambda calculus, an ...
On The Boolean Algebra of Shape Analysis Constraints
(2003-08-22)
Shape analysis is a promising technique for statically verifyingand extracting properties of programs that manipulatecomplex data structures. We introduce a new characterizationof constraints that arise in parametric ...