| No. |
Title |
Author |
Year |
| 1 |
On the Separability Problem of String Constraints |
Abdulla, Parosh Aziz et al. |
2020 |
| 2 |
Universal Safety for Timed Petri Nets is PSPACE-complete |
Abdulla, Parosh Aziz et al. |
2018 |
| 3 |
Verification of Asynchronous Programs with Nested Locks |
Atig, Mohamed Faouzi et al. |
2018 |
| 4 |
Verification of Timed Asynchronous Programs |
Abdulla, Parosh Aziz et al. |
2018 |
| 5 |
Verifying Quantitative Temporal Properties of Procedural Programs |
Atig, Mohamed Faouzi et al. |
2018 |
| 6 |
Data Multi-Pushdown Automata |
Abdulla, Parosh Aziz et al. |
2017 |
| 7 |
On the Upward/Downward Closures of Petri Nets |
Atig, Mohamed Faouzi et al. |
2017 |
| 8 |
The Benefits of Duality in Verifying Concurrent Programs under TSO |
Abdulla, Parosh Aziz et al. |
2016 |
| 9 |
What's Decidable about Availability Languages? |
Abdulla, Parosh Aziz et al. |
2015 |
| 10 |
On Bounded Reachability Analysis of Shared Memory Systems |
Atig, Mohamed Faouzi et al. |
2014 |
| 11 |
Verification of Dynamic Register Automata |
Abdulla, Parosh Aziz et al. |
2014 |
| 12 |
Timed Lossy Channel Systems |
Abdulla, Parosh Aziz et al. |
2012 |
| 13 |
Approximating Petri Net Reachability Along Context-free Traces |
Atig, Mohamed Faouzi et al. |
2011 |
| 14 |
Global Model Checking of Ordered Multi-Pushdown Systems |
Atig, Mohamed Faouzi |
2010 |
| 15 |
Analyzing Asynchronous Programs with Preemption |
Atig, Mohamed Faouzi et al. |
2008 |
