|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman |
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems.  |
LATA  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine |
Counter-Example Guided Fence Insertion under TSO. |
TACAS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi |
What's Decidable about Weak Memory Models? |
ESOP |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Peter Habermehl |
On Yen's Path Logic for Petri Nets. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer |
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads |
Logical Methods in Computer Science |
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 | Mohamed Faouzi Atig, Ahmed Bouajjani, Gennaro Parlato |
Getting Rid of Store-Buffers in TSO Analysis. |
CAV |
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 | Tayssir Touili, Mohamed Faouzi Atig |
Verifying parallel programs with dynamic communication structures. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig |
From Multi to Single Stack Automata. |
CONCUR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi |
On the verification problem for weak memory models. |
POPL |
2010 |
DBLP DOI BibTeX RDF |
lossy channel systems, program verification, infinite state systems, relaxed memory models |
| 1 | Mohamed Faouzi Atig |
Global Model Checking of Ordered Multi-Pushdown Systems. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer |
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads. |
TACAS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Peter Habermehl |
On Yen's Path Logic for Petri Nets. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani |
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Tayssir Touili |
Verifying Parallel Programs with Dynamic Communication Structures. |
CIAA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili |
On the Reachability Analysis of Acyclic Networks of Pushdown Systems. |
CONCUR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl |
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili |
Analyzing Asynchronous Programs with Preemption. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")