| Publication | Date of Publication | Type |
|---|
Cartesian closed categories of domains and the space proj(D)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
The merits of compositional abstraction: a case study in propositional logic
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Linear domains and linear maps
Lecture Notes in Computer Science | 2023-04-28 | Paper |
| Static analysis for proactive security | 2022-02-16 | Paper |
Partial solvers for parity games: effective polynomial-time composition
(available as arXiv preprint) | 2021-12-07 | Paper |
| Partial solvers for parity games: effective polynomial-time composition | 2021-12-07 | Paper |
scientific article; zbMATH DE number 7356850 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-09 | Paper |
| scientific article; zbMATH DE number 7356850 (Why is no real title available?) | 2021-06-09 | Paper |
Secure Multi-party Computation: Information Flow of Outputs and Game Theory
Lecture Notes in Computer Science | 2020-08-03 | Paper |
Optimal Accuracy-Privacy Trade-Off for Secure Computations
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| Mathematical Foundations of Advanced Informatics | 2018-05-28 | Paper |
Refinement sensitive formal semantics of state machines with persistent choice
Electronic Notes in Theoretical Computer Science | 2016-06-06 | Paper |
Static analysis of parity games: alternating reachability under parity
Semantics, Logics, and Calculi | 2016-03-23 | Paper |
The Rabin index of parity games: its complexity and approximation
Information and Computation | 2015-12-07 | Paper |
Polynomial-time under-approximation of winning regions in parity games
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
Falsifying safety properties through games on over-approximating models
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
EXPTIME-complete decision problems for modal and mixed specifications
Electronic Notes in Theoretical Computer Science | 2014-07-23 | Paper |
| Topological analysis of refinement | 2013-12-04 | Paper |
| Efficient patterns for model checking partial state spaces in CTL \(\cap\) LTL | 2013-10-10 | Paper |
| Consistent partial model checking | 2013-10-10 | Paper |
| Automata games for multiple-model checking | 2013-10-08 | Paper |
| Abstraction and probabilities for hybrid logics | 2013-09-20 | Paper |
Model-checking view-based partial specifications
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
Fatal Attractors in Parity Games
Lecture Notes in Computer Science | 2013-03-18 | Paper |
| Verification and refutation of probabilistic specifications via games | 2012-10-24 | Paper |
Modal and mixed specifications: key decision problems and their complexities
Mathematical Structures in Computer Science | 2010-04-01 | Paper |
Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
Fundamentals of Computation Theory | 2009-10-20 | Paper |
| 20 years of modal and mixed specifications. | 2009-09-19 | Paper |
Validation of Stochastic Systems
Lecture Notes in Computer Science | 2009-07-24 | Paper |
On model checking multiple hybrid views
Theoretical Computer Science | 2008-10-07 | Paper |
Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Complexity of Decision Problems for Mixed and Modal Specifications
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
More Precise Partition Abstractions
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Model Checking for Action Abstraction
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Labelled transition systems as a Stone space
Logical Methods in Computer Science | 2007-10-11 | Paper |
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science | 2005-12-29 | Paper |
Refinement is complete for implementations
Formal Aspects of Computing | 2005-12-13 | Paper |
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2090706 (Why is no real title available?) | 2004-08-13 | Paper |
| scientific article; zbMATH DE number 2086523 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1487911 (Why is no real title available?) | 2003-11-24 | Paper |
| Secure Communicating Systems | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1863177 (Why is no real title available?) | 2003-02-03 | Paper |
A comment on the shape of the solution set for systems of interval linear equations with dependent coefficients
Reliable Computing | 2002-04-02 | Paper |
| scientific article; zbMATH DE number 1693039 (Why is no real title available?) | 2002-01-22 | Paper |
Linear types and approximation
MSCS. Mathematical Structures in Computer Science | 2001-08-21 | Paper |
| scientific article; zbMATH DE number 1500661 (Why is no real title available?) | 2001-04-09 | Paper |
Quantitative semantics, topology, and possibility measures
Topology and its Applications | 1999-12-13 | Paper |
On the approximation of denotational mu-semantics
Applied Categorical Structures | 1999-10-05 | Paper |
| scientific article; zbMATH DE number 1231572 (Why is no real title available?) | 1998-12-20 | Paper |
| scientific article; zbMATH DE number 1223625 (Why is no real title available?) | 1998-11-15 | Paper |
| scientific article; zbMATH DE number 956830 (Why is no real title available?) | 1997-04-10 | Paper |
Algebraic domains of natural transformations
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 860034 (Why is no real title available?) | 1996-03-26 | Paper |
Zero dimensional and connected domains
Semigroup Forum | 1996-02-20 | Paper |
A maximal monoidal closed category of distributive algebraic domains
Information and Computation | 1995-04-10 | Paper |
