| Publication | Date of Publication | Type |
|---|
| Automated verification of correctness for masked arithmetic programs | 2024-02-01 | Paper |
A theory of change for prioritised resilient and evolvable software systems
Synthese | 2023-12-14 | Paper |
\textsf{CLEVEREST}: accelerating CEGAR-based neural network verification via adversarial attacks
Static Analysis | 2023-07-28 | Paper |
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
1517.68074 | 2022-12-22 | Paper |
| Computing linear arithmetic representation of reachability relation of one-counter automata | 2022-09-01 | Paper |
Learning safe neural network controllers with barrier certificates
Dependable Software Engineering. Theories, Tools, and Applications | 2022-09-01 | Paper |
\textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks
(available as arXiv preprint) | 2022-03-25 | Paper |
Learning safe neural network controllers with barrier certificates
Formal Aspects of Computing | 2021-08-30 | Paper |
Synthesizing barrier certificates using neural networks
Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control | 2021-01-25 | Paper |
Separation logic with linearly compositional inductive predicates and set data constraints
(available as arXiv preprint) | 2020-10-22 | Paper |
| Tractability of separation logic with inductive definitions: beyond lists | 2020-05-27 | Paper |
Bisimulations for fuzzy transition systems revisited
International Journal of Approximate Reasoning | 2018-06-27 | Paper |
Polynomial-time algorithms for computing distances of fuzzy transition systems
Theoretical Computer Science | 2018-05-17 | Paper |
Polynomial-time algorithms for computing distances of fuzzy transition systems
Theoretical Computer Science | 2018-05-17 | Paper |
On the total variation distance of labelled Markov chains
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| Satisfiability of compositional separation logic with tree predicates and data constraints | 2017-09-22 | Paper |
| On the satisfiability of indexed linear temporal logics | 2017-09-12 | Paper |
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control | 2017-05-16 | Paper |
The packing chromatic number of the infinite square lattice is between 13 and 15
Discrete Applied Mathematics | 2017-05-12 | Paper |
The packing chromatic number of the infinite square lattice is between 13 and 15
Discrete Applied Mathematics | 2017-05-12 | Paper |
| On the complexity of computing maximum entropy for Markovian models | 2017-04-25 | Paper |
Solvency Markov decision processes with interest
(available as arXiv preprint) | 2017-02-21 | Paper |
A computationally grounded, weighted doxastic logic
Studia Logica | 2016-09-07 | Paper |
A complete decision procedure for linearly compositional separation logic with data constraints
Automated Reasoning | 2016-09-05 | Paper |
On the axiomatizability of impossible futures
Logical Methods in Computer Science | 2015-10-29 | Paper |
Verification of linear duration properties over continuous-time Markov chains
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Continuous-time orbit problems are decidable in polynomial-time
Information Processing Letters | 2014-10-07 | Paper |
Perturbation analysis in verification of discrete-time Markov chains
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Quantitative verification of implantable cardiac pacemakers over hybrid heart models
Information and Computation | 2014-06-06 | Paper |
Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
Electronic Notes in Theoretical Computer Science | 2014-05-13 | Paper |
On stochastic games with multiple objectives
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| Checking strong open congruence in -calculus | 2013-08-30 | Paper |
| Intensionality of modal logic for robust ambient calculus | 2013-08-27 | Paper |
On the complexity of model checking interval-valued discrete time Markov chains
Information Processing Letters | 2013-03-20 | Paper |
Playing stochastic games precisely
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Model Checking Stochastic Branching Processes
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Automatic verification of competitive stochastic systems
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
A compositional specification theory for component behaviours
Programming Languages and Systems | 2012-06-22 | Paper |
Time-Bounded Verification of CTMCs against Real-Time Specifications
Lecture Notes in Computer Science | 2011-10-07 | Paper |
Observing continuous-time MDPs by 1-clock timed automata
Lecture Notes in Computer Science | 2011-10-07 | Paper |
On the axiomatizability of priority. II
Theoretical Computer Science | 2011-07-07 | Paper |
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Logical Methods in Computer Science | 2011-05-26 | Paper |
Efficient CTMC Model Checking of Linear Real-Time Objectives
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Ready to preorder: the case of weak process semantics
Information Processing Letters | 2010-06-09 | Paper |
On metrics for probabilistic systems: definitions and algorithms
Computers & Mathematics with Applications | 2010-05-16 | Paper |
LTL model checking of time-inhomogeneous Markov chains
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Lecture Notes in Computer Science | 2009-06-03 | Paper |
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
On finite alphabets and infinite bases
Information and Computation | 2008-05-19 | Paper |
On the axiomatisability of priority
Mathematical Structures in Computer Science | 2008-04-10 | Paper |
On the Axiomatizability of Priority
Automata, Languages and Programming | 2007-09-11 | Paper |
On Finite Alphabets and Infinite Bases III: Simulation
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
| On the complete axiomatization for prefix iteration modulo observation congruence | 2006-10-05 | Paper |
Specification and verification for semi-structured data
Wuhan University Journal of Natural Sciences | 2006-05-09 | Paper |
| A framework for modeling autonomy of an agent | 2006-02-16 | Paper |
| Extension of the formal system of the theory of expressions with arities and its strong normalization property | 2006-02-16 | Paper |
| scientific article; zbMATH DE number 2219130 (Why is no real title available?) | 2005-10-27 | Paper |
| scientific article; zbMATH DE number 2219131 (Why is no real title available?) | 2005-10-27 | Paper |
| scientific article; zbMATH DE number 2112436 (Why is no real title available?) | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2070574 (Why is no real title available?) | 2004-06-08 | Paper |
