Sciweavers

SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 11 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 11 months ago
Abstract Interpreters for Free
Matthew Might
SAS
2010
Springer
126views Formal Methods» more  SAS 2010»
13 years 11 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 11 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 11 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 11 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