English | Español Contact Institutes

Menu:

Latest News:

Aleks Nanevski (Ph.D. Carnegie Mellon, 2004) has joined IMDEA-Software as an Assistant Research Professor. He previously held a postdoctoral researcher position at Microsoft Research Cambridge. [Read More]

Pierre Ganty (Ph.D. Université Libre de Bruxelles, 2007) recently joined IMDEA-Software as an Assistant Research Professor. He previously held a postdoctoral position at UCLA.[Read More]


Other IMDEA Software news

Pierre Ganty

Assistant Research Professor (tenure-track)

Pierre Ganty Contact information:

Fundación IMDEA Software
Facultad de Informática (UPM) -- office 3301
Campus Montegancedo
28660-Boadilla del Monte, Madrid
SPAIN

Office: 3325
Phone: +34-91-336-3742 ext 3325
Fax: +34-91-336-5018
Email:
Short bio
Pierre joined IMDEA Software in September 2009 after completing a nearly two years postdoc at the University of California, Los Angeles (UCLA). He holds a joint PhD degree in Computer Science from the Université Libre de Bruxelles (ULB), Belgium and from the Universitá Degli Studi di Genova, Italy that he obtained late 2007. Further details in my CV. [17-Mar-2010]
Research Interests (no order)
Verification of systems with infinitely many states. Abstraction refinement techniques for verification. Bounded analysis techniques. Logic and automata theory. Algorithms and tools for the design and verification of reactive and distributed systems. Program analysis. Formal models for distributed systems: Petri nets.
Publications
Here is a PDF file of my publications (papers can be downloaded from the file). [17-Mar-2010]
Software
Here is a webpage which briefly sum up various analysis techniques we developed and implemented for a useful class of discrete infinite state systems. All those techniques rely on a symbolic data structure called Interval Sharing Trees. The source code has been made available under the GPL license.
Announcement

  • Complexity of Pattern-based Verification for Multithreaded Programs with Javier Esparza. Submitted. [July 2010]
  • Parikh's Theorem: A simple and direct construction. with Javier Esparza, Stefan Kiefer and Michael Luttenberger. See the arxiv report. [June 2010]
  • Underapproximations of Reachability using Bounded Languages. with Rupak Majumdar. Submitted.
  • Bounded Underapproximations. with Benjamin Monmege and Rupak Majumdar. CAV'10. See the arxiv report.
  • If you are interested in an intership (see this proposal) or PhD at IMDEA Software that closely relate to my research interests, send me an email and fill in the appropriate forms available from the Open Positions entry in the left menu.
Events
  • APNOC 2010, 2nd Workshop on Abstractions for Petri Nets and Other Models of Concurrency. (PC member)
  • Bytecode 2011, 6th Workshop on Bytecode Semantics, Verification, Analysis and Transformation (PC co-chair)

Updated: Tue Jul 20 10:49:00 CEST 2010
Copyright © 2010 Pierre Ganty