- Verification of timed systems Patricia Bouyer Tue 31 March 2026
- One-Clock Synthesis Problems Sławomir Lasota Mathieu Lehaut Julie Parreaux Radosław Pirkowski Mon 02 March 2026
- Parameterized Verification of Quantum Circuits Parosh Aziz Abdulla Yu-Fang Chen Michal Hečko Lukáš Holík Ondřej Lengál Jyun-Ao Lin Ramanathan S. Thinniyam Fri 09 January 2026
- Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures C. Aiswarya Pascal Baumann Prakash Saivasan Lia Schutze Georg Zetzsche Fri 09 January 2026
- On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates Thomas Colcombet Alexander Rabinovich Fri 14 February 2025
- Reachability for Multi-Priced Timed Automata with Positive and Negative Rates Andrew Scoones Mahsa Shirmohammadi James Worrell Thu 13 February 2025
- Non-Linear Loop Invariant Generation Using Grøbner Bases Sriram Sankaranarayanan Henny B. Sipma Zohar Manna Fri 01 September 2023
- A Higher-Order Indistinguishability Logic for Cryptographic Reasoning David Baelde Adrien Koutsos Joseph Lallemand Fri 28 April 2023
- What's Decidable about Linear Loops Toghrul Karimov Engel Lefaucheux Joel Ouaknine David Purser Anton Varonka Markus A. Whiteland James Worrell Mon 17 January 2022
- Context-Bounded Verification of Thread Pools Pascal Baumann Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Mon 17 January 2022
- Bisimilarity on Basic Parallel Processes Petr Jančar Tue 14 December 2021
- Polynomial interrupt timed automata: Verification and expressiveness B. Bérard S. Haddad C. Picaronny M. Safey El Din M. Sassolas Thu 29 April 2021
- When Reachability Meets Grzegorczyk Jérôme Leroux Sat 30 May 2020
- Reachability of scope-bounded multistack pushdown systems Salvatore [La Torre] Margherita Napoli Gennaro Parlato Tue 19 May 2020
- On Effective Representations of Well Quasi-Orderings Simon Halfon Mon 13 April 2020
- On Effective Representations of Well Quasi-Orderings Simon Halfon Mon 13 April 2020
- Algorithmic Complexity of Well-Quasi-Orders Sylvain Schmitz Tue 29 January 2019
- Lambda-calculus and formal language theory Sylvain Salvati Mon 05 November 2018
- The surprizing complexity of generalized reachability games Nathanael Fijalkow Florian Horn Mon 14 May 2018
- Refinement Reflection: Complete Verification with SMT Niki Vazou Anish Tondwalkar Vikraman Choudhury Ryan G. Scott Ryan R. Newton Philip Wadler Ranjit Jhala Mon 16 April 2018
- StarL: Towards a Unified Framework for Programming, Simulating and Verifying Distributed Robotic Systems Yixiao Lin Sayan Mitra Tue 13 March 2018
- Proofs That Count Azadeh Farzan Zachary Kincaid Andreas Podelski Fri 11 November 2016
- Proof Spaces for Unbounded Parallelism Azadeh Farzan Zachary Kincaid Andreas Podelski Fri 11 November 2016
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata Oliver Friedmann Felix Klaedtke Martin Lange Tue 19 January 2016
- Unboundedness and Downward Closures of Higher-order Pushdown Automata Matthew Hague Jonathan Kochems C.-H. Luke Ong Sat 16 January 2016
- Lower and Upper Bounds in Zone-based Abstractions of Timed Automata Gerd Behrmann Patricia Bouyer Kim G. Larsen Radek Pelánek Thu 02 July 2015
- Sessions with an unbounded number of agents S. Akshay Loic Helouet Madhavan Mukund Tue 22 April 2014
- Modeling and Verification of Time Dependent Systems Using Time Petri Nets Bernard Berthomieu Michel Diaz Thu 16 January 2014
- Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks Jonathan Kochems C.-H.Luke Ong Tue 12 November 2013
- On the Verification Problem of Nonregular Properties for Nonregular Processes Ahmed Bouajjani Rachid Echahed Peter Habermehl Mon 22 July 2013
- On the Skolem Problem for Reversible Sequences George Kenison Fri 02 March 2012
Library Size: 13G (31 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
