47 citations · 134 across the 31 of their papers we have counts for
4 papers · 1 filter
Communicating Timed Processes with Perfect Timed Channels
Parosh Aziz Abdulla, Mohamed Faouzi Atig, S. Krishna
We introduce the model of communicating timed automata (CTA) that extends the classical models of finite-state processes communicating through FIFO perfect channels and timed autom…
Context-Bounded Model Checking for POWER
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani +1
We propose an under-approximate reachability analysis algorithm for programs running under the POWER memory model, in the spirit of the work on context-bounded analysis intitiated…
A Load-Buffer Semantics for Total Store Ordering
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani +1
We address the problem of verifying safety properties of concurrent programs running over the Total Store Order (TSO) memory model. Known decision procedures for this model are bas…
On the Upward/Downward Closures of Petri Nets
Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla +1
We study the size and the complexity of computing finite state automata (FSA) representing and approximating the downward and the upward closure of Petri net languages with coverab…