Sciweavers

SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
13 years 4 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»
13 years 4 months ago
Automatic Verification of Determinism for Structured Parallel Programs
Martin T. Vechev, Eran Yahav, Raghavan Raman, Vive...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 4 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
SAS
2010
Springer
124views Formal Methods» more  SAS 2010»
13 years 4 months ago
Abstract Interpreters for Free
Matthew Might
SAS
2010
Springer
126views Formal Methods» more  SAS 2010»
13 years 4 months ago
From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis
Elvira Albert, Puri Arenas, Samir Genaim, German P...
SAS
2010
Springer
172views Formal Methods» more  SAS 2010»
13 years 4 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
159views Formal Methods» more  SAS 2010»
13 years 4 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 4 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
ISOLA
2010
Springer
13 years 4 months ago
Towards an Architecture for Runtime Interoperability
Abstract. Interoperability remains a fundamental challenge when connecting heterogeneous systems which encounter and spontaneously communicate with one another in pervasive computi...
Amel Bennaceur, Gordon S. Blair, Franck Chauvel, G...