4 papers · 1 filter
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…
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…
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…
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…