32 citations · 35 across the 6 of their papers we have counts for
6 papers
Sound Static Deadlock Analysis for C/Pthreads (Extended Version)
Daniel Kroening, Daniel Poetzl, Peter Schrammel +1
We present a static deadlock analysis approach for C/pthreads. The design of our method has been guided by the requirement to analyse real-world code. Our approach is sound (i.e.,…
Synthesising Interprocedural Bit-Precise Termination Proofs (extended version)
Hong-Yi Chen, Cristina David, Daniel Kroening +2
Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. T…
AbPress: Flexing Partial-Order Reduction and Abstraction
Daniel Kroening, Subodh Sharma, Björn Wachter
Partial-order reduction (POR) and lazy abstraction with interpolants are two complementary techniques that have been successfully employed to make model checking tools for concurre…
Stability and Complexity of Minimising Probabilistic Automata
Stefan Kiefer, Björn Wachter
We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, wi…
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Stefan Kiefer, Andrzej Murawski, Joel Ouaknine +2
This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers. We use polynomial…
On the Complexity of the Equivalence Problem for Probabilistic Automata
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine +2
Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic sy…