Last update: June, 2018

Pierre Ganty @ DBLP, @ Google Scholar, @ GitHub

Associate Research Professor at the IMDEA Software Institute

Latest Work

Venue Title
CONCUR 2018 Verification of Immediate Observation Population Protocols
LICS 2018 Sound up-to techniques and Complete abstract domains
TPLP 2017 Tree dimension in verification of constrained Horn clauses
arXiv report of the accepted version
FCT 2017 Parikh Image of Pushdown Automata
ATVA 2017 Fixing the State Budget: Approximation of Regular Languages with Small DFAs
ATVA 2017 A Language-theoretic View on Network Protocols
‣ this arXiv report contains a preliminary version
FSTTCS 2016 Model Checking Population Protocols
FMSD 2016 Model Checking Parameterized Asynchronous Shared-Memory Systems
GandALF 2016 Bounded-oscillation pushdown automata
Acta Inf. 2016 Verification of Population Protocols
STTT 2016 Underapproximation of procedure summaries for integer programs
‣ this arXiv report is the most up to date version
JACM 2016 Parameterized Verification of Asynchronous Shared-Memory Systems
HCVS 2016 Solving non-linear Horn clauses using a linear Horn clause solver
MEMOCODE 2015 From Non-Zenoness Verification to Termination
CONCUR 2015 Verification of Population Protocols
FCT 2015 Interprocedural Reachability for Flat Integer Programs
arXiv report
CAV 2015 Model Checking Parameterized Asynchronous Shared-Memory Systems
arXiv report
VPT 2015 Decomposition by Tree Dimension in Horn Clause Verification

Complete list (dblp)

Short Bio

Pierre joined the IMDEA Software Institute in September 2009 after completing a nearly two years postdoc at the UCLA. He holds a joint PhD degree in Computer Science from the Université Libre de Bruxelles and from the Università Degli Studi di Genova, Italy that he obtained late 2007.

Further details in my CV.

Research Interests

Algorithmic verification techniques: design, complexity study and implementation. Verification of software systems with infinitely many states: unbounded control and/or data. Algorithmic model based bug finding techniques. Abstract Interpretation. Automatic refinement of abstract domains. Automata theory and Formal Languages. Petri nets.



Recent and Upcoming Service


IMDEA Software Institute
Edificio IMDEA Software
Campus Montegancedo UPM
28223-Pozuelo de Alarcón, Madrid
Office: 356
Telephone: +34-91-101-2202 ext 4106

Copyright © 2018 Pierre Ganty