- Sparsity Jaroslav Nešetřil Patrice Ossona de Mendez Fri 02 March 2012
- Verification of Gap-Order Constraint Abstractions of Counter Systems Laura Bozzelli Sophie Pinchinat Fri 02 March 2012
- Concurrent Games with Ordered Objectives Patricia Bouyer Romain Brenguier Nicolas Markey Michael Ummels Fri 02 March 2012
- Branching-Time Model Checking of Parametric One-Counter Automata Stefan Göller Christoph Haase Joël Ouaknine James Worrell Fri 02 March 2012
- On the Complexity of Computing Probabilistic Bisimilarity Di Chen Franck van Breugel James Worrell Fri 02 March 2012
- Validating LR(1) Parsers Jacques-Henri Jourdan François Pottier Xavier Leroy Fri 02 March 2012
- Probabilistic Abstract Interpretation Patrick Cousot Michael Monerau Fri 02 March 2012
- Algorithms for Monitoring Real-Time Properties David Basin Felix Klaedtke Eugen Zălinescu Fri 02 March 2012
- Incremental Model-Based Testing of Delta-Oriented Software Product Lines Malte Lochau Ina Schaefer Jochen Kamischke Sascha Lity Fri 02 March 2012
- Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths Aistis Atminas Vadim V. Lozin Igor Razgon Fri 02 March 2012
- Proving Termination of Probabilistic Programs Using Patterns Javier Esparza Andreas Gaiser Stefan Kiefer Fri 02 March 2012
- Acacia+, a Tool for LTL Synthesis Aaron Bohy Véronique Bruyère Emmanuel Filiot Naiyong Jin Jean-François Raskin Fri 02 March 2012
- SAFARI: SMT-Based Abstraction for Arrays with Interpolants Francesco Alberti Roberto Bruttomesso Silvio Ghilardi Silvio Ranise Natasha Sharygina Fri 02 March 2012
- SYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs Shuvendu K. Lahiri Chris Hawblitzel Ming Kawaguchi Henrique Rebêlo Fri 02 March 2012
- Cubicle: A Parallel SMT-Based Model Checker for Parameterized Systems Sylvain Conchon Amit Goel Sava Krstić Alain Mebsout Fatiha Zaïdi Fri 02 March 2012
- Deterministic Automata for the (F,G)-Fragment of LTL Jan Křetínský Javier Esparza Fri 02 March 2012
- A Short Introduction to Implicit Computational Complexity Ugo Dal Lago Fri 02 March 2012
- State Complexity and Limited Nondeterminism Alexandros Palioudakis Kai Salomaa Selim G. Akl Fri 02 March 2012
- A Language of Patterns for Subterm Selection Georges Gonthier Enrico Tassi Fri 02 March 2012
- Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity Filip Murlak Michał Ogiński Marcin Przybyłko Fri 02 March 2012
Library Size: 13G (12950 entries),
Last Updated: Apr 12, 2026, 22:09:01,
Build Time: N/A
