| Incremental Closure for Systems of Two Variables Per Inequality. | 0 | 0.34 | 2019 |
| Shape Analysis with Connectors. | 0 | 0.34 | 2015 |
| Optimal inference of fields in row-polymorphic records | 0 | 0.34 | 2014 |
| Synthesizing Predicates from Abstract Domain Losses. | 1 | 0.38 | 2014 |
| The GDSL toolkit: Generating Frontends for the Analysis of Machine Code | 2 | 0.39 | 2014 |
| The Undefined Domain: Precise Relational Information for Entities That Do Not Exist. | 1 | 0.36 | 2013 |
| FESA: fold- and expand-based shape analysis | 3 | 0.42 | 2013 |
| Deriving a complete type inference for Hindley-Milner and vector sizes using expansion. | 4 | 0.47 | 2013 |
| GDSL: A Universal Toolkit for Giving Semantics to Machine Language. | 2 | 0.37 | 2013 |
| Widening as Abstract Domain. | 2 | 0.36 | 2013 |
| GDSL: A Generic Decoder Specification Language for Interpreting Machine Language | 5 | 0.48 | 2012 |
| Summarized Dimensions Revisited | 3 | 0.40 | 2012 |
| Inferring definite counterexamples through under-approximation | 7 | 0.48 | 2012 |
| Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051). | 4 | 0.41 | 2012 |
| The two variable per inequality abstract domain | 7 | 0.56 | 2010 |
| Simple and precise widenings for H-polyhedra | 2 | 0.39 | 2010 |
| A Note on the Inversion Join for Polyhedral Analysis | 0 | 0.34 | 2010 |
| Speeding up Polyhedral Analysis by Identifying Common Constraints | 1 | 0.37 | 2010 |
| Splitting the Control Flow with Boolean Flags | 7 | 0.44 | 2008 |
| Taming the wrapping of integer arithmetic | 20 | 0.83 | 2007 |
| Widening polyhedra with landmarks | 19 | 0.76 | 2006 |
| Exploiting sparsity in polyhedral analysis | 17 | 0.91 | 2005 |
| Convex Hull Of Planar H-Polyhedra | 1 | 0.35 | 2004 |
| Two variables per linear inequality as an abstract domain | 60 | 2.84 | 2002 |
