Polynomial Constants are Decidable
Markus Muller-Olm and Helmut Seidl

Normalizable Horn Clauses, Strongly Recognizable Relations and Spi
Flemming Nielson, Hanne Riis Nielson, and Helmut Seidl

Nonuniform Alias Analysis of Recursive Data Structures and Arrays
Arnaud Venet

Representing and Approximating Transfer Functions in Abstract Interpretation of Heterogeneous Datatypes
Bertrand Jeannet

Automated Verification of Concurrent Linked Lists with Counters
Tuba Yavuz-Kahveci and Tevfik Bultan

Backward Type Inference Generalises Type Checking
Lunjin Lu and Andy King

More Precise Yet Efficient Type Inference for Logic Programs
Claudio Vaucheret and Francisco Bueno

A Few Graph-Based Relational Numerical Abstract Domains
Antoine Mine

Static Analysis of the Numerical Stability of Loops
Matthieu Martel

On Termination of Logic Programs with Floating Point Computations
Alexander Serebrenik and Danny De Schreye

Modular Control Flow Analysis for Libraries
Christian W. Probst

An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages
John Whaley and Monica S. Lam

Compactly Representing First-Order Structures for Static Analysis
R. Manevich, G. Ramalingam, J. Field, D. Goyal, and M. Sagiv

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
Roberto Bagnara, Elisa Ricci, Enea Zaffanella, and Patricia M. Hill

Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis
Stephen Adam, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram~K. Rajamani, Mark Seigle, and Westley Weimer

Improving the Precision of Equality-Based Dataflow Analyses
Erik Ruf

Guaranteed Optimization: Proving Nullspace Properties of Compilers
Todd L. Veldhuizen and Andrew Lumsdaine

Representation Analysis for Coercion Placement
Karl-Filip Faxen

Pipeline Modeling for Timing Analysis
Marc Langenbach, Stephan Thesing, and Reinhold Heckmann

Analysing Approximate Confinement under Uniform Attacks
Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky

An Improved Constraint-Based System for the Verification of Security Protocols
Ricardo Corin and Sandro Etalle

From Secrecy to Authenticity in Security Protocols
Bruno Blanchet

Security Typings by Abstract Interpretation
Mirko Zanotti

Static Confidentiality Enforcement for Distributed Programs
Andrei Sabelfeld and Heiko Mantel

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

Semantics for Abstract Interpretation-Based Static Analyses of Temporal Properties
Damien Masse

Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation
Charles Hymans

States vs. Traces in Model Checking by Abstract Interpretation
Roberto Giacobazzi and Francesco Ranzato

Reuse of Results in Termination Analysis of Typed Logic Programs
Maurice Bruynooghe, Michael Codish, Samir Genaim, and Wim Vanhoof

Finiteness Analysis in Polynomial Time
Chin Soon Lee