Bit-Precise Procedure-Modular Termination Analysis. | 0 | 0.34 | 2018 |
Sound static deadlock analysis for C/Pthreads. | 3 | 0.39 | 2016 |
Sound Static Deadlock Analysis for C/Pthreads (Extended Version). | 1 | 0.35 | 2016 |
Synthesising Interprocedural Bit-Precise Termination Proofs (extended version) | 1 | 0.35 | 2015 |
Synthesising Interprocedural Bit-Precise Termination Proofs (T) | 10 | 0.50 | 2015 |
Verifying synchronous reactive systems using lazy abstraction | 1 | 0.36 | 2015 |
Stability and Complexity of Minimising Probabilistic Automata. | 4 | 0.42 | 2014 |
Algorithmic probabilistic game semantics - Playing games with automata. | 2 | 0.37 | 2013 |
On the Complexity of Equivalence and Minimisation for Q-weighted Automata | 8 | 0.52 | 2013 |
On the Complexity of Equivalence and Minimisation for Q-weighted Automata | 0 | 0.34 | 2013 |
Verifying multi-threaded software with impact | 21 | 0.92 | 2013 |
Three tokens in Herman’s algorithm | 3 | 0.46 | 2012 |
Improving the Precision of WCET Analysis by Input Constraints and Model-Derived Flow Constraints. | 2 | 0.40 | 2012 |
Variable probabilistic abstraction refinement | 2 | 0.38 | 2012 |
APEX: an analyzer for open probabilistic programs | 4 | 0.44 | 2012 |
On the complexity of the equivalence problem for probabilistic automata | 6 | 0.50 | 2012 |
Language equivalence for probabilistic automata | 21 | 0.97 | 2011 |
Probabilistic Logical Characterization | 20 | 0.66 | 2011 |
PASS: abstraction refinement for infinite probabilistic models | 15 | 0.68 | 2010 |
PARAM: a model checker for parametric markov models | 54 | 1.52 | 2010 |
Best probabilistic transformers | 14 | 0.63 | 2010 |
Static timing analysis for hard real-time systems | 12 | 0.63 | 2010 |
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains | 5 | 0.46 | 2009 |
Improving Timing Analysis for Matlab Simulink/Stateflow. | 0 | 0.34 | 2009 |
Symbolic state traversal for WCET analysis | 5 | 0.52 | 2009 |
INFAMY: An Infinite-State Markov Model Checker | 14 | 0.73 | 2009 |
Abstract Interpretation with Applications to Timing Validation | 11 | 0.62 | 2008 |
Time-bounded model checking of infinite-state continuous-time Markov chains | 2 | 0.45 | 2008 |
Towards Symbolic State Traversal for Efficient WCET Analysis of Abstract Pipeline and Cache Models | 1 | 0.38 | 2007 |
The Spotlight Principle | 11 | 0.60 | 2007 |
A Definition and Classification of Timing Anomalies | 73 | 3.53 | 2006 |
Explaining Data Type Reduction in the Shape Analysis Framework | 0 | 0.34 | 2006 |