|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 25 publication records. Showing 25 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pierre Ganty, Rupak Majumdar |
Algorithmic verification of asynchronous programs.  |
ACM Trans. Program. Lang. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Pierre Ganty, Rupak Majumdar |
A Perfect Model for Bounded Verification |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Pierre Ganty, Rupak Majumdar, Benjamin Monmege |
Bounded underapproximations. |
Formal Methods in System Design |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger |
Parikhʼs theorem: A simple and direct automaton construction. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Mark Marron |
Preface. |
Electr. Notes Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Mohamed Faouzi Atig |
Approximating Petri Net Reachability Along Context-free Traces |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Javier Esparza, Pierre Ganty |
Complexity of pattern-based verification for multithreaded programs. |
POPL |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Bozzelli, Pierre Ganty |
Complexity Analysis of the Backward Coverability Algorithm for VASS. |
RP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Pierre Ganty |
Approximating Petri Net Reachability Along Context-free Traces. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Nicolas Maquet, Jean-François Raskin |
Fixed point guided abstraction refinement for alternating automata. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Rupak Majumdar |
Algorithmic Verification of Asynchronous Programs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger |
Parikh's Theorem: A simple and direct construction |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre Ganty, Rupak Majumdar, Benjamin Monmege |
Bounded Underapproximations. |
CAV |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Technique et Science Informatiques |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pierre Ganty, Rupak Majumdar |
Analyzing Real-Time Event-Driven Programs. |
FORMATS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko |
Verifying liveness for asynchronous programs. |
POPL |
2009 |
DBLP DOI BibTeX RDF |
asynchronous (event-driven) programming, fair termination, petri nets, liveness |
| 1 | Pierre Ganty, Nicolas Maquet, Jean-François Raskin |
Fixpoint Guided Abstraction Refinement for Alternating Automata. |
CIAA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Jean-François Raskin, Laurent Van Begin |
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. |
Fundam. Inform. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Pierre Ganty, Rupak Majumdar, Benjamin Monmege |
Parikh-Equivalent Bounded Underapproximations |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Pierre Ganty, Jean-François Raskin, Laurent Van Begin |
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. |
ICATPN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Cousot, Pierre Ganty, Jean-François Raskin |
Fixpoint-Guided Abstraction Refinements. |
SAS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Jean-François Raskin, Laurent Van Begin |
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. |
VMCAI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Pierre Ganty, Stefan Schwoon |
Locality-Based Abstractions. |
SAS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Delzanno, Pierre Ganty |
Automatic Verification of Time Sensitive Cryptographic Protocols. |
TACAS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Armando, Luca Compagna, Pierre Ganty |
SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis. |
FME |
2003 |
DBLP DOI BibTeX RDF |
SAT encodings, security protocols, bounded model-checking, SAT-solvers |
Displaying result #1 - #25 of 25 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")