Publication | Date of Publication | Type |
---|
A Foundation of Escape Analysis* | 2011-05-06 | Paper |
Boolean Functions for Finite-Tree Dependencies | 2011-05-06 | Paper |
Exact join detection for convex polyhedra and other numerical abstractions | 2010-03-11 | Paper |
Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness | 2010-02-05 | Paper |
Applications of polyhedral computations to the analysis and verification of hardware and software systems | 2009-11-04 | Paper |
Verification, Model Checking, and Abstract Interpretation | 2009-05-15 | Paper |
An Improved Tight Closure Algorithm for Integer Octagonal Constraints | 2008-04-04 | Paper |
Grids: A Domain for Analyzing the Distribution of Numerical Values | 2007-09-10 | Paper |
Deriving escape analysis by abstract interpretation | 2007-01-05 | Paper |
Static Analysis | 2006-10-31 | Paper |
Finite-tree analysis for constraint logic-based languages | 2006-03-07 | Paper |
Not necessarily closed convex polyhedra and the double description method | 2005-12-13 | Paper |
Precise widening operators for convex polyhedra | 2005-10-10 | Paper |
Enhanced sharing analysis techniques: a comprehensive evaluation | 2005-04-29 | Paper |
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages | 2005-04-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4813407 | 2004-08-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4736994 | 2004-08-11 | Paper |
Logic programs as compact denotations. | 2004-03-14 | Paper |
Soundness, idempotence and commutativity of set-sharing | 2004-03-01 | Paper |
Decomposing non-redundant sharing by complementation | 2004-03-01 | Paper |
Verifying termination and error-freedom of logic programs with block declarations | 2004-03-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4415118 | 2003-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4411960 | 2003-07-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4778701 | 2002-11-19 | Paper |
Generalizing Def and Pos to Type Analysis | 2002-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q2766780 | 2002-07-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q2767017 | 2002-07-22 | Paper |
Set-sharing is redundant for pair-sharing | 2002-07-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q2767173 | 2002-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q2723918 | 2001-07-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4494374 | 2001-03-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4494375 | 2001-03-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4518879 | 2000-12-03 | Paper |
A comparative study of eight constraint programming languages over the Boolean and finite domains | 2000-09-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4494373 | 2000-08-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4844168 | 1995-08-21 | Paper |
Supporting Transformations for the Partial Evaluation of Logic Programs | 1994-12-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4282517 | 1994-03-17 | Paper |
Properties of a Pruning Operator | 1990-01-01 | Paper |
On the T(q)-conditions of small cancellation theory | 1985-01-01 | Paper |
A residual property of free groups | 1983-01-01 | Paper |