Stefan Kiefer
Titel
Citeras av
Citeras av
År
Newtonian program analysis
J Esparza, S Kiefer, M Luttenberger
Journal of the ACM (JACM) 57 (6), 1-47, 2010
632010
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
602006
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
562011
Proving termination of probabilistic programs using patterns
J Esparza, A Gaiser, S Kiefer
International Conference on Computer Aided Verification, 123-138, 2012
542012
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
462007
Language equivalence for probabilistic automata
S Kiefer, AS Murawski, J Ouaknine, B Wachter, J Worrell
International Conference on Computer Aided Verification, 526-540, 2011
452011
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
BPA bisimilarity is EXPTIME-hard
S Kiefer
Information Processing Letters 113 (4), 101-106, 2013
312013
The odds of staying on budget
C Haase, S Kiefer
International Colloquium on Automata, Languages, and Programming, 234-246, 2015
302015
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
302014
Convergence thresholds of Newton's method for monotone polynomial equations
J Esparza, S Kiefer, M Luttenberger
arXiv preprint arXiv:0802.2856, 2008
302008
Analyzing probabilistic pushdown automata
T Brázdil, J Esparza, S Kiefer, A Kučera
Formal Methods in System Design 43 (2), 124-163, 2013
292013
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
262016
Computing the least fixed point of positive polynomial systems
J Esparza, S Kiefer, M Luttenberger
SIAM Journal on Computing 39 (6), 2282-2335, 2010
262010
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
242013
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
242007
Symbolic state traversal for WCET analysis
S Wilhelm, B Wachter
Proceedings of the seventh ACM international conference on Embedded software …, 2009
192009
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
192008
The complexity of the Kth largest subset problem and related problems
C Haase, S Kiefer
Information Processing Letters 116 (2), 111-115, 2016
182016
Stability and complexity of minimising probabilistic automata
S Kiefer, B Wachter
International Colloquium on Automata, Languages, and Programming, 268-279, 2014
182014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20