Optimal dynamic partial order reduction

P Abdulla, S Aronis, B Jonsson, K Sagonas - ACM SIGPLAN Notices, 2014 - dl.acm.org
Stateless model checking is a powerful technique for program verification, which however
suffers from an exponential growth in the number of explored executions. A successful …

Stateless model checking for TSO and PSO

PA Abdulla, S Aronis, MF Atig, B Jonsson… - Acta Informatica, 2017 - Springer
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 …

Optimal stateless model checking under the release-acquire semantics

PA Abdulla, MF Atig, B Jonsson, TP Ngo - Proceedings of the ACM on …, 2018 - dl.acm.org
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 …

Jaaru: Efficiently model checking persistent memory programs

H Gorjiara, GH Xu, B Demsky - … of the 26th ACM International Conference …, 2021 - dl.acm.org
Persistent memory (PM) technologies combine near DRAM performance with persistency
and open the possibility of using one copy of a data structure as both a working copy and a …

Data-centric dynamic partial order reduction

M Chalupa, K Chatterjee, A Pavlogiannis… - Proceedings of the …, 2017 - dl.acm.org
We present a new dynamic partial-order reduction method for stateless model checking of
concurrent programs. A common approach for exploring program behaviors relies on …

Stateless model checking for POWER

PA Abdulla, MF Atig, B Jonsson… - … Aided Verification: 28th …, 2016 - Springer
We present the first framework for efficient application of stateless model checking (SMC) to
programs running under the relaxed memory model of POWER. The framework combines …

Source sets: A foundation for optimal dynamic partial order reduction

PA Abdulla, S Aronis, B Jonsson… - Journal of the ACM (JACM …, 2017 - dl.acm.org
Stateless model checking is a powerful method for program verification that, however,
suffers from an exponential growth in the number of explored executions. A successful …

Value-centric dynamic partial order reduction

K Chatterjee, A Pavlogiannis, V Toman - Proceedings of the ACM on …, 2019 - dl.acm.org
The verification of concurrent programs remains an open challenge, as thread interaction
has to be accounted for, which leads to state-space explosion. Stateless model checking …

Using unfoldings in automated testing of multithreaded programs

K Kähkönen, O Saarikivi, K Heljanko - Proceedings of the 27th IEEE …, 2012 - dl.acm.org
In multithreaded programs both environment input data and the nondeterministic
interleavings of concurrent events can affect the behavior of the program. One approach to …

Unfolding based automated testing of multithreaded programs

K Kähkönen, O Saarikivi, K Heljanko - Automated Software Engineering, 2015 - Springer
In multithreaded programs both environment input data and the nondeterministic
interleavings of concurrent events can affect the behavior of the program. One approach to …