bibliographer - Model Checking

Quantum Circuit Verification - A Potential Roadmap (Invited Talk) Parosh Aziz Abdulla Yu-Fang Chen Michal Hečko Lukáš Holík Ondřej Lengál Jyun-Ao Lin Ramanathan Thinniyam Srinivasan Tue 17 February 2026
Parametrised Verification of Intel-x86 Programs Parosh Aziz Abdulla Mohamed Faouzi Atig Ahmed Bouajjani K. Narayan Kumar Prakash Saivasan Fri 09 January 2026
Bridging Psychology and Computation: Modular Formalization of Psychological Theories with Automata and Model Checking Alain Finkel Gaspard Fougea Stéphane Le Roux Fri 04 July 2025
Monadic NIP in Monotone Classes of Relational Structures Samuel Braunfeld Anuj Dawar Ioannis Eleftheriadis Aris Papadopoulos Wed 02 October 2024
A Linear-Time Nominal mu-Calculus with Name Allocation Daniel Hausmann Stefan Milius Lutz Schröder Mon 23 September 2024
CSL model checking algorithms for QBDs Anne Remke Boudewijn R. Haverkort Lucia Cloth Mon 26 December 2022
First-Order Interpretations of Bounded Expansion Classes Jakub Gajarský Stephan Kreutzer Jaroslav NešETřil Patrice Ossona De Mendez Michał Pilipczuk Sebastian Siebertz Szymon Toruńczyk Wed 19 May 2021
Optimal paths in weighted timed automata Rajeev Alur Salvatore La Torre George J. Pappas Thu 29 April 2021
Resilience of Timed Systems Sundararaman Akshay Blaise Genest Loic Hélouet S. Krishna Sparsa Roychowdhury Sun 14 February 2021
Deciding Reachability under Persistent X86-TSO Parosh Aziz Abdulla Mohamed Faouzi Atig Ahmed Bouajjani K. Narayan Kumar Prakash Saivasan Wed 13 January 2021
Context-Free Timed Formalisms: Robust Automata and Linear Temporal Logics Laura Bozzelli Aniello Murano Adriano Peron Sun 27 December 2020
Weighted Timed Automata: Model-Checking and Games Patricia Bouyer Thu 06 February 2020
Model Checking Games Erich Gradel Wed 22 January 2020
Parameterized Verification Under TSO is PSPACE-complete Parosh Aziz Abdulla Mohamed Faouzi Atig Rojin Rezvan Tue 24 December 2019
An automata-theoretic approach to constraint LTL Stéphane Demri Deepak D'Souza Mon 16 September 2019
From Real-time Logic to Timed Automata Thomas Ferrère Oded Maler Dejan Ničković Amir Pnueli Sat 17 August 2019
Model Checking LTL with Regular Valuations for Pushdown Systems Javier Esparza Antonín Kucera Stefan Schwoon Thu 15 August 2019
Lambda-calculus and formal language theory Sylvain Salvati Mon 05 November 2018
Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata Alistair Stewart Kousha Etessami Mihalis Yannakakis Tue 02 October 2018
Linearity in Higher-order Recursion Schemes Pierre Clairambault Charles Grellois Andrzej S. Murawski Sat 30 June 2018
Checking conformance for time-constrained scenario-based specifications S. Akshay Paul Gastin Madhavan Mukund K. Narayan Kumar Tue 13 March 2018
Backward Coverability with Pruning for Lossy Channel Systems Thomas Geffroy Jérôme Leroux Grégoire Sutre Wed 06 September 2017
On the Relationship Between Higher-order Recursion Schemes and Higher-order Fixpoint Logic Naoki Kobayashi Étienne Lozes Florian Bruse Tue 11 April 2017
A Sufficient Condition to Polynomially Compute a Minimum Separating DFA Manuel Vázquez de Parga Pedro García Damián López Wed 08 March 2017
Durations and Parametric Model-checking in Timed Automata Véronique Bruyère Emmanuel Dall'olio Jean-François Raskin Wed 22 February 2017
Unboundedness and Downward Closures of Higher-order Pushdown Automata Matthew Hague Jonathan Kochems C.-H. Luke Ong Sat 16 January 2016
Deciding branching time properties for asynchronous programs Rohit Chadha Mahesh Viswanathan Wed 14 October 2015
Analysing Neurobiological Models Using Communicating Automata Li Su Rodolfo Gomez Howard Bowman Thu 08 January 2015
How to Stop Time Stopping Howard Bowman Rodolfo Gómez Mon 10 November 2014
Bisimulation-invariant PTIME and higher-dimensional mu-calculus Martin Otto Fri 21 March 2014
Layered Fixed Point Logic Piotr Filipiuk Flemming Nielson Hanne Riis Nielson Thu 20 March 2014
Defining Fairness in Reactive and Concurrent Systems Hagen Vølzer Daniele Varacca Mon 24 February 2014
Reduction of Stochastic Parity to Stochastic Mean-payoff Games Krishnendu Chatterjee Thomas A. Henzinger Mon 10 February 2014
Hierarchical Set Decision Diagrams and Automatic Saturation Alexandre Hamez Yann Thierry-Mieg Fabrice Kordon Tue 14 January 2014
Synthesis and Some of Its Challenges Wolfgang Thomas Mon 16 December 2013
The Tree Width of Auxiliary Storage P. Madhusudan Gennaro Parlato Mon 02 December 2013
Formal Verification of Hybrid Systems Rajeev Alur Wed 27 November 2013
On the Verification Problem of Nonregular Properties for Nonregular Processes Ahmed Bouajjani Rachid Echahed Peter Habermehl Mon 22 July 2013
On model-checking timed automata with stopwatch observers Thomas Brihaye Véronique Bruyère Jean-François Raskin Thu 18 April 2013
A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes Mourad Debbabi Abdelkader Benzakour Béchir Ktari Tue 26 February 2013
Types as models: model checking message-passing programs Sagar Chaki Sriram K. Rajamani Jakob Rehof Sun 24 February 2013
Temporal abstract interpretation Patrick Cousot Radhia Cousot Thu 21 February 2013
Automated temporal reasoning about reactive systems E. Allen Emerson Thu 31 January 2013
Refining Model Checking by Abstract Interpretation Patrick Cousot Radhia Cousot Wed 30 January 2013
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic Edmund M. Clarke E. Allen Emerson Wed 30 January 2013
Software model checking Ranjit Jhala Rupak Majumdar Wed 30 January 2013
A type system equivalent to a model checker Mayur Naik Jens Palsberg Wed 30 January 2013
Model-checking higher-order functions Naoki Kobayashi Mon 28 January 2013
An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) Moshe Y. Vardi Pierre Wolper Sat 29 December 2012
Checking that finite state concurrent programs satisfy their linear specification Orna Lichtenstein Amir Pnueli Sat 29 December 2012
Symbolic model checking with rich assertional languages Y. Kesten O. Maler M. Marcus A. Pnueli E. Shahar Sat 29 December 2012
Closed, Open, and Robust Timed Networks Parosh Aziz Abdulla Johann Deneux Pritha Mahata Tue 18 December 2012
On-the-fly verification of finite transition systems Jean-Claude Fernandez Laurent Mounier Claude Jard Thierry Jéron Fri 05 October 2012
Automatic verification of recursive procedures with one integer parameter Ahmed Bouajjani Peter Habermehl Richard Mayr Mon 24 September 2012
Model Checking Languages of Data Words Benedikt Bollig Aiswarya Cyriac Paul Gastin K. Narayan Kumar Mon 24 September 2012
LTL-Model-Checking via Model Composition Ingo Felscher Thu 20 September 2012
The benefits of relaxing punctuality Rajeev Alur Tomás Feder Thomas A. Henzinger Sat 07 July 2012
Efficient verification of parallel real-time systems Tomohiro Yoneda Atsufumi Shibayama Bernd-Holger Schlingloff Edmund M. Clarke Sat 07 July 2012
Winning Regions of Pushdown Parity Games: A Saturation Method Matthew Hague C. -H. Ong Thu 05 July 2012
Analysis of Recursive Game Graphs Using Data Flow Equations K. Etessami Wed 04 July 2012
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract) Alain Finkel Bernard Willems Pierre Wolper Wed 04 July 2012
An automata-theoretic approach to linear temporal logic Moshe Vardi Thu 05 April 2012
Alternating automata and program verification Moshe Y. Vardi Thu 05 April 2012
Reasoning about infinite computations Moshe Y. Vardi Pierre Wolper Wed 04 April 2012
A saturation method for the modal mu-calculus over pushdown systems M. Hague C.-H.L. Ong Thu 08 March 2012
The theory of ends, pushdown automata, and second-order logic David E. Muller Paul E. Schupp Tue 06 March 2012
Pushdown Processes: Games and Model-Checking Igor Walukiewicz Tue 06 March 2012
Higher-Order Model Checking: From Theory to Practice N. Kobayashi Tue 06 March 2012
Model-Checking Pushdown Systems Stefan Schwoon Tue 06 March 2012
Efficient Algorithms for Model Checking Pushdown Systems Javier Esparza David Hansel Peter Rossmanith Stefan Schwoon Tue 06 March 2012
Reachability analysis of pushdown automata: Application to model-checking and saturation method Ahmed Bouajjani Javier Esparza Oded Maler Tue 06 March 2012
Lecture Notes on Automata, Games and Verification Sven Schewe Bernd Finkbeiner Sat 03 March 2012

Library Size: 13G (72 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]