Sciweavers

SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
16 years 7 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
SAS
2009
Springer
214views Formal Methods» more  SAS 2009»
16 years 7 months ago
Abstract Interpretation of FIFO Replacement
Interpretation of FIFO Replacement Daniel Grund and Jan Reineke Saarland University, Saarbr?ucken, Germany In hard real-time systems, the execution time of programs must be bounded...
Daniel Grund, Jan Reineke
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
SAS
2009
Springer
119views Formal Methods» more  SAS 2009»
16 years 7 months ago
Abstraction Refinement for Quantified Array Assertions
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...
Mohamed Nassim Seghir, Andreas Podelski, Thomas Wi...
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
16 years 7 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
SAS
2009
Springer
148views Formal Methods» more  SAS 2009»
16 years 7 months ago
Abstract Interpretation from a Topological Perspective
Interpretation from a Topological Perspective David A. Schmidt Kansas State University, Manhattan, Kansas, USA Abstract. Topology is the study of property sets (open sets) and cont...
David A. Schmidt
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
16 years 7 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
SAS
2009
Springer
137views Formal Methods» more  SAS 2009»
16 years 7 months ago
Invariant Checking for Programs with Procedure Calls
Guillem Godoy, Ashish Tiwari
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
16 years 7 months ago
Type Analysis for JavaScript
JavaScript is the main scripting language for Web browsers, and it is essential to modern Web applications. Programmers have started using it for writing complex applications, but ...
Anders Møller, Peter Thiemann, Simon Holm J...