default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Ganty
Person information
- affiliation: Université Libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c45]Kyveli Doveri
, Pierre Ganty, Chana Weil-Kennedy:
A Uniform Framework for Language Inclusion Problems. Taming the Infinities of Concurrency 2024: 155-171- [c44]Pierre Ganty, Nicolas Manini, Francesco Ranzato:
Computing Reachable Simulations on Transition Systems. RP 2024: 21-37 - [c43]Pierre Ganty:
Learning the State Machine Behind a Modal Text Editor: The (Neo)Vim Case Study. SPIN 2024: 167-175 - [i26]Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy:
A Uniform Framework for Language Inclusion Problems. CoRR abs/2404.09862 (2024) - [i25]Kyveli Doveri, Pierre Ganty, B. Srivathsan:
A Myhill-Nerode style Characterization for Timed Automata With Integer Resets. CoRR abs/2410.02464 (2024) - 2023
- [c42]Kyveli Doveri, Pierre Ganty, Luka Hadzi-Dokic:
Antichains Algorithms for the Inclusion Problem Between ømega-VPL. TACAS (1) 2023: 290-307 - 2022
- [c41]Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi:
FORQ-Based Language Inclusion Formal Testing. CAV (2) 2022: 109-129 - [e5]Pierre Ganty, Dario Della Monica:
Proceedings of the 13th International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2022, Madrid, Spain, September 21-23, 2022. EPTCS 370, 2022 [contents] - [i24]Pierre Ganty, Nicolas Manini, Francesco Ranzato:
Online Simulation Reduction. CoRR abs/2204.11804 (2022) - [i23]Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi:
FORQ-based Language Inclusion Formal Testing. CoRR abs/2207.13549 (2022) - 2021
- [j14]Pierre Ganty, Elena Gutiérrez, Pedro Valero:
A Congruence-Based Perspective on Finite Tree Automata. Fundam. Informaticae 184(1): 1-47 (2021) - [j13]Pierre Ganty, Francesco Ranzato, Pedro Valero:
Complete Abstractions for Checking Language Inclusion. ACM Trans. Comput. Log. 22(4): 22:1-22:40 (2021) - [c40]Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato:
Inclusion Testing of Büchi Automata Based on Well-Quasiorders. CONCUR 2021: 3:1-3:22 - [e4]Pierre Ganty, Davide Bresolin:
Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Padua, Italy, 20-22 September 2021. EPTCS 346, 2021 [contents] - [i22]Pierre Ganty, Elena Gutiérrez, Pedro Valero:
A Congruence-Based Perspective on Finite Tree Automata. CoRR abs/2104.11453 (2021) - 2020
- [c39]Pierre Ganty, Elena Gutiérrez, Pedro Valero:
A Quasiorder-Based Perspective on Residual Automata. MFCS 2020: 40:1-40:14 - [c38]Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf:
CacheQuery: learning replacement policies from hardware caches. PLDI 2020: 519-532 - [i21]Pierre Ganty, Elena Gutiérrez, Pedro Valero:
A Quasiorder-based Perspective on Residual Automata. CoRR abs/2007.00359 (2020)
2010 – 2019
- 2019
- [c37]Pierre Ganty, Pedro Valero:
Regular Expression Search on Compressed Text. DCC 2019: 528-537 - [c36]Pierre Ganty, Elena Gutiérrez, Pedro Valero:
A Congruence-based Perspective on Automata Minimization Algorithms. MFCS 2019: 77:1-77:14 - [c35]Pierre Ganty, Francesco Ranzato, Pedro Valero:
Language Inclusion Algorithms as Complete Abstract Interpretations. SAS 2019: 140-161 - [e3]Pierre Ganty, Mohamed Kaâniche:
Verification and Evaluation of Computer and Communication Systems - 13th International Conference, VECoS 2019, Porto, Portugal, October 9, 2019, Proceedings. Lecture Notes in Computer Science 11847, Springer 2019, ISBN 978-3-030-35091-8 [contents] - [i20]Pierre Ganty, Pedro Valero:
Regular Expression Search on Compressed Text. CoRR abs/1901.05252 (2019) - [i19]Pierre Ganty, Francesco Ranzato, Pedro Valero:
Complete Abstractions for Checking Language Inclusion. CoRR abs/1904.01388 (2019) - [i18]Pierre Ganty, Elena Gutiérrez, Pedro Valero:
A Congruence-based Perspective on Automata Minimization Algorithms. CoRR abs/1906.06194 (2019) - [i17]Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf:
CacheQuery: Learning Replacement Policies from Hardware Caches. CoRR abs/1912.09770 (2019) - 2018
- [j12]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Tree dimension in verification of constrained Horn clauses. Theory Pract. Log. Program. 18(2): 224-251 (2018) - [c34]Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy:
Verification of Immediate Observation Population Protocols. CONCUR 2018: 31:1-31:16 - [c33]Pierre Ganty, Elena Gutiérrez:
The Parikh Property for Weighted Context-Free Grammars. FSTTCS 2018: 32:1-32:20 - [c32]Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic:
Sound up-to techniques and Complete abstract domains. LICS 2018: 175-184 - [i16]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Tree dimension in verification of constrained Horn clauses. CoRR abs/1803.01448 (2018) - [i15]Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic:
Sound up-to techniques and Complete abstract domains. CoRR abs/1804.10507 (2018) - [i14]Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy:
Verification of Immediate Observation Population Protocols. CoRR abs/1807.06071 (2018) - [i13]Pierre Ganty, Elena Gutiérrez:
The Parikh Property for Weighted Context-Free Grammars. CoRR abs/1810.01351 (2018) - 2017
- [j11]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Verification of population protocols. Acta Informatica 54(2): 191-215 (2017) - [j10]Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar:
Model checking parameterized asynchronous shared-memory systems. Formal Methods Syst. Des. 50(2-3): 140-167 (2017) - [j9]Pierre Ganty, Radu Iosif, Filip Konecný:
Underapproximation of procedure summaries for integer programs. Int. J. Softw. Tools Technol. Transf. 19(5): 565-584 (2017) - [c31]Graeme Gange, Pierre Ganty, Peter J. Stuckey:
Fixing the State Budget: Approximation of Regular Languages with Small DFAs. ATVA 2017: 67-83 - [c30]Pierre Ganty, Boris Köpf, Pedro Valero:
A Language-Theoretic View on Network Protocols. ATVA 2017: 363-379 - [c29]Pierre Ganty, Elena Gutiérrez:
Parikh Image of Pushdown Automata. FCT 2017: 271-283 - [i12]Pierre Ganty, Elena Gutiérrez:
Parikh Image of Pushdown Automata. CoRR abs/1706.08315 (2017) - 2016
- [j8]Javier Esparza, Pierre Ganty, Rupak Majumdar:
Parameterized Verification of Asynchronous Shared-Memory Systems. J. ACM 63(1): 10:1-10:48 (2016) - [c28]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Model Checking Population Protocols. FSTTCS 2016: 27:1-27:14 - [c27]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Solving non-linear Horn clauses using a linear Horn clause solver. HCVS@ETAPS 2016: 33-48 - [c26]Pierre Ganty, Damir Valput:
Bounded-oscillation Pushdown Automata. GandALF 2016: 178-197 - [e2]Pierre Ganty, Michele Loreti:
Trustworthy Global Computing - 10th International Symposium, TGC 2015, Madrid, Spain, August 31 - September 1, 2015 Revised Selected Papers. Lecture Notes in Computer Science 9533, Springer 2016, ISBN 978-3-319-28765-2 [contents] - [i11]Pierre Ganty, Boris Köpf, Pedro Valero:
A Language-theoretic View on Network Protocols. CoRR abs/1610.07198 (2016) - 2015
- [c25]Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar:
Model Checking Parameterized Asynchronous Shared-Memory Systems. CAV (1) 2015: 67-84 - [c24]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Verification of Population Protocols. CONCUR 2015: 470-482 - [c23]Michael Emmi, Pierre Ganty, Rupak Majumdar, Fernando Rosa-Velardo:
Analysis of Asynchronous Programs with Event-Based Synchronization. ESOP 2015: 535-559 - [c22]Pierre Ganty, Radu Iosif:
Interprocedural Reachability for Flat Integer Programs. FCT 2015: 133-145 - [c21]Pierre Ganty, Samir Genaim, Ratan Lal, Pavithra Prabhakar:
From non-zenoness verification to termination. MEMOCODE 2015: 228-237 - [c20]Bishoksan Kafle, John P. Gallagher, Pierre Ganty:
Decomposition by tree dimension in Horn clause verification. VPT@ETAPS 2015: 1-14 - [i10]Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar:
Model Checking Parameterized Asynchronous Shared-Memory Systems. CoRR abs/1505.06588 (2015) - 2014
- [j7]Javier Esparza, Pierre Ganty, Tomás Poch:
Pattern-Based Verification for Multithreaded Programs. ACM Trans. Program. Lang. Syst. 36(3): 9:1-9:29 (2014) - [c19]Pierre Ganty, Ahmed Rezine:
Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification. LATA 2014: 396-408 - [i9]Pierre Ganty, Radu Iosif:
Generating Bounded Languages Using Bounded Control Sets. CoRR abs/1405.3069 (2014) - 2013
- [c18]Javier Esparza, Pierre Ganty, Rupak Majumdar:
Parameterized Verification of Asynchronous Shared-Memory Systems. CAV 2013: 124-140 - [c17]Pierre Ganty, Samir Genaim:
Proving Termination Starting from the End. CAV 2013: 397-412 - [c16]Pierre Ganty, Radu Iosif, Filip Konecný:
Underapproximation of Procedure Summaries for Integer Programs. TACAS 2013: 245-259 - [i8]Pierre Ganty, Samir Genaim:
Proving Termination Starting from the End. CoRR abs/1302.4539 (2013) - [i7]Javier Esparza, Pierre Ganty, Rupak Majumdar:
Parameterized Verification of Asynchronous Shared-Memory Systems. CoRR abs/1304.1185 (2013) - 2012
- [j6]Pierre Ganty, Rupak Majumdar, Benjamin Monmege:
Bounded underapproximations. Formal Methods Syst. Des. 40(2): 206-231 (2012) - [j5]Pierre Ganty, Rupak Majumdar:
Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. 34(1): 6:1-6:48 (2012) - [c15]Javier Esparza, Pierre Ganty, Rupak Majumdar:
A Perfect Model for Bounded Verification. LICS 2012: 285-294 - [i6]Javier Esparza, Pierre Ganty, Rupak Majumdar:
A Perfect Model for Bounded Verification. CoRR abs/1201.3194 (2012) - [i5]Pierre Ganty, Radu Iosif, Filip Konecný:
Underapproximation of Procedure Summaries for Integer Programs. CoRR abs/1210.4289 (2012) - 2011
- [j4]Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikhʼs theorem: A simple and direct automaton construction. Inf. Process. Lett. 111(12): 614-619 (2011) - [c14]Mohamed Faouzi Atig, Pierre Ganty:
Approximating Petri Net Reachability Along Context-free Traces. FSTTCS 2011: 152-163 - [c13]Javier Esparza, Pierre Ganty:
Complexity of pattern-based verification for multithreaded programs. POPL 2011: 499-510 - [c12]Laura Bozzelli, Pierre Ganty:
Complexity Analysis of the Backward Coverability Algorithm for VASS. RP 2011: 96-109 - [c11]Pierre Ganty, Mark Marron:
Preface. Bytecode@ETAPS 2011: 1 - [e1]Pierre Ganty, Mark Marron:
Proceedings of the Sixth Workshop on Bytecode Semantics, Verification, Analysis and Transformation, Bytecode@ETAPS 2011, Saarbrücken, Germany, March 27, 2011. Electronic Notes in Theoretical Computer Science 279(1), Elsevier 2011 [contents] - [i4]Pierre Ganty, Mohamed Faouzi Atig:
Approximating Petri Net Reachability Along Context-free Traces. CoRR abs/1105.1657 (2011) - 2010
- [j3]Pierre Ganty, Nicolas Maquet, Jean-François Raskin:
Fixed point guided abstraction refinement for alternating automata. Theor. Comput. Sci. 411(38-39): 3444-3459 (2010) - [c10]Pierre Ganty, Rupak Majumdar, Benjamin Monmege:
Bounded Underapproximations. CAV 2010: 600-614 - [i3]Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikh's Theorem: A simple and direct construction. CoRR abs/1006.3825 (2010) - [i2]Pierre Ganty, Rupak Majumdar:
Algorithmic Verification of Asynchronous Programs. CoRR abs/1011.0551 (2010)
2000 – 2009
- 2009
- [j2]Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents. Tech. Sci. Informatiques 28(9): 1107-1142 (2009) - [c9]Pierre Ganty, Rupak Majumdar:
Analyzing Real-Time Event-Driven Programs. FORMATS 2009: 164-178 - [c8]Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko:
Verifying liveness for asynchronous programs. POPL 2009: 102-113 - [c7]Pierre Ganty, Nicolas Maquet, Jean-François Raskin:
Fixpoint Guided Abstraction Refinement for Alternating Automata. CIAA 2009: 155-164 - 2008
- [j1]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. Fundam. Informaticae 88(3): 275-305 (2008) - [i1]Pierre Ganty, Rupak Majumdar, Benjamin Monmege:
Parikh-Equivalent Bounded Underapproximations. CoRR abs/0809.1236 (2008) - 2007
- [c6]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN 2007: 124-143 - [c5]Patrick Cousot, Pierre Ganty, Jean-François Raskin:
Fixpoint-Guided Abstraction Refinements. SAS 2007: 333-348 - 2006
- [c4]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI 2006: 49-64 - 2005
- [c3]Javier Esparza, Pierre Ganty, Stefan Schwoon:
Locality-Based Abstractions. SAS 2005: 118-134 - 2004
- [c2]Giorgio Delzanno, Pierre Ganty:
Automatic Verification of Time Sensitive Cryptographic Protocols. TACAS 2004: 342-356 - 2003
- [c1]Alessandro Armando, Luca Compagna, Pierre Ganty:
SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis. FME 2003: 875-893
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
