Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SAS
2010
Springer
175views Formal Methods» more  SAS 2010»
11 years 7 months ago
Thread-Modular Counterexample-Guided Abstraction Refinement
ion Refinement Alexander Malkis1 , Andreas Podelski2 , and Andrey Rybalchenko3 1 IMDEA Software 2 University of Freiburg 3 TU M
Alexander Malkis, Andreas Podelski, Andrey Rybalch...
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
11 years 8 months ago
Alternation for Termination
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...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
11 years 8 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
134views Formal Methods» more  SAS 2010»
11 years 8 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
152views Formal Methods» more  SAS 2010»
11 years 8 months ago
Modelling Metamorphism by Abstract Interpretation
Mila Dalla Preda, Roberto Giacobazzi, Saumya K. De...
SAS
2010
Springer
139views Formal Methods» more  SAS 2010»
11 years 8 months ago
Interprocedural Analysis with Lazy Propagation
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...
Simon Holm Jensen, Anders Møller, Peter Thi...
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
11 years 8 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
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
11 years 8 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
140views Formal Methods» more  SAS 2010»
11 years 8 months ago
Automatic Verification of Determinism for Structured Parallel Programs
Martin T. Vechev, Eran Yahav, Raghavan Raman, Vive...
books