Sciweavers

SAS
2007
Springer
126views Formal Methods» more  SAS 2007»
13 years 11 months ago
Hierarchical Pointer Analysis for Distributed Programs
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space lan...
Amir Kamil, Katherine A. Yelick
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
13 years 11 months ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin
SAS
2007
Springer
106views Formal Methods» more  SAS 2007»
13 years 11 months ago
Guided Static Analysis
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
Denis Gopan, Thomas W. Reps
SAS
2007
Springer
125views Formal Methods» more  SAS 2007»
13 years 11 months ago
A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages
Introducing aspect orientation to a polymorphically typed functional language strengthens the importance of type-scoped advices; i.e., advices with their effects being harnessed b...
Kung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Kh...
SAS
2007
Springer
13 years 11 months ago
Shape Analysis with Structural Invariant Checkers
Abstract. Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the des...
Bor-Yuh Evan Chang, Xavier Rival, George C. Necula
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
13 years 11 months ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
13 years 11 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston