- Program analysis via graph reachability Thomas Reps Mon 15 July 2013
- Precise interprocedural dataflow analysis via graph reachability Thomas Reps Susan Horwitz Mooly Sagiv Mon 15 July 2013
- Tree automata with memory, visibility and structural constraints Hubert Comon-Lundh Florent Jacquemard Nicolas Perrin Mon 15 July 2013
- A Note on Nested Words Andreas Blass Yuri Gurevich Mon 15 July 2013
- Proving Termination Starting from the End Pierre Ganty Samir Genaim Mon 15 July 2013
- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis Krishnendu Chatterjee Andreas Gaiser Jan Křetínský Mon 15 July 2013
- Multi-core Emptiness Checking of Timed Buchi Automata Using Inclusion Abstraction Alfons Laarman Mads Chr. Olesen Andreas Engelbredt Dalsgaard Kim Guldstrand Larsen Jaco van de Pol Mon 15 July 2013
- Emptiness Check of Powerset Buchi Automata using Inclusion Tests Souheib Baarir Alexandre Duret-Lutz Mon 15 July 2013
- On Solving Universally Quantified Horn Clauses Nikolaj Bjørner Kenneth L. McMillan Andrey Rybalchenko Mon 15 July 2013
- Solving Existentially Quantified Horn Clauses Tewodros A. Beyene Corneliu Popeea Andrey Rybalchenko Mon 15 July 2013
- A Fully Verified Executable LTL Model Checker Javier Esparza Peter Lammich René Neumann Tobias Nipkow Alexander Schimpf Jan-Georg Smaus Mon 15 July 2013
- Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata Alistair Stewart Kousha Etessami Mihalis Yannakakis Mon 15 July 2013
- Reachability in Two-Clock Timed Automata is PSPACE-complete John Fearnley Marcin Jurdziński Mon 15 July 2013
- Sense and denotation as algorithm and value Yiannis N. Moschovakis Mon 15 July 2013
- Grammars with macro-like productions Michael J. Fischer Mon 15 July 2013
- The IO and OI Hierarchies Revisited Gregory M. Kobele Sylvain Salvati Mon 15 July 2013
- Stochastic Context-Free Grammars, Regular Languages, and Newton's Method Kousha Etessami Alistair Stewart Mihalis Yannakakis Mon 15 July 2013
- OpenNWA: a nested-word automaton library Evan Driscoll Aditya Thakur Thomas Reps Mon 15 July 2013
- Checking conformance of a producer and a consumer Evan Driscoll Amanda Burton Thomas Reps Mon 15 July 2013
- A Direct Translation from XPath to Nondeterministic Automata Nadime Francis Claire David Leonid Libkin Mon 15 July 2013
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
