| 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 | 2023-12-14 | Paper |
| \textsf{CLEVEREST}: accelerating CEGAR-based neural network verification via adversarial attacks | 2023-07-28 | Paper |
| A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type | 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 | 2022-09-01 | Paper |
| \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks | 2022-03-25 | Paper |
| Learning safe neural network controllers with barrier certificates | 2021-08-30 | Paper |
| Synthesizing barrier certificates using neural networks | 2021-01-25 | Paper |
| Separation logic with linearly compositional inductive predicates and set data constraints | 2020-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111651 | 2020-05-27 | Paper |
| Bisimulations for fuzzy transition systems revisited | 2018-06-27 | Paper |
| Polynomial-time algorithms for computing distances of fuzzy transition systems | 2018-05-17 | Paper |
| On the total variation distance of labelled Markov chains | 2018-04-23 | Paper |
| Satisfiability of compositional separation logic with tree predicates and data constraints | 2017-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357708 | 2017-09-12 | Paper |
| Verification of linear duration properties over continuous-time markov chains | 2017-05-16 | Paper |
| The packing chromatic number of the infinite square lattice is between 13 and 15 | 2017-05-12 | Paper |
| On the complexity of computing maximum entropy for Markovian Models | 2017-04-25 | Paper |
| Solvency Markov Decision Processes with Interest | 2017-02-21 | Paper |
| A computationally grounded, weighted doxastic logic | 2016-09-07 | Paper |
| A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints | 2016-09-05 | Paper |
| On the Axiomatizability of Impossible Futures | 2015-10-29 | Paper |
| Verification of linear duration properties over continuous-time markov chains | 2015-09-17 | Paper |
| Continuous-time orbit problems are decidable in polynomial-time | 2014-10-07 | Paper |
| Perturbation Analysis in Verification of Discrete-Time Markov Chains | 2014-09-15 | Paper |
| Quantitative verification of implantable cardiac pacemakers over hybrid heart models | 2014-06-06 | Paper |
| Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration | 2014-05-13 | Paper |
| On Stochastic Games with Multiple Objectives | 2013-09-20 | Paper |
| Checking strong open congruence in \(\chi\)-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 | 2013-03-20 | Paper |
| Playing Stochastic Games Precisely | 2012-09-25 | Paper |
| Model Checking Stochastic Branching Processes | 2012-09-25 | Paper |
| Automatic Verification of Competitive Stochastic Systems | 2012-06-29 | Paper |
| A Compositional Specification Theory for Component Behaviours | 2012-06-22 | Paper |
| Time-Bounded Verification of CTMCs against Real-Time Specifications | 2011-10-07 | Paper |
| Observing Continuous-Time MDPs by 1-Clock Timed Automata | 2011-10-07 | Paper |
| On the axiomatizability of priority. II | 2011-07-07 | Paper |
| Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications | 2011-05-26 | Paper |
| Efficient CTMC Model Checking of Linear Real-Time Objectives | 2011-05-19 | Paper |
| Ready to preorder: the case of weak process semantics | 2010-06-09 | Paper |
| On metrics for probabilistic systems: definitions and algorithms | 2010-05-16 | Paper |
| LTL Model Checking of Time-Inhomogeneous Markov Chains | 2009-12-01 | Paper |
| Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata | 2009-06-03 | Paper |
| On Finite Bases for Weak Semantics: Failures Versus Impossible Futures | 2009-02-03 | Paper |
| Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems | 2008-09-18 | Paper |
| On finite alphabets and infinite bases | 2008-05-19 | Paper |
| On the axiomatisability of priority | 2008-04-10 | Paper |
| On the Axiomatizability of Priority | 2007-09-11 | Paper |
| On Finite Alphabets and Infinite Bases III: Simulation | 2007-09-04 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5491512 | 2006-10-05 | Paper |
| Specification and verification for semi-structured data | 2006-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3366964 | 2006-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3366962 | 2006-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5697794 | 2005-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5697792 | 2005-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823944 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4466829 | 2004-06-08 | Paper |
