|
|
 |
|
 |
|
Publications by Andreas Gaiser
|
|
 |
|
 |
2012 | |
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Proving termination of probabilistic programs using patterns. In Proceedings of CAV 2012, Berkeley, USA, 2012. |
|
|
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Proving termination of probabilistic programs using patterns. In Proceedings of CAV 2012, Berkeley, USA, 2012. |
|
|
Javier Esparza, Andreas Gaiser, and Jan Kretinsky. Rabinizer: Small Deterministic Automata for LTL(F,G). In 10th International Symposium on Automated Technology for Verification and Analysis (ATVA) 2012, Thiruvananthapuram, India, 2012. |
|
2011 | |
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. In Proceedings of the 18th International Static Analysis Symposium (SAS), Venice, Italy, September 2011. |
|
|
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. In Proceedings of the 18th International Static Analysis Symposium (SAS), Venice, Italy, September 2011. |
|
|
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. Technical report, Technische Universität München, 2011. Available via arxiv.org (arXiv:1106.1364). |
|
|
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. Technical report, Technische Universität München, 2011. Available via arxiv.org (arXiv:1106.1364). |
|
2010 | |
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. Technical report, Technische Universität München, Institut für Informatik, December 2010. |
|
|
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. Technical report, Technische Universität München, Institut für Informatik, December 2010. |
|
|
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), Nancy, France, 2010. |
|
|
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), Nancy, France, 2010. |
|
2009 | |
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. Technical report, Technische Universität München, Institut für Informatik, December 2009. |
|
|
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. Technical report, Technische Universität München, Institut für Informatik, December 2009. |
|
|
Andreas Gaiser and Stefan Schwoon. Comparison of algorithms for checking emptiness on Büchi automata. In Tomáš Vojnar, Petr Hliněný, Vashek Matyáš, and David Antoš, editors, Proceedings of the 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS), pages 69–77, Znojmo, Czechia, November 2009. |
|
|
Andreas Gaiser and Stefan Schwoon. Comparison of algorithms for checking emptiness on Büchi automata. In Tomáš Vojnar, Petr Hliněný, Vashek Matyáš, and David Antoš, editors, Proceedings of the 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS), pages 69–77, Znojmo, Czechia, November 2009. |
|
|
|
Contact
