| Publication | Date of Publication | Type |
|---|
Reasoning about higher-order processes
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
On the decidability of process equivalences for the \(\pi\)-calculus
Algebraic Methodology and Software Technology | 2022-08-16 | Paper |
| Hoare-style logic for unstructured programs | 2021-07-08 | Paper |
| ABS-NET: fully decentralized runtime adaptation for distributed objects | 2021-06-17 | Paper |
ABS-NET: fully decentralized runtime adaptation for distributed objects
(available as arXiv preprint) | 2021-06-17 | Paper |
| Formal verification of integrity-preserving countermeasures against cache storage side-channels | 2019-09-16 | Paper |
Decidability and proof systems for language-based noninterference relations
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2017-08-21 | Paper |
An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes
Electronic Notes in Theoretical Computer Science | 2016-10-07 | Paper |
Security monitor inlining and certification for multithreaded Java
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Machine assisted proof of ARMv7 instruction level isolation properties
Certified Programs and Proofs | 2015-01-13 | Paper |
A data symmetry reduction technique for temporal-epistemic logic
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Provably correct runtime monitoring
The Journal of Logic and Algebraic Programming | 2009-07-20 | Paper |
Decentralized detection of global threshold crossings using aggregation trees
Computer Networks | 2008-06-25 | Paper |
On the secure implementation of security protocols
Science of Computer Programming | 2004-11-22 | Paper |
On global induction mechanisms in aμ-calculus with explicit approximations
RAIRO - Theoretical Informatics and Applications | 2004-03-29 | Paper |
On global induction mechanisms in aμ-calculus with explicit approximations
RAIRO - Theoretical Informatics and Applications | 2004-03-29 | Paper |
| scientific article; zbMATH DE number 1956551 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1956528 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 2020178 (Why is no real title available?) | 2003-01-01 | Paper |
-Calculus with Explicit Points and Approximations
Journal Of Logic And Computation | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1522998 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1318521 (Why is no real title available?) | 1999-08-08 | Paper |
On the decidability of process equivalences for the \(\pi\)-calculus
Theoretical Computer Science | 1998-07-22 | Paper |
Proving properties of dynamic process networks
Information and Computation | 1998-04-02 | Paper |
Model checking mobile processes
Information and Computation | 1996-12-01 | Paper |
Process-Algebraic Interpretations of Positive Linear and Relevant Logics
Journal Of Logic And Computation | 1995-04-20 | Paper |
CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
Theoretical Computer Science | 1994-05-15 | Paper |
\(R\)-generability, and definability in branching time logics
Information Processing Letters | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 3947597 (Why is no real title available?) | 1986-01-01 | Paper |
