SAS
2010
Springer
13 years 10 months ago
2010
Springer
ion Refinement Alexander Malkis1 , Andreas Podelski2 , and Andrey Rybalchenko3 1 IMDEA Software 2 University of Freiburg 3 TU M
SAS
2010
Springer
13 years 11 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
SAS
2010
Springer
13 years 11 months ago
2010
Springer
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
SAS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
SAS
2010
Springer
13 years 11 months ago
2010
Springer
SAS
2010
Springer
13 years 11 months ago
2010
Springer
We propose lazy propagation as a technique for flow- and context-sensitive interprocedural analysis of programs with objects and first-class functions where transfer functions ma...
SAS
2010
Springer
13 years 11 months ago
2010
Springer
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
SAS
2010
Springer
13 years 11 months ago
2010
Springer
SAS
2010
Springer
13 years 11 months ago
2010
Springer
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
SAS
2010
Springer
13 years 11 months ago
2010
Springer