Proving termination of probabilistic programs using patterns J Esparza, A Gaiser, S Kiefer Computer Aided Verification: 24th International Conference, CAV 2012 …, 2012 | 69 | 2012 |
Comparison of algorithms for checking emptiness on Büchi automata A Gaiser, S Schwoon arXiv preprint arXiv:0910.3766, 2009 | 44 | 2009 |
Rabinizer: Small Deterministic Automata for LTL(F,G) A Gaiser, J Křetínský, J Esparza International Symposium on Automated Technology for Verification and …, 2012 | 26 | 2012 |
Computing least fixed points of probabilistic systems of polynomials J Esparza, A Gaiser, S Kiefer arXiv preprint arXiv:0912.4226, 2009 | 20 | 2009 |
Probabilistic abstractions with arbitrary domains J Esparza, A Gaiser International Static Analysis Symposium, 334-350, 2011 | 11 | 2011 |
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars J Esparza, A Gaiser, S Kiefer Information Processing Letters 113 (10-11), 381-385, 2013 | 9 | 2013 |
Verification of Reachability Properties and Termination for Probabilistic Systems A Gaiser Technische Universität München, 2013 | 1 | 2013 |
On least fixed points of systems of positive polynomials J Esparza, A Gaiser, S Kiefer ACM Communications in Computer Algebra 43 (3/4), 81-83, 2010 | 1 | 2010 |
6.3. Probabilistic Verification and Program Analysis. A Gaiser Joint Workshop of the German Research Training Groups in Computer Science, 98, 2011 | | 2011 |
Erreichbarkeitsanalyse funktionaler Programme mit Grundtermersetzungssystemen A Gaiser Universitätsbibliothek der Universität Stuttgart, 2008 | | 2008 |
Vergleich von Algorithmen für den Leerheitstest von Büchiautomaten A Gaiser Universitätsbibliothek der Universität Stuttgart, 2007 | | 2007 |
Worst-Case-Gleichgewichte A Gaiser | | 2006 |
wAnalyzer-ein Tool für die Datenflussanalyse A Gaiser, F Stahr | | 2004 |
Probabilistic Abstractions with Arbitrary Domains A Gaiser, J Esparza | | |
funktionaler Programme mit Grundtermersetzungssystemen A Gaiser | | |