- Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata Bishoksan Kafle John P. Gallagher José F. Morales Fri 02 March 2012
- Combining Model Learning and Model Checking to Analyze TCP Implementations Paul Fiterău-Broştean Ramon Janssen Frits Vaandrager Fri 02 March 2012
- A Framework for the Automatic Formal Verification of Refinement from Cogent to C Christine Rizkallah Japheth Lim Yutaka Nagashima Thomas Sewell Zilin Chen Liam O'Connor Toby Murray Gabriele Keller Gerwin Klein Fri 02 March 2012
- What's in a Theorem Name David Aspinall Cezary Kaliszyk Fri 02 March 2012
- ARRIVAL: A Zero-Player Graph Game in NP ąp coNP Jérôme Dohrau Bernd Gärtner Manuel Kohler Jiří Matoušek Emo Welzl Fri 02 March 2012
- Deriving Consistent GSM Schemas from DCR Graphs Rik Eshuis Søren Debois Tijs Slaats Thomas Hildebrandt Fri 02 March 2012
- Solving Mean-Payoff Games on the GPU Philipp J. Meyer Michael Luttenberger Fri 02 March 2012
- Spot 2.0 - A Framework for LTL and textdollartextdollartextbackslashomega textdollartextdollar -Automata Manipulation Alexandre Duret-Lutz Alexandre Lewkowicz Amaury Fauchille Thibaud Michaud Étienne Renault Laurent Xu Fri 02 March 2012
- Accelerated Runtime Verification of LTL Specifications with Counting Semantics Ramy Medhat Borzoo Bonakdarpour Sebastian Fischmeister Yogi Joshi Fri 02 March 2012
- Deciding Structural Liveness of Petri Nets Petr Jančar Fri 02 March 2012
- Bringing LTL Model Checking to Biologists Zara Ahmed David Benque Sergey Berezin Anna Caroline E. Dahl Jasmin Fisher Benjamin A. Hall Samin Ishtiaq Jay Nanavati Nir Piterman Maik Riechert Nikita Skoblov Fri 02 March 2012
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic Andrew Reynolds Radu Iosif Cristina Serban Fri 02 March 2012
- On the Complexity of Multivariate Polynomial Division Joris van der Hoeven Fri 02 March 2012
- Improved Learning for Stochastic Timed Models by State-Merging Algorithms Braham Lotfi Mediouni Ayoub Nouri Marius Bozga Saddek Bensalem Fri 02 March 2012
- Parametric Model Checking Timed Automata Under Non-Zenoness Assumption Étienne André Hoang Gia Nguyen Laure Petrucci Jun Sun Fri 02 March 2012
- On the Combinatorial Power of the Weisfeiler-Lehman Algorithm Martin Fürer Fri 02 March 2012
- The Complexity of Diagnosability and Opacity Verification for Petri Nets Béatrice Bérard Stefan Haar Sylvain Schmitz Stefan Schwoon Fri 02 March 2012
- Concatenation Hierarchies: New Bottle, Old Wine Thomas Place Marc Zeitoun Fri 02 March 2012
- Searching and Indexing Circular Patterns Costas S. Iliopoulos Solon P. Pissis M. Sohel Rahman Fri 02 March 2012
- A Proof Strategy Language and Proof Script Generation for Isabelle/HOL Yutaka Nagashima Ramana Kumar Fri 02 March 2012
Library Size: 13G (12951 entries),
Last Updated: Apr 13, 2026, 09:28:01,
Build Time: N/A
