Stefan Kiefer
Stefan Kiefer
Associate Professor, University of Oxford
Dirección de correo verificada de cs.ox.ac.uk - Página principal
Título
Citado por
Citado por
Año
Newtonian program analysis
J Esparza, S Kiefer, M Luttenberger
Journal of the ACM (JACM) 57 (6), 1-47, 2010
602010
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
562006
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
552011
Proving termination of probabilistic programs using patterns
J Esparza, A Gaiser, S Kiefer
International Conference on Computer Aided Verification, 123-138, 2012
442012
On fixed point equations over commutative semirings
J Esparza, S Kiefer, M Luttenberger
Annual Symposium on Theoretical Aspects of Computer Science, 296-307, 2007
432007
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
422007
Language equivalence for probabilistic automata
S Kiefer, AS Murawski, J Ouaknine, B Wachter, J Worrell
International Conference on Computer Aided Verification, 526-540, 2011
392011
The odds of staying on budget
C Haase, S Kiefer
International Colloquium on Automata, Languages, and Programming, 234-246, 2015
292015
Convergence thresholds of Newton's method for monotone polynomial equations
J Esparza, S Kiefer, M Luttenberger
arXiv preprint arXiv:0802.2856, 2008
292008
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
282014
BPA bisimilarity is EXPTIME-hard
S Kiefer
Information Processing Letters 113 (4), 101-106, 2013
282013
Analyzing probabilistic pushdown automata
T Brázdil, J Esparza, S Kiefer, A Kučera
Formal Methods in System Design 43 (2), 124-163, 2013
272013
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
242016
Computing the least fixed point of positive polynomial systems
J Esparza, S Kiefer, M Luttenberger
SIAM Journal on Computing 39 (6), 2282-2335, 2010
232010
An Extension of Newton’s Method to ω-Continuous Semirings
J Esparza, S Kiefer, M Luttenberger
International Conference on Developments in Language Theory, 157-168, 2007
232007
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
212013
Symbolic state traversal for WCET analysis
S Wilhelm, B Wachter
Proceedings of the seventh ACM international conference on Embedded software …, 2009
182009
Moped-a model-checker for pushdown systems
S Kiefer, S Schwoon, D Suwimonteerabuth
Date of Access: January 20, 2009
182009
Approximative methods for monotone systems of min-max-polynomial equations
J Esparza, T Gawlitza, S Kiefer, H Seidl
International Colloquium on Automata, Languages, and Programming, 698-710, 2008
182008
Newton’s Method for ω-Continuous Semirings
J Esparza, S Kiefer, M Luttenberger
International Colloquium on Automata, Languages, and Programming, 14-26, 2008
172008
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20