Search the dblp DataBase

Publications of Author

1. Javier Esparza, Stefan Kiefer, Michael Luttenberger
   On Fixed Point Equations over Commutative Semirings. [Citation Graph (0, 0)][DBLP]
   STACS, 2007, pp:296-307 [Conf]
   
2. Javier Esparza, Stefan Kiefer, Stefan Schwoon
   Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. [Citation Graph (0, 0)][DBLP]
   TACAS, 2006, pp:489-503 [Conf]
   
3. Javier Esparza, Stefan Kiefer, Michael Luttenberger
   An Extension of Newton's Method to omega -Continuous Semirings. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2007, pp:157-168 [Conf]
   
4. Stefan Kiefer, Michael Luttenberger, Javier Esparza
   On the convergence of Newton's method for monotone systems of polynomial equations. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:217-226 [Conf]
   
5. 
   Derivation Tree Analysis for Accelerated Fixed-Point Computation. [Citation Graph (, )][DBLP]
   
   
6. 
   Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. [Citation Graph (, )][DBLP]
   
   
7. 
   On the Memory Consumption of Probabilistic Pushdown Automata. [Citation Graph (, )][DBLP]
   
   
8. 
   Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. [Citation Graph (, )][DBLP]
   
   
9. 
   Newton's Method for omega-Continuous Semirings. [Citation Graph (, )][DBLP]
   
   
10. 
    Space-Efficient Scheduling of Stochastically Generated Tasks. [Citation Graph (, )][DBLP]
    
    
11. 
    Solving Monotone Polynomial Equations. [Citation Graph (, )][DBLP]
    
    
12. 
    Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. [Citation Graph (, )][DBLP]
    
    
13. 
    Computing Least Fixed Points of Probabilistic Systems of Polynomials. [Citation Graph (, )][DBLP]
    
    
14. 
    Convergence Thresholds of Newton's Method for Monotone Polynomial Equations [Citation Graph (, )][DBLP]
    
    
15. 
    Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains [Citation Graph (, )][DBLP]
    
    
16. 
    Computing Least Fixed Points of Probabilistic Systems of Polynomials [Citation Graph (, )][DBLP]
    
    
17. 
    Computing the Least Fixed Point of Positive Polynomial Systems [Citation Graph (, )][DBLP]
    
    
18. 
    Space-efficient scheduling of stochastically generated tasks [Citation Graph (, )][DBLP]
    
    
19. 
    Parikh's Theorem: A simple and direct construction [Citation Graph (, )][DBLP]
    
    
20. 
    Runtime Analysis of Probabilistic Programs with Unbounded Recursion [Citation Graph (, )][DBLP]