| Publication | Date of Publication | Type |
|---|
The reachable simulation problem
ACM Transactions on Computational Logic | 2025-08-22 | Paper |
A correctness and incorrectness program logic
Journal of the ACM | 2025-02-05 | Paper |
| Language inclusion algorithms as complete abstract interpretations | 2024-04-19 | Paper |
| Robustness verification of support vector machines | 2024-04-19 | Paper |
| scientific article; zbMATH DE number 7730605 (Why is no real title available?) | 2023-08-21 | Paper |
Local completeness logic on Kleene algebra with tests
Static Analysis | 2023-07-28 | Paper |
Local completeness logic on Kleene algebra with tests
Static Analysis | 2023-07-28 | Paper |
Invertible linear transforms of numerical abstract domains
Static Analysis | 2023-05-26 | Paper |
Program analysis is harder than verification: a computability perspective
Computer Aided Verification | 2023-05-05 | Paper |
Intensional Kleene and Rice theorems for abstract program semantics
Information and Computation | 2022-12-08 | Paper |
Complete Abstractions for Checking Language Inclusion
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7559486 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
On constructivity of Galois connections
Lecture Notes in Computer Science | 2020-07-07 | Paper |
On constructivity of Galois connections
Lecture Notes in Computer Science | 2020-07-07 | Paper |
Abstracting Nash equilibria of supermodular games
Formal Methods in System Design | 2018-10-04 | Paper |
Abstract interpretation of supermodular games
(available as arXiv preprint) | 2018-08-27 | Paper |
Refining and compressing abstract domains
Automata, Languages and Programming | 2018-07-04 | Paper |
A new characterization of complete Heyting and co-Heyting algebras
(available as arXiv preprint) | 2017-10-12 | Paper |
Making abstract domains condensing
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Complementing logic program semantics
Algebraic and Logic Programming | 2017-01-19 | Paper |
Analyzing program analyses
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Logical characterizations of behavioral relations on transition systems of probability distributions
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Complete abstractions everywhere
Lecture Notes in Computer Science | 2014-11-03 | Paper |
Correctness kernels of abstract interpretations
Information and Computation | 2014-07-18 | Paper |
An efficient simulation algorithm on Kripke structures
Acta Informatica | 2014-06-12 | Paper |
Tracing compilation by abstract interpretation
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
A more efficient simulation algorithm on Kripke structures
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
Formal Methods in System Design | 2012-09-27 | Paper |
Saving space in a time efficient simulation algorithm
Fundamenta Informaticae | 2012-07-04 | Paper |
A spectrum of behavioral relations over LTSs on probability distributions
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Probabilistic bisimulation and simulation algorithms by abstract interpretation
Automata, Languages and Programming | 2011-07-07 | Paper |
Example-guided abstraction simplification
Automata, Languages and Programming | 2010-09-07 | Paper |
Static analysis, abstract interpretation and verification in (constraint logic) programming
Lecture Notes in Computer Science | 2010-07-20 | Paper |
An efficient simulation algorithm based on abstract interpretation
Information and Computation | 2010-01-12 | Paper |
Computing Stuttering Simulations
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Generalizing the Paige-Tarjan algorithm by abstract interpretation
Information and Computation | 2008-05-19 | Paper |
Making abstract interpretations complete
Journal of the ACM | 2008-05-05 | Paper |
A Forward-Backward Abstraction Refinement Algorithm
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Generalized Strong Preservation by Abstract Interpretation
Journal Of Logic And Computation | 2007-05-14 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Incompleteness of states w.r.t. traces in model checking
Information and Computation | 2006-06-09 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Correction to ``Some properties of complete congruence lattices''.
Algebra Universalis | 2005-04-19 | Paper |
| scientific article; zbMATH DE number 1948413 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1948410 (Why is no real title available?) | 2003-07-13 | Paper |
Closures on CPOs form complete lattices
Information and Computation | 2003-01-14 | Paper |
A counterexample to a result concerning closure operators
Portugaliae Mathematica. Nova Série | 2002-10-27 | Paper |
Pseudocomplements of closure operators on posets
Discrete Mathematics | 2002-05-28 | Paper |
| scientific article; zbMATH DE number 1692938 (Why is no real title available?) | 2002-01-21 | Paper |
Some properties of complete congruence lattices
Algebra Universalis | 2000-02-27 | Paper |
On the least complete extension of complete subsemilattices
Algebra Universalis | 2000-02-27 | Paper |
The powerset operator on abstract interpretations
Theoretical Computer Science | 2000-01-12 | Paper |
Optimal domains for disjunctive abstract interpretation
Science of Computer Programming | 2000-01-04 | Paper |
The reduced relative power operation on abstract domains
Theoretical Computer Science | 1999-04-28 | Paper |
Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
Information and Computation | 1999-01-13 | Paper |
Weak relative pseudo-complements of closure operators
Algebra Universalis | 1998-11-24 | Paper |
| scientific article; zbMATH DE number 1222407 (Why is no real title available?) | 1998-11-11 | Paper |
