Sciweavers

4340 search results - page 349 / 868
» Formal Methods and Cryptography
Sort
View
178
Voted
SAS
2007
Springer
16 years 1 months ago
Refactoring Using Type Constraints
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
Frank Tip
199
Voted
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...
187
Voted
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
176
Voted
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