- Data types as objects Adi Shamir WilliamW. Wadge Mon 22 July 2013
- Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers Per Bjesse Tim Leonard Abdel Mokkedem Mon 22 July 2013
- Benefits of Bounded Model Checking at an Industrial Setting Fady Copty Limor Fix Ranan Fraer Enrico Giunchiglia Gila Kamhi Armando Tacchella Moshe Y. Vardi Mon 22 July 2013
- Uniform inevitability is tree automaton ineffable E. Allen Emerson Mon 22 July 2013
- On the Verification Problem of Nonregular Properties for Nonregular Processes Ahmed Bouajjani Rachid Echahed Peter Habermehl Mon 22 July 2013
- Deciding emptiness for stack automata on infinite trees David Harel Danny Raz Mon 22 July 2013
- Reasoning about the past with two-way automata MosheY. Vardi Mon 22 July 2013
- Can message buffers be axiomatized in linear temporal logic A. P. Sistla E. M. Clarke N. Francez A. R. Meyer Mon 22 July 2013
- An automata-theoretic approach to branching-time model checking Orna Kupferman Moshe Y. Vardi Pierre Wolper Mon 22 July 2013
- The set constraint/CFL reachability connection in practice John Kodumal Alex Aiken Mon 22 July 2013
- Weighted pushdown systems and their application to interprocedural dataflow analysis Thomas Reps Stefan Schwoon Somesh Jha David Melski Mon 22 July 2013
- Introspective pushdown analysis Christopher Earl Ilya Sergey J. Ian Johnson Matthew Might David Van Horn Mon 22 July 2013
- Pushdown Systems with Stack Manipulation Yuya Uezato Yasuhiko Minamide Mon 22 July 2013
- Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints Thomas Brihaye Laurent Doyen Gilles Geeraerts Joel Ouaknine Jean-François Raskin James Worrell Mon 22 July 2013
- The Complexity of Admissibility in Omega-Regular Games Romain Brenguier Jean-François Raskin Mathieu Sassolas Mon 22 July 2013
- Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment Tomáš Babiak František Blahoudek Mojmír Křetínský Jan Strejček Mon 22 July 2013
- Complexity of Type Inference Jerzy Tyszkiewicz Thu 18 July 2013
- On the complexity of type inference with coercion Mitchell Wand Patrick O'Keefe Thu 18 July 2013
- Type inference for partial types is decidable Patrick M. O'Keefe Mitchell Wand Thu 18 July 2013
- An ideal model for recursive polymorphic types David MacQueen Gordon Plotkin Ravi Sethi Wed 17 July 2013
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
