SAS02 List of Accepted papers

Static Analysis of the Numerical Stability of Loops MARTEL Matthieu
Modular Control Flow Analysis for Libraries Christian Probst
On termination of programs with real numbers computations Alexander Serebrenik, Danny De Schreye
Polynomial Constants are Decidable Markus Müller-Olm, Helmut Seidl
Normalizable Horn clauses, Strongly Recognizable Relations and Spi Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
Detecting Optimal Termination Conditions of Logic Programs Fred Mesnard, Etienne Payet, and Ulrich Neumerkel
Representing and approximating transfer functions in Abstract Interpretation of hetereogeneous datatypes Bertrand Jeannet
Improving the Precision of Equality-Based Dataflow Analyses Erik Ruf
From Secrecy to Authenticity in Security Protocols Bruno Blanchet
Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation. Charles Hymans
Refinement of LTL Formulas for Abstract Model Checking Maria del Mar Gallardo, Pedro Merino, Ernesto Pimentel
Making Abstract Model Checking Strongly Preserving Francesco Ranzato and Francesco Tapparo
Static Confidentiality Enforcement for Distributed Programs Andrei Sabelfeld and Heiko Mantel
More Precise Yet Efficient Type Inference for Logic Programs Claudio Vaucheret and Francisco Bueno
A Few Graph-Based Relational Numerical Abstract Domains Antoine Mine'
Pipeline Modeling for Timing Analysis Marc Langenbach, Stephan Thesing, Reinhold Heckmann
Compactly Representing First-Order Structures for Static Analysis R. Manevich, G.Ramalingam, J. Field, D. Goyal, M. Sagiv
Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties Damien Masse
States vs. Traces in Model Checking by Abstract Interpretation Roberto Giacobazzi and Francesco Ranzato
Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer
Analysing Approximate Confinement under Uniform Attacks Alessandra Di Pierro Chris Hankin Herbert Wiklicky
Reuse of results in termination analysis of typed logic programs Maurice Bruynooghe, Michael Codish, Samir Genaim and Wim Vanhoof
Backward Type Inference Generalises Type Checking Lunjin Lu and Andy King
Security Typings by Abstract Interpretation Mirko Zanotti
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library R. Bagnara, E. Ricci, E. Zaffanella, P. M. Hill
Reliable Optimization for Imperative Languages: Proving Nullspace Properties of Compilers Todd L. Veldhuizen and Andrew Lumsdaine
Representation Analysis for Coercion Placement Karl-Filip Faxen
Ensuring Termination of Offline Partial Evaluation in Polynomial Time (A New Finiteness Analysis) Chin Soon Lee
Automated Verification of Concurrent Linked Lists with Counters Tuba Yavuz-Kahveci and Tevfik Bultan
An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages John Whaley, Monica Lam
An Improved Constraint-Based System for the Verification of Security Protocols Ricardo Corin, Sandro Etalle
Nonuniform Alias Analysis of Recursive Data Structures and Arrays Arnaud Venet