Arnaud Sangnier

Nathalie Sznajder

CoRR, 2024

QLTL Model-Checking.

[BibT_eX]

[DOI]

François Laroussinie

Loriane Leclercq

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

On the Satisfiability of Local First-Order Logics with Data.

[BibT_eX]

[DOI]

Olivier Stietel

CoRR, 2023

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous.

[BibT_eX]

[DOI]

Lucie Guillou

Nathalie Sznajder

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

On the Existential Fragments of Local First-Order Logics with Data.

[BibT_eX]

[DOI]

Olivier Stietel

Proceedings of the 13th International Symposium on Games, 2022

2021

On the Parameterized Verification of Abstract Models of Contact Tracing Protocols.

[BibT_eX]

[DOI]

Sylvain Conchon

Proceedings of the 3rd Workshop on Artificial Intelligence and Formal Verification, 2021

Local First-Order Logic with Two Data Values.

[BibT_eX]

[DOI]

Olivier Stietel

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Reachability in Distributed Memory Automata.

[BibT_eX]

[DOI]

Fedor Ryabinin

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

Verification of Contact Tracing Protocols via SMT-based Model Checking and Counting Abstraction.

[BibT_eX]

[DOI]

Sylvain Conchon

Proceedings of the 36th Italian Conference on Computational Logic, 2021

2020

Parameterized verification of algorithms for oblivious robots on a ring.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2020

On the Formalization of Decentralized Contact Tracing Protocols.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, 2020

Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks.

[BibT_eX]

[DOI]

Florian Horn

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

The Complexity of Flat Freeze LTL.

[BibT_eX]

[DOI]

Karin Quaas

Log. Methods Comput. Sci., 2019

Towards Synthesis of Distributed Algorithms with SMT Solvers.

[BibT_eX]

[DOI]

Carole Delporte-Gallet

Proceedings of the Networked Systems - 7th International Conference, 2019

2018

Equivalence between model-checking flat counter systems and Presburger arithmetic.

[BibT_eX]

[DOI]

Amit Kumar Dhar

Theor. Comput. Sci., 2018

2017

Model-Checking Counting Temporal Logics on Flat Structures.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Parameterized verification of time-sensitive models of ad hoc network protocols.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Adding Data Registers to Parameterized Networks with Broadcast.

[BibT_eX]

[DOI]

Riccardo Traverso

Fundam. Informaticae, 2016

On Parameterized One-Counter Automata.

[BibT_eX]

[DOI]

Karin Quaas

CoRR, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Qualitative Analysis of VASS-Induced MDPs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2016

How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property?

[BibT_eX]

[DOI]

Radu Iosif

Proceedings of the Automated Technology for Verification and Analysis, 2016

2015

Taming past LTL and flat counter systems.

[BibT_eX]

[DOI]

Amit Kumar Dhar

Inf. Comput., 2015

ATLsc with partial observation.

[BibT_eX]

[DOI]

François Laroussinie

Nicolas Markey

Proceedings of the Proceedings Sixth International Symposium on Games, 2015

Distributed Local Strategies in Broadcast Networks.

[BibT_eX]

[DOI]

Nathalie Bertrand

Paulin Fournier

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Playing with Probabilities in Reconfigurable Broadcast Networks.

[BibT_eX]

[DOI]

Nathalie Bertrand

Paulin Fournier

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Parameterized Verification of Broadcast Networks of Register Automata.

[BibT_eX]

[DOI]

Riccardo Traverso

Proceedings of the Reachability Problems - 7th International Workshop, 2013

On the Complexity of Verifying Regular Properties on Flat Counter Systems, .

[BibT_eX]

[DOI]

Amit Kumar Dhar

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Solving Parity Games on Integer Vectors.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

The Cost of Parameterized Reachability in Mobile Ad Hoc Networks

[BibT_eX]

[DOI]

CoRR, 2012

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Verification of Ad Hoc Networks with Node and Communication Failures.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Distributed Systems, 2012

2011

Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

[BibT_eX]

[DOI]

Proceedings of the Proceedings First International Workshop on Process Algebra and Coordination, 2011

On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2011

On the Verification of Timed Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

2010

Model checking memoryful linear-time logics over one-counter automata.

[BibT_eX]

[DOI]

Ranko Lazic

Theor. Comput. Sci., 2010

Mixing Coverability and Reachability to Analyze VASS with One Zero-Test.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Formal Verification of Industrial Software with Dynamic Memory Management.

[BibT_eX]

[DOI]

Sébastien Labbé

Proceedings of the 16th IEEE Pacific Rim International Symposium on Dependable Computing, 2010

When Model-Checking Freeze LTL over Counter Machines Becomes Decidable.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2010

Parameterized Verification of Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Reachability in Timed Counter Systems.

[BibT_eX]

[DOI]

Florent Bouchy

Proceedings of the Joint Proceedings of the 8th, 2009

Weak Time Petri Nets Strike Back!.

[BibT_eX]

[DOI]

Pierre-Alain Reynier

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Reversal-Bounded Counter Machines Revisited.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Model Checking Freeze LTL over One-Counter Automata.

[BibT_eX]

[DOI]

Ranko Lazic

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

From Time Petri Nets to Timed Automata: An Untimed Approach.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Towards Model-Checking Programs with Lists.

[BibT_eX]

[DOI]

Étienne Lozes