| Publication | Date of Publication | Type |
|---|
An implicit function theorem for the stream calculus
Logical Methods in Computer Science | 2024-06-27 | Paper |
Products, polynomials and differential equations in the stream calculus
ACM Transactions on Computational Logic | 2024-04-26 | Paper |
Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
| 2024-03-14 | Paper |
Algebra and coalgebra of stream products
| 2023-08-21 | Paper |
Bayesian parameter estimation with guarantees via interval analysis and simulation
Lecture Notes in Computer Science | 2023-08-17 | Paper |
Linearization, model reduction and reachability in nonlinear ODEs
Lecture Notes in Computer Science | 2023-07-21 | Paper |
On the expressiveness of internal mobility in name-passing calculi
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
On the Coalgebra of Partial Differential Equations
| 2022-07-21 | Paper |
Automatic pre- and postconditions for partial differential equations
Information and Computation | 2022-06-08 | Paper |
Weighted approximate Bayesian computation via Sanov's theorem
Computational Statistics | 2022-05-10 | Paper |
Automatic pre- and postconditions for partial differential equations
Quantitative Evaluation of Systems | 2021-12-08 | Paper |
A linear-algebraic method to compute polynomial PDE conservation laws
Journal of Symbolic Computation | 2021-08-05 | Paper |
Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Algebra, coalgebra, and minimization in polynomial differential equations
Logical Methods in Computer Science | 2019-02-25 | Paper |
Algorithms for exact and approximate linear abstractions of polynomial continuous systems
Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) | 2018-12-06 | Paper |
Basic observables for processes
Automata, Languages and Programming | 2018-07-04 | Paper |
A fully abstract semantics for causality in the π-calculus
STACS 95 | 2017-12-04 | Paper |
Algebra, coalgebra, and minimization in polynomial differential equations
Lecture Notes in Computer Science | 2017-05-19 | Paper |
On the complexity of bisimilarity for value-passing processes
Lecture Notes in Computer Science | 2017-01-19 | Paper |
CaSPiS: a calculus of sessions, pipelines and services
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Asymptotic information leakage under one-try attacks
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
A semiring-based trace semantics for processes with applications to information leakage analysis
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Searching secrets rationally
International Journal of Approximate Reasoning | 2015-12-28 | Paper |
Quantitative information flow under generic leakage functions and adaptive adversaries
Logical Methods in Computer Science | 2015-11-25 | Paper |
Analysis of Probabilistic Systems via Generating Functions and Padé Approximation
Automata, Languages, and Programming | 2015-11-04 | Paper |
Worst- and average-case privacy breaches in randomization mechanisms
Theoretical Computer Science | 2015-08-17 | Paper |
Asymptotic risk analysis for trust and reputation systems
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Behavioural contracts with request-response operations
Science of Computer Programming | 2013-06-06 | Paper |
Worst- and average-case privacy breaches in randomization mechanisms
Lecture Notes in Computer Science | 2012-09-21 | Paper |
A coalgebraic perspective on linear weighted automata
Information and Computation | 2012-05-24 | Paper |
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation | 2012-05-24 | Paper |
Quantitative information flow, with a view
Computer Security – ESORICS 2011 | 2011-11-22 | Paper |
Asymptotic information leakage under one-try attacks
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
A semiring-based trace semantics for processes with applications to information leakage analysis
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
Spatial and behavioral types in the pi-calculus
Information and Computation | 2010-10-07 | Paper |
On the relationship between spatial logics and behavioral simulations
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
Automata, Languages and Programming | 2009-07-14 | Paper |
Quantifying information leakage in process calculi
Information and Computation | 2009-06-11 | Paper |
A Typed Calculus for Querying Distributed XML Documents
Trustworthy Global Computing | 2009-03-05 | Paper |
Responsiveness in process calculi
Theoretical Computer Science | 2008-12-12 | Paper |
Spatial and Behavioral Types in the Pi-Calculus
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Type Abstractions of Name-Passing Processes
Lecture Notes in Computer Science | 2008-07-01 | Paper |
A Type System for Client Progress in a Service-Oriented Calculus
Concurrency, Graphs and Models | 2008-06-19 | Paper |
XPi: a typed process calculus for XML messaging
Science of Computer Programming | 2008-05-19 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Quantifying Information Leakage in Process Calculi
Automata, Languages and Programming | 2007-09-11 | Paper |
A Concurrent Calculus with Atomic Transactions
Programming Languages and Systems | 2007-09-04 | Paper |
Trustworthy Global Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Processes as formal power series: a coinductive approach to denotational semantics
Theoretical Computer Science | 2006-09-14 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-08-17 | Paper |
A method for symbolic analysis of security protocols
Theoretical Computer Science | 2005-06-30 | Paper |
scientific article; zbMATH DE number 2087423 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1927581 (Why is no real title available?)
| 2003-06-12 | Paper |
Trace and testing equivalence on asynchronous processes
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1754628 (Why is no real title available?)
| 2002-06-12 | Paper |
Proof techniques for cryptographic processes
SIAM Journal on Computing | 2002-04-23 | Paper |
Divergence in testing and readiness semantics
Theoretical Computer Science | 2002-03-03 | Paper |
A complexity analysis of bisimilarity for value-passing processes
Theoretical Computer Science | 2000-08-21 | Paper |
Basic observables for processes
Information and Computation | 2000-01-12 | Paper |
A fully abstract semantics for causality in the \(\pi\)-calculus
Acta Informatica | 1999-03-14 | Paper |
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science | 1999-01-20 | Paper |
Some congruence properties for \(\pi\)-calculus bisimilarities
Theoretical Computer Science | 1998-08-13 | Paper |
A symbolic semantics for the \(\pi\)-calculus
Information and Computation | 1997-01-02 | Paper |
Testing equivalence for mobile processes
Information and Computation | 1995-09-17 | Paper |
Complete sets of axioms for finite basic LOTOS behavioural equivalences
Information Processing Letters | 1993-01-16 | Paper |
