 | 2012 |
| 40 |  | Stefan Kiefer,
Andrzej S. Murawski,
Joël Ouaknine,
Björn Wachter,
James Worrell:
On the Complexity of the Equivalence Problem for Probabilistic Automata.
FoSSaCS 2012: 467-481 |
| 39 |  | Tomás Brázdil,
Stefan Kiefer:
Stabilization of Branching Queueing Networks.
STACS 2012: 507-518 |
| 38 |  | Javier Esparza,
Andreas Gaiser,
Stefan Kiefer:
Proving Termination of Probabilistic Programs Using Patterns
CoRR abs/1204.2932: (2012) |
| 37 |  | Stefan Kiefer:
BPA Bisimilarity is EXPTIME-hard
CoRR abs/1205.7041: (2012) |
| 36 |  | Tomás Brázdil,
Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks.
Inf. Comput. 210: 87-110 (2012) |
| 2011 |
| 35 |  | Tomás Brázdil,
Stefan Kiefer,
Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter.
CAV 2011: 208-224 |
| 34 |  | Stefan Kiefer,
Andrzej S. Murawski,
Joël Ouaknine,
Björn Wachter,
James Worrell:
Language Equivalence for Probabilistic Automata.
CAV 2011: 526-540 |
| 33 |  | Tomás Brázdil,
Stefan Kiefer,
Antonín Kucera,
Ivana Hutarová Vareková:
Runtime Analysis of Probabilistic Programs with Unbounded Recursion.
ICALP (2) 2011: 319-331 |
| 32 |  | Stefan Kiefer,
Andrzej S. Murawski,
Joël Ouaknine,
James Worrell,
Lijun Zhang:
On Stabilization in Herman's Algorithm.
ICALP (2) 2011: 466-477 |
| 31 |  | Stefan Kiefer,
Dominik Wojtczak:
On Probabilistic Parallel Programs with Process Creation and Synchronisation.
TACAS 2011: 296-310 |
| 30 |  | Tomás Brázdil,
Stefan Kiefer,
Antonín Kucera:
Efficient Analysis of Probabilistic Programs with an Unbounded Counter
CoRR abs/1102.2529: (2011) |
| 29 |  | Stefan Kiefer,
Andrzej S. Murawski,
Joël Ouaknine,
James Worrell,
Lijun Zhang:
On Stabilization in Herman's Algorithm
CoRR abs/1104.3100: (2011) |
| 28 |  | Tomás Brázdil,
Stefan Kiefer:
Stabilization of Branching Queueing Networks
CoRR abs/1112.1041: (2011) |
| 27 |  | Stefan Kiefer,
Andrzej S. Murawski,
Joël Ouaknine,
Björn Wachter,
James Worrell:
On the Complexity of the Equivalence Problem for Probabilistic Automata
CoRR abs/1112.4644: (2011) |
| 26 |  | Javier Esparza,
Pierre Ganty,
Stefan Kiefer,
Michael Luttenberger:
Parikhʼs theorem: A simple and direct automaton construction.
Inf. Process. Lett. 111(12): 614-619 (2011) |
| 25 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Derivation tree analysis for accelerated fixed-point computation.
Theor. Comput. Sci. 412(28): 3226-3241 (2011) |
| 2010 |
| 24 |  | Tomás Brázdil,
Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Space-Efficient Scheduling of Stochastically Generated Tasks.
ICALP (2) 2010: 539-550 |
| 23 |  | Javier Esparza,
Andreas Gaiser,
Stefan Kiefer:
Computing Least Fixed Points of Probabilistic Systems of Polynomials.
STACS 2010: 359-370 |
| 22 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Computing the Least Fixed Point of Positive Polynomial Systems
CoRR abs/1001.0340: (2010) |
| 21 |  | Tomás Brázdil,
Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks
CoRR abs/1004.4286: (2010) |
| 20 |  | Javier Esparza,
Pierre Ganty,
Stefan Kiefer,
Michael Luttenberger:
Parikh's Theorem: A simple and direct construction
CoRR abs/1006.3825: (2010) |
| 19 |  | Tomás Brázdil,
Stefan Kiefer,
Antonín Kucera,
Ivana Hutarová Vareková:
Runtime Analysis of Probabilistic Programs with Unbounded Recursion
CoRR abs/1007.1710: (2010) |
| 18 |  | Stefan Kiefer,
Dominik Wojtczak:
On Probabilistic Parallel Programs with Process Creation and Synchronisation
CoRR abs/1012.2998: (2010) |
| 17 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Newtonian program analysis.
J. ACM 57(6): 33 (2010) |
| 16 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Computing the Least Fixed Point of Positive Polynomial Systems.
SIAM J. Comput. 39(6): 2282-2335 (2010) |
| 2009 |
| 15 |  | Morten Kühnrich,
Stefan Schwoon,
Jirí Srba,
Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.
FOSSACS 2009: 440-455 |
| 14 |  | Tomás Brázdil,
Javier Esparza,
Stefan Kiefer:
On the Memory Consumption of Probabilistic Pushdown Automata.
FSTTCS 2009: 49-60 |
| 13 |  | Morten Kühnrich,
Stefan Schwoon,
Jirí Srba,
Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
CoRR abs/0901.0501: (2009) |
| 12 |  | Javier Esparza,
Andreas Gaiser,
Stefan Kiefer:
Computing Least Fixed Points of Probabilistic Systems of Polynomials
CoRR abs/0912.4226: (2009) |
| 2008 |
| 11 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Derivation Tree Analysis for Accelerated Fixed-Point Computation.
Developments in Language Theory 2008: 301-313 |
| 10 |  | Javier Esparza,
Thomas Gawlitza,
Stefan Kiefer,
Helmut Seidl:
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
ICALP (1) 2008: 698-710 |
| 9 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Newton's Method for omega-Continuous Semirings.
ICALP (2) 2008: 14-26 |
| 8 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Solving Monotone Polynomial Equations.
IFIP TCS 2008: 285-298 |
| 7 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.
STACS 2008: 289-300 |
| 6 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
CoRR abs/0802.2856: (2008) |
| 5 |  | Javier Esparza,
Stefan Kiefer,
Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
JSAT 5(1-4): 27-56 (2008) |
| 2007 |
| 4 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
An Extension of Newton's Method to omega -Continuous Semirings.
Developments in Language Theory 2007: 157-168 |
| 3 |  | Javier Esparza,
Stefan Kiefer,
Michael Luttenberger:
On Fixed Point Equations over Commutative Semirings.
STACS 2007: 296-307 |
| 2 |  | Stefan Kiefer,
Michael Luttenberger,
Javier Esparza:
On the convergence of Newton's method for monotone systems of polynomial equations.
STOC 2007: 217-226 |
| 2006 |
| 1 |  | Javier Esparza,
Stefan Kiefer,
Stefan Schwoon:
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
TACAS 2006: 489-503 |