18 citations · 41 across the 11 of their papers we have counts for
11 papers
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…
Scalable Tree-based Register Automata Learning
Simon Dierl, Paul Fiterau-Brostean, Falk Howar +3
Existing active automata learning (AAL) algorithms have demonstrated their potential in capturing the behavior of complex systems (e.g., in analyzing network protocol implementatio…
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…
Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens
Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
Stateless Model Checking (SMC) is a verification technique for concurrent programs that checks for safety violations by exploring all possible thread schedulings. It is highly effe…
Scaling Reliably: Improving the Scalability of the Erlang Distributed Actor Platform
Phil Trinder, Natalia Chechina, Nikolaos Papaspyrou +22
Distributed actor languages are an effective means of constructing scalable reliable systems, and the Erlang programming language has a well-established and influential model. Whil…
Stateless Model Checking for TSO and PSO
Parosh Abdulla, Stavros Aronis, Mohammed Faouzi Atig +3
We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel represent…