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 | 67 | 2006 |

Newtonian program analysis J Esparza, S Kiefer, M Luttenberger Journal of the ACM (JACM) 57 (6), 1-47, 2010 | 64 | 2010 |

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 | 63 | 2011 |

Proving termination of probabilistic programs using patterns J Esparza, A Gaiser, S Kiefer International Conference on Computer Aided Verification, 123-138, 2012 | 58 | 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 | 48 | 2007 |

Language equivalence for probabilistic automata S Kiefer, AS Murawski, J Ouaknine, B Wachter, J Worrell International Conference on Computer Aided Verification, 526-540, 2011 | 47 | 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 | 46 | 2007 |

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 | 42 | 2014 |

The odds of staying on budget C Haase, S Kiefer International Colloquium on Automata, Languages, and Programming, 234-246, 2015 | 41 | 2015 |

Analyzing probabilistic pushdown automata T Brázdil, J Esparza, S Kiefer, A Kučera Formal Methods in System Design 43 (2), 124-163, 2013 | 39 | 2013 |

BPA bisimilarity is EXPTIME-hard S Kiefer Information Processing Letters 113 (4), 101-106, 2013 | 36 | 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 | 31 | 2016 |

Convergence thresholds of Newton's method for monotone polynomial equations J Esparza, S Kiefer, M Luttenberger arXiv preprint arXiv:0802.2856, 2008 | 31 | 2008 |

Computing the least fixed point of positive polynomial systems J Esparza, S Kiefer, M Luttenberger SIAM Journal on Computing 39 (6), 2282-2335, 2010 | 27 | 2010 |

On the complexity of equivalence and minimisation for Q-weighted automata S Kiefer, A Murawski, J Ouaknine, B Wachter, J Worrell arXiv preprint arXiv:1302.2818, 2013 | 26 | 2013 |

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 | 25 | 2013 |

An Extension of Newton’s Method to *ω*-Continuous SemiringsJ Esparza, S Kiefer, M Luttenberger International Conference on Developments in Language Theory, 157-168, 2007 | 25 | 2007 |

Computing least fixed points of probabilistic systems of polynomials J Esparza, A Gaiser, S Kiefer arXiv preprint arXiv:0912.4226, 2009 | 21 | 2009 |

Moped-a model-checker for pushdown systems S Kiefer, S Schwoon, D Suwimonteerabuth Date of Access: January 20, 2009 | 21 | 2009 |

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 | 21 | 2008 |