Pierre Ganty

B. Srivathsan

CoRR, 2024

Learning the State Machine Behind a Modal Text Editor: The (Neo)Vim Case Study.

[BibT_eX]

[DOI]

Proceedings of the Model Checking Software - 30th International Symposium, 2024

Computing Reachable Simulations on Transition Systems.

[BibT_eX]

[DOI]

Nicolas Manini

Proceedings of the Reachability Problems - 18th International Conference, 2024

A Uniform Framework for Language Inclusion Problems.

[BibT_eX]

[DOI]

Chana Weil-Kennedy

Proceedings of the Taming the Infinities of Concurrency, 2024

2023

Antichains Algorithms for the Inclusion Problem Between ømega-VPL.

[BibT_eX]

[DOI]

Luka Hadzi-Dokic

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

2022

Online Simulation Reduction.

[BibT_eX]

[DOI]

Nicolas Manini

CoRR, 2022

FORQ-Based Language Inclusion Formal Testing.

[BibT_eX]

[DOI]

Nicolas Mazzocchi

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021

Complete Abstractions for Checking Language Inclusion.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2021

A Congruence-Based Perspective on Finite Tree Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Inclusion Testing of Büchi Automata Based on Well-Quasiorders.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

CacheQuery: learning replacement policies from hardware caches.

[BibT_eX]

[DOI]

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

A Quasiorder-Based Perspective on Residual Automata.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Language Inclusion Algorithms as Complete Abstract Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 26th International Symposium, 2019

A Congruence-based Perspective on Automata Minimization Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Regular Expression Search on Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2019

2018

Tree dimension in verification of constrained Horn clauses.

[BibT_eX]

[DOI]

Bishoksan Kafle

John P. Gallagher

Theory Pract. Log. Program., 2018

Sound up-to techniques and Complete abstract domains.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

The Parikh Property for Weighted Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Verification of Immediate Observation Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Underapproximation of procedure summaries for integer programs.

[BibT_eX]

[DOI]

Radu Iosif

Filip Konecný

Int. J. Softw. Tools Technol. Transf., 2017

Model checking parameterized asynchronous shared-memory systems.

[BibT_eX]

[DOI]

Antoine Durand-Gasselin

Formal Methods Syst. Des., 2017

Verification of population protocols.

[BibT_eX]

[DOI]

Acta Informatica, 2017

Parikh Image of Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

A Language-Theoretic View on Network Protocols.

[BibT_eX]

[DOI]

Boris Köpf

Proceedings of the Automated Technology for Verification and Analysis, 2017

Fixing the State Budget: Approximation of Regular Languages with Small DFAs.

[BibT_eX]

[DOI]

Graeme Gange

Peter J. Stuckey

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Parameterized Verification of Asynchronous Shared-Memory Systems.

[BibT_eX]

[DOI]

J. ACM, 2016

Solving non-linear Horn clauses using a linear Horn clause solver.

[BibT_eX]

[DOI]

Bishoksan Kafle

John P. Gallagher

Proceedings of the Proceedings 3rd Workshop on Horn Clauses for Verification and Synthesis, 2016

Bounded-oscillation Pushdown Automata.

[BibT_eX]

[DOI]

Damir Valput

Proceedings of the Seventh International Symposium on Games, 2016

Model Checking Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Decomposition by tree dimension in Horn clause verification.

[BibT_eX]

[DOI]

Bishoksan Kafle

John P. Gallagher

Proceedings of the Third International Workshop on Verification and Program Transformation, 2015

From non-zenoness verification to termination.

[BibT_eX]

[DOI]

Proceedings of the 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2015

Interprocedural Reachability for Flat Integer Programs.

[BibT_eX]

[DOI]

Radu Iosif

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Analysis of Asynchronous Programs with Event-Based Synchronization.

[BibT_eX]

[DOI]

Michael Emmi

Fernando Rosa-Velardo

Proceedings of the Programming Languages and Systems, 2015

2014

Pattern-Based Verification for Multithreaded Programs.

[BibT_eX]

[DOI]

Tomás Poch

ACM Trans. Program. Lang. Syst., 2014

Generating Bounded Languages Using Bounded Control Sets.

[BibT_eX]

[DOI]

Radu Iosif

CoRR, 2014

Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification.

[BibT_eX]

[DOI]

Ahmed Rezine

Proceedings of the Language and Automata Theory and Applications, 2014

2013

Proving Termination Starting from the End.

[BibT_eX]

[DOI]

Samir Genaim

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

Algorithmic verification of asynchronous programs.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2012

Bounded underapproximations.

[BibT_eX]

[DOI]

Benjamin Monmege

Formal Methods Syst. Des., 2012

A Perfect Model for Bounded Verification.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Parikhʼs theorem: A simple and direct automaton construction.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Preface.

[BibT_eX]

[DOI]

Mark Marron

Proceedings of the Sixth Workshop on Bytecode Semantics, 2011

Complexity Analysis of the Backward Coverability Algorithm for VASS.

[BibT_eX]

[DOI]

Laura Bozzelli

Proceedings of the Reachability Problems - 5th International Workshop, 2011

Complexity of pattern-based verification for multithreaded programs.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Approximating Petri Net Reachability Along Context-free Traces.

[BibT_eX]

[DOI]

Mohamed Faouzi Atig

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

2010

Fixed point guided abstraction refinement for alternating automata.

[BibT_eX]

[DOI]

Nicolas Maquet

Theor. Comput. Sci., 2010

Parikh's Theorem: A simple and direct construction

[BibT_eX]

[DOI]

CoRR, 2010

2009

Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2009

Fixpoint Guided Abstraction Refinement for Alternating Automata.

[BibT_eX]

[DOI]

Nicolas Maquet

Proceedings of the Implementation and Application of Automata, 2009

Verifying liveness for asynchronous programs.

[BibT_eX]

[DOI]

Andrey Rybalchenko

Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Analyzing Real-Time Event-Driven Programs.

[BibT_eX]

[DOI]

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

2008

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.

[BibT_eX]

[DOI]

Laurent Van Begin

Fundam. Informaticae, 2008

Parikh-Equivalent Bounded Underapproximations

[BibT_eX]

[DOI]

Benjamin Monmege

CoRR, 2008

2007

Fixpoint-Guided Abstraction Refinements.

[BibT_eX]

[DOI]

Patrick Cousot

Proceedings of the Static Analysis, 14th International Symposium, 2007

2006

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.

[BibT_eX]

[DOI]

Laurent Van Begin

Proceedings of the Verification, 2006

2005

Locality-Based Abstractions.

[BibT_eX]

[DOI]

Stefan Schwoon

Proceedings of the Static Analysis, 12th International Symposium, 2005

2004

Automatic Verification of Time Sensitive Cryptographic Protocols.

[BibT_eX]

[DOI]

Giorgio Delzanno

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

2003

SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis.

[BibT_eX]

[DOI]

Alessandro Armando

Luca Compagna