Sciweavers

5255 search results - page 466 / 1051
» Formal Methods for Privacy
Sort
View
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
16 years 1 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
16 years 1 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
111views Formal Methods» more  SAS 2007»
16 years 1 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
16 years 1 months ago
Optimal Abstraction on Real-Valued Programs
abstraction on real-valued programs David Monniaux Laboratoire d’informatique de l’´Ecole normale sup´erieure 45, rue d’Ulm, 75230 Paris cedex 5, France June 30, 2007 In t...
David Monniaux
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
16 years 1 months ago
Taming the Wrapping of Integer Arithmetic
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
Axel Simon, Andy King