No. |
Title |
Author |
Year |
---|

1 |
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk) |
Esparza, Javier |
2014 |

2 |
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141) |
Esparza, Javier et al. |
2014 |

3 |
Computation of Summaries Using Net Unfoldings |
Esparza, Javier et al. |
2013 |

4 |
Computing Least Fixed Points of Probabilistic Systems of Polynomials |
Esparza, Javier et al. |
2010 |

5 |
On the Memory Consumption of Probabilistic Pushdown Automata |
Brazdil, Tomas et al. |
2009 |

6 |
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations |
Esparza, Javier et al. |
2008 |

7 |
Reachability analysis of multithreaded software with asynchronous communication |
Bouajjani, Ahmed et al. |
2006 |