Ralf Wimmer
Ralf Wimmer
Albert-Ludwigs-Universität Freiburg, Germany and Concept Engineering GmbH, Freiburg, Germany
Verified email at informatik.uni-freiburg.de - Homepage
TitleCited byYear
Sigref – a symbolic bisimulation tool box
R Wimmer, M Herbstritt, H Hermanns, K Strampp, B Becker
Automated Technology for Verification and Analysis, 477-492, 2006
652006
Compositional dependability evaluation for STATEMATE
E Böde, M Herbstritt, H Hermanns, S Johr, T Peikenkamp, R Pulungan, ...
Software Engineering, IEEE Transactions on 35 (2), 274-292, 2009
522009
DTMC model checking by SCC reduction
E Abrahám, N Jansen, R Wimmer, JP Katoen, B Becker
2010 Seventh International Conference on the Quantitative Evaluation of …, 2010
472010
Accelerating parametric probabilistic verification
N Jansen, F Corzilius, M Volk, R Wimmer, E Ábrahám, JP Katoen, ...
International Conference on Quantitative Evaluation of Systems, 404-420, 2014
422014
Counterexample generation for discrete-time Markov chains using bounded model checking
R Wimmer, B Braitling, B Becker
Verification, Model Checking, and Abstract Interpretation, 366-380, 2009
412009
A model checker for AADL
M Bozzano, A Cimatti, JP Katoen, VY Nguyen, T Noll, M Roveri, ...
International Conference on Computer Aided Verification, 562-565, 2010
402010
Compositional performability evaluation for statemate
E Bode, M Herbstritt, H Hermanns, S Johr, T Peikenkamp, R Pulungan, ...
Quantitative Evaluation of Systems, 2006. QEST 2006. Third International …, 2006
402006
Minimal Critical Subsystems for Discrete-Time Markov Models
R Wimmer, N Jansen, E Ábrahám, B Becker, JP Katoen
Proceedings of TACAS 2012, 2012
382012
BDDs in a branch and cut framework
B Becker, M Behle, F Eisenbrand, R Wimmer
International Workshop on Experimental and Efficient Algorithms, 452-463, 2005
322005
Equivalence checking of partial designs using dependency quantified Boolean formulae
K Gitina, S Reimer, M Sauer, R Wimmer, C Scholl, B Becker
2013 IEEE 31st International Conference on Computer Design (ICCD), 396-403, 2013
302013
Towards Verification of Artificial Neural Networks
K Scheibler, L Winterer, R Wimmer, B Becker
Proc. of MBMV, 2015
292015
Counterexample generation for discrete-time markov models: An introductory survey
E Ábrahám, B Becker, C Dehnert, N Jansen, JP Katoen, R Wimmer
International School on Formal Methods for the Design of Computer …, 2014
282014
The COMICS tool–Computing minimal counterexamples for DTMCs
N Jansen, E Ábrahám, M Volk, R Wimmer, JP Katoen, B Becker
International Symposium on Automated Technology for Verification and …, 2012
28*2012
Solving DQBF through quantifier elimination
K Gitina, R Wimmer, S Reimer, M Sauer, C Scholl, B Becker
2015 Design, Automation & Test in Europe Conference & Exhibition (DATE …, 2015
272015
Hierarchical counterexamples for discrete-time Markov chains
N Jansen, E Ábrahám, J Katelaan, R Wimmer, JP Katoen, B Becker
International Symposium on Automated Technology for Verification and …, 2011
272011
High-level Counterexamples for Probabilistic Automata
JP Katoen, N Jansen, R Wimmer
Logical Methods in Computer Science 11, 2015
24*2015
Symblicit calculation of long-run averages for concurrent probabilistic systems
R Wimmer, B Braitling, B Becker, EM Hahn, P Crouzen, H Hermanns, ...
2010 Seventh International Conference on the Quantitative Evaluation of …, 2010
242010
HQSpre–An Effective Preprocessor for QBF and DQBF
R Wimmer, S Reimer, P Marin, B Becker
International Conference on Tools and Algorithms for the Construction and …, 2017
232017
Preprocessing for DQBF
R Wimmer, K Gitina, J Nist, C Scholl, B Becker
Theory and Applications of Satisfiability Testing–SAT 2015, 173-190, 2015
232015
Symbolic partition refinement with automatic balancing of time and space
R Wimmer, S Derisavi, H Hermanns
Performance Evaluation 67 (9), 816-836, 2010
232010
The system can't perform the operation now. Try again later.
Articles 1–20