We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagi...
Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orde...
Steven Lauterburg, Rajesh K. Karmani, Darko Marino...
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...
Mark Brodie, Irina Rish, Sheng Ma, Natalia Odintso...