Stefan Kiefer
Stefan Kiefer
Professor of Computer Science, University of Oxford
Verified email at - Homepage
Cited by
Cited by
Newtonian program analysis
J Esparza, S Kiefer, M Luttenberger
Journal of the ACM (JACM) 57 (6), 1-47, 2010
Abstraction refinement with Craig interpolation and symbolic pushdown systems
J Esparza, S Kiefer, S Schwoon
International Conference on Tools and Algorithms for the Construction and …, 2006
Parikhʼs theorem: A simple and direct automaton construction
J Esparza, P Ganty, S Kiefer, M Luttenberger
Information Processing Letters 111 (12), 614-619, 2011
Proving termination of probabilistic programs using patterns
J Esparza, A Gaiser, S Kiefer
Computer Aided Verification: 24th International Conference, CAV 2012 …, 2012
On the convergence of Newton's method for monotone systems of polynomial equations
S Kiefer, M Luttenberger, J Esparza
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
Language equivalence for probabilistic automata
S Kiefer, AS Murawski, J Ouaknine, B Wachter, J Worrell
Computer Aided Verification: 23rd International Conference, CAV 2011 …, 2011
On fixed point equations over commutative semirings
J Esparza, S Kiefer, M Luttenberger
Annual Symposium on Theoretical Aspects of Computer Science, 296-307, 2007
The odds of staying on budget
C Haase, S Kiefer
International Colloquium on Automata, Languages, and Programming, 234-246, 2015
Analyzing probabilistic pushdown automata
T Brázdil, J Esparza, S Kiefer, A Kučera
Formal Methods in System Design 43, 124-163, 2013
On the total variation distance of labelled Markov chains
T Chen, S Kiefer
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
BPA bisimilarity is EXPTIME-hard
S Kiefer
Information Processing Letters 113 (4), 101-106, 2013
Markov chains and unambiguous Büchi automata
C Baier, S Kiefer, J Klein, S Klüppelholz, D Müller, J Worrell
International Conference on Computer Aided Verification, 23-42, 2016
Convergence thresholds of Newton's method for monotone polynomial equations
J Esparza, S Kiefer, M Luttenberger
arXiv preprint arXiv:0802.2856, 2008
Runtime analysis of probabilistic programs with unbounded recursion
T Brázdil, S Kiefer, A Kučera, IH Vařeková
Journal of Computer and System Sciences 81 (1), 288-310, 2015
On the complexity of equivalence and minimisation for Q-weighted automata
S Kiefer, A Murawski, J Ouaknine, B Wachter, J Worrell
Logical Methods in Computer Science 9, 2013
Computing the least fixed point of positive polynomial systems
J Esparza, S Kiefer, M Luttenberger
SIAM Journal on Computing 39 (6), 2282-2335, 2010
Efficient analysis of probabilistic programs with an unbounded counter
T Brázdil, S Kiefer, A Kŭcera
Journal of the ACM (JACM) 61 (6), 1-35, 2014
An Extension of Newton’s Method to ω-Continuous Semirings
J Esparza, S Kiefer, M Luttenberger
Developments in Language Theory: 11th International Conference, DLT 2007 …, 2007
Bisimilarity of pushdown automata is nonelementary
M Benedikt, S Göller, S Kiefer, AS Murawski
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 488-498, 2013
Moped-a model-checker for pushdown systems
S Kiefer, S Schwoon, D Suwimonteerabuth
Date of Access: January 20, 2009
The system can't perform the operation now. Try again later.
Articles 1–20