| Publication | Date of Publication | Type |
|---|
| Utility-preserving privacy mechanisms for counting queries | 2024-02-23 | Paper |
| CONCUR Test-Of-Time Award 2021 (Invited Paper) | 2023-08-21 | Paper |
| Linear constraint systems as high-level nets | 2023-06-28 | Paper |
| Confluence in concurrent constraint programming | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089267 | 2022-07-18 | Paper |
| Establishing the price of privacy in federated data trading | 2022-07-13 | Paper |
| PRIVIC: A privacy-preserving method for incremental collection of location data | 2022-06-21 | Paper |
| An incentive mechanism for trading personal data in data markets | 2022-03-31 | Paper |
| Proving correctness of Constraint Logic Programs with dynamic scheduling | 2022-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992520 | 2021-06-09 | Paper |
| Slicing concurrent constraint programs | 2021-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986260 | 2021-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5858725 | 2021-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5858727 | 2021-04-14 | Paper |
| Enhanced models for privacy and utility in continuous-time diffusion networks | 2019-12-12 | Paper |
| Leakage and protocol composition in a game-theoretic perspective | 2019-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608688 | 2018-03-21 | Paper |
| Abstract interpretation of temporal concurrent constraint programs | 2017-11-09 | Paper |
| Information leakage games | 2017-10-27 | Paper |
| Slicing concurrent constraint programs | 2017-10-13 | Paper |
| On the Compositionality of Quantitative Information Flow | 2017-10-12 | Paper |
| Quantifying leakage in the presence of unreliable sources of information | 2017-06-30 | Paper |
| Compositional methods for information-hiding | 2017-04-04 | Paper |
| Preserving differential privacy under finite-precision semantics | 2017-02-06 | Paper |
| Quantitative Notions of Leakage for One-try Attacks | 2016-05-10 | Paper |
| On the generalized dining philosophers problem | 2016-03-04 | Paper |
| Location Privacy via Geo-Indistinguishability | 2016-02-25 | Paper |
| A Declarative View of Signaling Pathways | 2016-01-08 | Paper |
| Epistemic Strategies and Games on Concurrent Processes | 2015-09-17 | Paper |
| Generalized Bisimulation Metrics | 2014-09-15 | Paper |
| Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms | 2014-06-02 | Paper |
| Fair Π | 2013-12-13 | Paper |
| Weak Probabilistic Anonymity | 2013-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852344 | 2013-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852065 | 2013-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852102 | 2013-10-07 | Paper |
| A Differentially Private Mechanism of Optimal Utility for a Region of Priors | 2013-08-06 | Paper |
| Spatial and Epistemic Modalities in Constraint-Based Process Calculi | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224080 | 2012-03-29 | Paper |
| Quantitative Information Flow and Applications to Differential Privacy | 2011-09-16 | Paper |
| Information hiding in probabilistic concurrent systems | 2011-07-07 | Paper |
| On the Relation between Differential Privacy and Quantitative Information Flow | 2011-07-07 | Paper |
| Deriving Labels and Bisimilarity for Concurrent Constraint Programming | 2011-05-19 | Paper |
| Entropy and Attack Models in Information Flow | 2010-10-27 | Paper |
| Safe Equivalences for Security Properties | 2010-10-27 | Paper |
| Information Flow in Interactive Systems | 2010-08-31 | Paper |
| Concurrent and Reactive Constraint Programming | 2010-07-20 | Paper |
| Making random choices invisible to the scheduler | 2010-06-25 | Paper |
| A quantitative doxastic logic for probabilistic processes and applications to information-hiding | 2010-03-10 | Paper |
| Probabilistic and nondeterministic aspects of anonymity | 2009-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396569 | 2009-09-19 | Paper |
| Explicit fairness in testing semantics | 2009-06-30 | Paper |
| Anonymity Protocols as Noisy Channels | 2009-03-05 | Paper |
| Declarative Diagnosis of Temporal Concurrent Constraint Programs | 2009-03-05 | Paper |
| Making Random Choices Invisible to the Scheduler | 2008-09-18 | Paper |
| On Recursion, Replication and Scope Mechanisms in Process Calculi | 2008-09-17 | Paper |
| On the Asynchronous Nature of the Asynchronous π-Calculus | 2008-06-19 | Paper |
| A Probabilistic Applied Pi–Calculus | 2008-05-15 | Paper |
| Anonymity protocols as noisy channels | 2008-04-16 | Paper |
| Compositional Methods for Information-Hiding | 2008-04-11 | Paper |
| A Declarative Framework for Security: Secure Concurrent Constraint Programming | 2008-03-11 | Paper |
| Separation of synchronous and asynchronous communication via testing | 2007-12-19 | Paper |
| Tutorial on separation results in process calculi via leader election problems | 2007-12-18 | Paper |
| A framework for analyzing probabilistic protocols and its application to the partial secrets exchange | 2007-12-14 | Paper |
| Separation Results Via Leader Election Problems | 2007-09-11 | Paper |
| Axiomatizations for probabilistic finite-state behaviors | 2007-04-13 | Paper |
| Probable innocence revisited | 2007-01-09 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| Trustworthy Global Computing | 2006-11-01 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| A randomized encoding of the \(\pi\)-calculus with mixed choice | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475640 | 2004-08-09 | Paper |
| Encoding transition systems in sequent calculus | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150207 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537501 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767080 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736349 | 2001-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723928 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508299 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222839 | 1998-12-14 | Paper |
| Weak relative pseudo-complements of closure operators | 1998-11-24 | Paper |
| Confluence in concurrent constraint programming | 1998-07-22 | Paper |
| Constraint logic programming with dynamic scheduling: A semantics based on closure operators | 1997-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353603 | 1997-09-10 | Paper |
| An algebraic perspective of constraint logic programming | 1997-04-21 | Paper |
| Nondeterminism and infinite computations in constraint programming | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878772 | 1996-05-14 | Paper |
| Negation as instantiation | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858578 | 1995-12-17 | Paper |
| A declarative approach for first-order built-in's of Prolog | 1994-07-04 | Paper |
| Embedding as a tool for language comparison | 1994-03-10 | Paper |
| A model-theoretic reconstruction of the operational semantics of logic programs | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038706 | 1993-05-18 | Paper |
| From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic | 1992-09-27 | Paper |
| Semantic models for concurrent logic languages | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975139 | 1992-06-26 | Paper |
| Kernel-LEAF: A logic plus functional language | 1991-01-01 | Paper |
| Comments on “logic programming with equations” | 1991-01-01 | Paper |
| Declarative modeling of the operational behavior of logic languages | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205425 | 1989-01-01 | Paper |
| Contributions to the semantics of logic perpetual processes | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742694 | 1986-01-01 | Paper |
| A synchronization logic: Axiomatics and formal semantics of generalized horn clauses | 1984-01-01 | Paper |
