| Publication | Date of Publication | Type |
|---|
| Causal reversibility implies time reversibility | 2024-05-29 | Paper |
| A Process Algebra for (Delimited) Persistent Stochastic Non-Interference | 2024-03-14 | Paper |
| Reverse bisimilarity vs. forward bisimilarity | 2023-11-24 | Paper |
| Biased Processor Sharing in Fork-Join Queues | 2023-06-28 | Paper |
| Proportional lumpability and proportional bisimilarity | 2022-05-17 | Paper |
| Reasoning about proportional lumpability | 2022-03-24 | Paper |
| scientific article; zbMATH DE number 7447774 (Why is no real title available?) | 2021-12-17 | Paper |
| A Matlab toolkit for the analysis of two-level processor sharing queues | 2021-12-08 | Paper |
| Persistent stochastic non-interference | 2021-10-25 | Paper |
| \textit{D\_PSNI}: delimited persistent stochastic non-interference | 2021-08-27 | Paper |
| Proportional lumpability | 2020-05-05 | Paper |
| Aggregation and truncation of reversible Markov chains modulo state renaming | 2018-10-23 | Paper |
| Applying reversibility theory for the performance evaluation of reversible computations | 2018-07-06 | Paper |
| Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses | 2018-05-30 | Paper |
| Dynamic control of the join-queue lengths in saturated fork-join stations | 2018-01-11 | Paper |
| Termination of simply moded logic programs with dynamic scheduling | 2017-07-12 | Paper |
| Quantitative Analysis of Concurrent Reversible Computations | 2015-09-14 | Paper |
| Operational semantics for reexecution-based analysis of logic programs with delay declarations | 2013-05-24 | Paper |
| Transforming processes to check and ensure information flow security | 2011-05-06 | Paper |
| A proof system for information flow security | 2011-03-04 | Paper |
| A calculus for power-aware multicast communications in ad hoc networks | 2010-10-27 | Paper |
| Context-sensitive equivalences for non-interference based protocol analysis. | 2010-04-20 | Paper |
| Information flow security and recursive systems. | 2010-02-23 | Paper |
| Action Refinement in Process Algebra and Security Issues | 2009-01-22 | Paper |
| Unwinding Conditions for Security in Imperative Languages | 2008-04-24 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Controlling information release in the \(\pi\)-calculus | 2007-08-23 | Paper |
| Trustworthy Global Computing | 2006-11-01 | Paper |
| Program Development in Computational Logic | 2005-12-23 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| Verifying persistent security properties | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2086504 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2084360 (Why is no real title available?) | 2004-08-06 | Paper |
| On modular termination proofs of general logic programs | 2004-03-01 | Paper |
| Sequence-based abstract interpretation of Prolog | 2004-03-01 | Paper |
| Properties of Input-Consuming Derivations | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 1953033 (Why is no real title available?) | 2003-07-25 | Paper |
| Semantics of well-moded input consuming logic programs | 2002-03-19 | Paper |
| scientific article; zbMATH DE number 1696796 (Why is no real title available?) | 2002-01-28 | Paper |
| scientific article; zbMATH DE number 1692954 (Why is no real title available?) | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1497819 (Why is no real title available?) | 2001-03-05 | Paper |
| Automated verification of Prolog programs | 1999-11-01 | Paper |
| scientific article; zbMATH DE number 516993 (Why is no real title available?) | 1994-03-17 | Paper |
