47 citations · 134 across the 31 of their papers we have counts for
10 papers · 1 filter
Checking Consistency of Event-driven Traces
Parosh Aziz Abdulla, Mohamed Faouzi Atig, R. Govind +2
Event-driven programming is a popular paradigm where the flow of execution is controlled by two features: (1) shared memory and (2) sending and receiving of messages between multip…
The complexity of verifying the release-acquire semantics over register machines
Parosh Abdulla, Elli Anastasiadi, Mohamed Faouzi Atig +2
The Release-Acquire (RA) semantics and its variants are some of the most fundamental models of concurrent semantics for architectures, programming languages, and distributed system…
Parsimonious Optimal Dynamic Partial Order Reduction
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das +2
Stateless model checking is a fully automatic verification technique for concurrent programs that checks for safety violations by exploring all possible thread schedulings. It beco…
Tailoring Stateless Model Checking for Event-Driven Multi-Threaded Programs
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland +4
Event-driven multi-threaded programming is an important idiom for structuring concurrent computations. Stateless Model Checking (SMC) is an effective verification technique for mul…
Unified Fairness for Weak Memory Verification
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole +2
We consider the verification of omega-regular linear temporal properties of concurrent programs running under weak memory semantics. We observe that in particular, these properties…
Optimal Stateless Model Checking of Transactional Programs under Causal Consistency
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ashutosh Gupta +2
We present a framework for efficient stateless model checking (SMC) of concurrent programs under five prominent models of causal consistency, CCv,CM,CC, Read Committed and Read Ato…
Probabilistic Total Store Ordering
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Raj Aryan Agarwal +2
We present -- a probabilistic extension of the classical TSO semantics. For a given (finite-state) program, the operational sem…
The Decidability of Verification under Promising 2.0
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole +2
In PLDI'20, Lee et al. introduced the \emph{promising } semantics PS 2.0 of the C++ concurrency that captures most of the common program transformations while satisfying the DRF gu…
Optimal Stateless Model Checking under the Release-Acquire Semantics
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson +1
We present a framework for the efficient application of stateless model checking (SMC) to concurrent programs running under the Release-Acquire (RA) fragment of the C/C++11 memory…
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…