| Publication | Date of Publication | Type |
|---|
| Language inclusion algorithms as complete abstract interpretations | 2024-04-19 | Paper |
| Robustness verification of support vector machines | 2024-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134251 | 2023-08-21 | Paper |
| Local completeness logic on Kleene algebra with tests | 2023-07-28 | Paper |
| Invertible linear transforms of numerical abstract domains | 2023-05-26 | Paper |
| Program analysis is harder than verification: a computability perspective | 2023-05-05 | Paper |
| Intensional Kleene and Rice theorems for abstract program semantics | 2022-12-08 | Paper |
| Complete Abstractions for Checking Language Inclusion | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089296 | 2022-07-18 | Paper |
| On Constructivity of Galois Connections | 2020-07-07 | Paper |
| Abstracting Nash equilibria of supermodular games | 2018-10-04 | Paper |
| Abstract interpretation of supermodular games | 2018-08-27 | Paper |
| Refining and compressing abstract domains | 2018-07-04 | Paper |
| A new characterization of complete Heyting and co-Heyting algebras | 2017-10-12 | Paper |
| Making abstract domains condensing | 2017-07-12 | Paper |
| Complementing logic program semantics | 2017-01-19 | Paper |
| Analyzing program analyses | 2016-09-29 | Paper |
| Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions | 2015-09-17 | Paper |
| Complete Abstractions Everywhere | 2014-11-03 | Paper |
| Correctness kernels of abstract interpretations | 2014-07-18 | Paper |
| An efficient simulation algorithm on Kripke structures | 2014-06-12 | Paper |
| Tracing compilation by abstract interpretation | 2014-04-10 | Paper |
| An efficient simulation algorithm on Kripke structures | 2013-09-20 | Paper |
| Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation | 2012-09-27 | Paper |
| Saving space in a time efficient simulation algorithm | 2012-07-04 | Paper |
| A Spectrum of Behavioral Relations over LTSs on Probability Distributions | 2011-09-02 | Paper |
| Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation | 2011-07-07 | Paper |
| Example-Guided Abstraction Simplification | 2010-09-07 | Paper |
| Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming | 2010-07-20 | Paper |
| An efficient simulation algorithm based on abstract interpretation | 2010-01-12 | Paper |
| Computing Stuttering Simulations | 2009-10-22 | Paper |
| Generalizing the Paige-Tarjan algorithm by abstract interpretation | 2008-05-19 | Paper |
| Making abstract interpretations complete | 2008-05-05 | Paper |
| A Forward-Backward Abstraction Refinement Algorithm | 2008-04-04 | Paper |
| Programming Languages and Systems | 2007-09-28 | Paper |
| Generalized Strong Preservation by Abstract Interpretation | 2007-05-14 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2007-02-12 | Paper |
| Programming Languages and Systems | 2006-10-20 | Paper |
| Incompleteness of states w.r.t. traces in model checking | 2006-06-09 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Correction to ``Some properties of complete congruence lattices. | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411978 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411975 | 2003-07-13 | Paper |
| Closures on CPOs form complete lattices | 2003-01-14 | Paper |
| A counterexample to a result concerning closure operators | 2002-10-27 | Paper |
| Pseudocomplements of closure operators on posets | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763671 | 2002-01-21 | Paper |
| Some properties of complete congruence lattices | 2000-02-27 | Paper |
| On the least complete extension of complete subsemilattices | 2000-02-27 | Paper |
| The powerset operator on abstract interpretations | 2000-01-12 | Paper |
| Optimal domains for disjunctive abstract interpretation | 2000-01-04 | Paper |
| The reduced relative power operation on abstract domains | 1999-04-28 | Paper |
| Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements | 1999-01-13 | Paper |
| Weak relative pseudo-complements of closure operators | 1998-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217930 | 1998-11-11 | Paper |
