This chapter presents an overview of Model Order Reduction – a new paradigm in the field of simulationbased engineering sciences, and one that can tackle the challenges and leverage the opportunities of modern ICT technologies. Despite the impressive progress attained by simulation capabilities and techniques, a number of challenging problems remain intractable. These problems are of different ...

Abstract Existing dynamic partial order reduction (DPOR) algorithms scale poorly on concurrent data structure benchmarks because they visit a huge number of blocked executions due to spinloops. In response, we develop Awamoche , sound, complete, and strongly optimal DPOR algorithm that avoids exploring any useless in programs with await confirmation-CAS loops. Consequently, it outperforms the s...

We present a symbolic dynamic partial order reduction (POR) method for model checking concurrent software. We introduce the notion of guarded independent transitions, i.e., transitions that can be considered as independent in certain (but not necessarily all) execution paths. These can be exploited by using a new peephole reduction method. A symbolic formulation of the proposed peephole reducti...

Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the “ample set” POR framework for the verification of an LTL−X formula φ, one associates to each state s a subset Ts of the set of all transitions enabled at s. The approach requires that whenever Ts is a proper s...