Andreas Gaiser

15 papers A* 2A 1B 2Journal 7Unranked 2
YearRankTypeTitle / Venue / Authors
2013 J jnl
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars.
Inf. Process. Lett.
Javier Esparza, Andreas Gaiser, Stefan Kiefer
2013 J jnl
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
CoRR
Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský
2013 A* conf
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.
CAV
Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský
2013 — —
Verification of Reachability Properties and Termination for Probabilistic Systems.
Andreas Gaiser
2012 J jnl
Proving Termination of Probabilistic Programs Using Patterns
CoRR
Javier Esparza, Andreas Gaiser, Stefan Kiefer
2012 A* conf
Proving Termination of Probabilistic Programs Using Patterns.
CAV
Javier Esparza, Andreas Gaiser, Stefan Kiefer
2012 B conf
Rabinizer: Small Deterministic Automata for LTL(F, G).
ATVA
Andreas Gaiser, Jan Kretínský, Javier Esparza
2011 J jnl
Probabilistic Abstractions with Arbitrary Domains
CoRR
Javier Esparza, Andreas Gaiser
2011 B conf
Probabilistic Abstractions with Arbitrary Domains.
SAS
Javier Esparza, Andreas Gaiser
2010 A conf
Computing Least Fixed Points of Probabilistic Systems of Polynomials.
STACS
Javier Esparza, Andreas Gaiser, Stefan Kiefer
2010 — conf
Probabilistic Verification Techniques and Probabilistic Program Analysis.
AlgoSyn
Andreas Gaiser
2009 J jnl
Comparison of Algorithms for Checking Emptiness on Buechi Automata
CoRR
Andreas Gaiser, Stefan Schwoon
2009 — conf
Comparison of Algorithms for Checking Emptiness on Büchi Automata.
MEMICS
Andreas Gaiser, Stefan Schwoon
2009 J jnl
Computing Least Fixed Points of Probabilistic Systems of Polynomials
CoRR
Javier Esparza, Andreas Gaiser, Stefan Kiefer
2009 J jnl
On least fixed points of systems of positive polynomials.
ACM Commun. Comput. Algebra
Javier Esparza, Andreas Gaiser, Stefan Kiefer