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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI