Sciweavers

26 search results - page 3 / 6
» sas 2010
Sort
View
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
13 years 9 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
SAS
2010
Springer
172views Formal Methods» more  SAS 2010»
13 years 9 months ago
Deriving Numerical Abstract Domains via Principal Component Analysis
Numerical Abstract Domains via Principal Component Analysis Gianluca Amato, Maurizio Parton, and Francesca Scozzari Universit`a di Chieti-Pescara – Dipartimento di Scienze We pro...
Gianluca Amato, Maurizio Parton, Francesca Scozzar...
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
13 years 9 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
13 years 9 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 9 months ago
Boxes: A Symbolic Abstract Domain of Boxes
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...
Arie Gurfinkel, Sagar Chaki