Pierre Ganty

According to our database1, Pierre Ganty
  • authored at least 52 papers between 2003 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Underapproximation of procedure summaries for integer programs.
STTT, 2017

Model checking parameterized asynchronous shared-memory systems.
Formal Methods in System Design, 2017

Parikh Image of Pushdown Automata.
CoRR, 2017

Verification of population protocols.
Acta Inf., 2017

Parikh Image of Pushdown Automata.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Parameterized Verification of Asynchronous Shared-Memory Systems.
J. ACM, 2016

Solving non-linear Horn clauses using a linear Horn clause solver.
Proceedings of the Proceedings 3rd Workshop on Horn Clauses for Verification and Synthesis, 2016

Bounded-oscillation Pushdown Automata.
Proceedings of the Seventh International Symposium on Games, 2016

A Language-theoretic View on Network Protocols.
CoRR, 2016

Model Checking Population Protocols.
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.
Proceedings of the Third International Workshop on Verification and Program Transformation, 2015

Model Checking Parameterized Asynchronous Shared-Memory Systems.
CoRR, 2015

From non-zenoness verification to termination.
Proceedings of the 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2015

Interprocedural Reachability for Flat Integer Programs.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Analysis of Asynchronous Programs with Event-Based Synchronization.
Proceedings of the Programming Languages and Systems, 2015

Verification of Population Protocols.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Model Checking Parameterized Asynchronous Shared-Memory Systems.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Pattern-Based Verification for Multithreaded Programs.
ACM Trans. Program. Lang. Syst., 2014

Generating Bounded Languages Using Bounded Control Sets.
CoRR, 2014

Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Parameterized Verification of Asynchronous Shared-Memory Systems
CoRR, 2013

Proving Termination Starting from the End
CoRR, 2013

Underapproximation of Procedure Summaries for Integer Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Proving Termination Starting from the End.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Parameterized Verification of Asynchronous Shared-Memory Systems.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Algorithmic verification of asynchronous programs.
ACM Trans. Program. Lang. Syst., 2012

Bounded underapproximations.
Formal Methods in System Design, 2012

Underapproximation of Procedure Summaries for Integer Programs
CoRR, 2012

A Perfect Model for Bounded Verification
CoRR, 2012

A Perfect Model for Bounded Verification.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
Parikhʼs theorem: A simple and direct automaton construction.
Inf. Process. Lett., 2011

Preface.
Electr. Notes Theor. Comput. Sci., 2011

Approximating Petri Net Reachability Along Context-free Traces
CoRR, 2011

Complexity Analysis of the Backward Coverability Algorithm for VASS.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

Complexity of pattern-based verification for multithreaded programs.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Approximating Petri Net Reachability Along Context-free Traces.
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.
Theor. Comput. Sci., 2010

Algorithmic Verification of Asynchronous Programs
CoRR, 2010

Parikh's Theorem: A simple and direct construction
CoRR, 2010

Bounded Underapproximations.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

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

Fixpoint Guided Abstraction Refinement for Alternating Automata.
Proceedings of the Implementation and Application of Automata, 2009

Verifying liveness for asynchronous programs.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Analyzing Real-Time Event-Driven Programs.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

2008
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Fundam. Inform., 2008

Parikh-Equivalent Bounded Underapproximations
CoRR, 2008

2007
Fixpoint-Guided Abstraction Refinements.
Proceedings of the Static Analysis, 14th International Symposium, 2007

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.
Proceedings of the Verification, 2006

2005
Locality-Based Abstractions.
Proceedings of the Static Analysis, 12th International Symposium, 2005

2004
Automatic Verification of Time Sensitive Cryptographic Protocols.
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.
Proceedings of the FME 2003: Formal Methods, 2003


  Loading...