- The mu-calculus and Model Checking Julian Bradfield Igor Walukiewicz Fri 02 March 2012
- Graph Games and Reactive Synthesis Roderick Bloem Krishnendu Chatterjee Barbara Jobstmann Fri 02 March 2012
- Explicit-State Model Checking Gerard J. Holzmann Fri 02 March 2012
- Complexity Bounds for Ordinal-Based Termination Sylvain Schmitz Fri 02 March 2012
- Lace: Non-blocking Split Deque for Work-Stealing Tom van Dijk Jaco C. van de Pol Fri 02 March 2012
- The Web of Data for E-Commerce: Schema.org and GoodRelations for Researchers and Practitioners Martin Hepp Fri 02 March 2012
- Mining the Archive of Formal Proofs Jasmin Christian Blanchette Maximilian Haslbeck Daniel Matichuk Tobias Nipkow Fri 02 March 2012
- Mizar: State-of-the-art and Beyond Grzegorz Bancerek Czesław Byliński Adam Grabowski Artur Korniłowicz Roman Matuszewski Adam Naumowicz Karol Paąk Josef Urban Fri 02 March 2012
- The Lean Theorem Prover (System Description) Leonardo de Moura Soonho Kong Jeremy Avigad Floris van Doorn Jakob von Raumer Fri 02 March 2012
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change Christopher Czyba Christopher Spinrath Wolfgang Thomas Fri 02 March 2012
- The Open-Source LearnLib Malte Isberner Falk Howar Bernhard Steffen Fri 02 March 2012
- Foundational Property-Based Testing Zoe Paraskevopoulou Cătălin Hriţcu Maxime Dénès Leonidas Lampropoulos Benjamin C. Pierce Fri 02 March 2012
- Learning Weighted Automata Borja Balle Mehryar Mohri Fri 02 March 2012
- Web-Based Modelling and Collaborative Simulation of Declarative Processes Morten Marquard Muhammad Shahzad Tijs Slaats Fri 02 March 2012
- An Improved HHL Prover: An Interactive Theorem Prover for Hybrid Systems Shuling Wang Naijun Zhan Liang Zou Fri 02 March 2012
- On the Probability of Being Synchronizable Mikhail V. Berlinkov Fri 02 March 2012
- Compositional Bisimulation Minimization for Interval Markov Decision Processes Vahid Hashemi Holger Hermanns Lei Song K. Subramani Andrea Turrini Piotr Wojciechowski Fri 02 March 2012
- Congruence Closure in Intensional Type Theory Daniel Selsam Leonardo de Moura Fri 02 March 2012
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer Marijn J. H. Heule Oliver Kullmann Victor W. Marek Fri 02 March 2012
- Learning Rate Based Branching Heuristic for SAT Solvers Jia Hui Liang Vijay Ganesh Pascal Poupart Krzysztof Czarnecki Fri 02 March 2012
Library Size: 13G (12951 entries),
Last Updated: Apr 13, 2026, 09:28:01,
Build Time: N/A
