Combining Parallel Emptiness Checks with Partial Order Reductions

In explicit state model checking of concurrent systems, multi-core emptiness checks and partial order reductions (POR) are two major techniques to handle large state spaces. The first one tries to take advantage of multi-core architectures while the second one may decrease exponentially the size of the state space to explore.

[1]  Fabrice Kordon,et al.  Heuristics for Checking Liveness Properties with Partial Order Reductions , 2016, ATVA.

[2]  Alexandre Duret-Lutz,et al.  Spot 2 . 0 — a framework for LTL and ω-automata manipulation , 2016 .

[3]  Stephen F. Siegel.  What's Wrong with On-the-Fly Partial Order Reduction , 2019, CAV.

[4]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[5]  Alfons Laarman,et al.  Improved on-the-Fly Livelock Detection , 2013, NASA Formal Methods.

[6]  Fabrice Kordon,et al.  Variations on parallel explicit emptiness checks for generalized Büchi automata , 2017, International Journal on Software Tools for Technology Transfer.

[7]  Lubos Brim,et al.  Parallel Partial Order Reduction with Topological Sort Proviso , 2010, 2010 8th IEEE International Conference on Software Engineering and Formal Methods.

[8]  Alfons Laarman,et al.  Multi-core on-the-fly SCC decomposition , 2016, PPoPP.

[9]  Doron A. Peled.  Combining Partial Order Reductions with On-the-fly Model-Checking , 1994, CAV.

[10]  Jaco van de Pol,et al.  Multi-core SCC-Based LTL Model Checking , 2016, Haifa Verification Conference.

[11]  Flavio Lerda,et al.  Distributed-Memory Model Checking with SPIN , 1999, SPIN.

[12]  Ganesh Gopalakrishnan,et al.  An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation , 2002, Formal Methods Syst. Des..

[13]  Jean-Michel Couvreur,et al.  On-the-Fly Verification of Linear Temporal Logic , 1999, World Congress on Formal Methods.

[14]  Elwin Pater,et al.  Partial Order Reduction for PINS , 2011 .

[15]  Radek Pelánek,et al.  BEEM: Benchmarks for Explicit Model Checkers , 2007, SPIN.

[16]  Alfons Laarman,et al.  Guard-based partial-order reduction , 2013, International Journal on Software Tools for Technology Transfer.

[17]  Doron A. Peled,et al.  Relaxed Visibility Enhances Partial Order Reduction , 2001, Formal Methods Syst. Des..

[18]  Sami Evangelista,et al.  Solving the ignoring problem for partial order reduction , 2010, International Journal on Software Tools for Technology Transfer.

[19]  Fabrice Kordon,et al.  Parallel Explicit Model Checking for Generalized Büchi Automata , 2015, TACAS.

[20]  Alexandre Duret-Lutz,et al.  Spot 2.0 - A Framework for LTL and \omega -Automata Manipulation , 2016, ATVA.

[21]  Radek Pelánek,et al.  Properties of state spaces and their applications , 2008, International Journal on Software Tools for Technology Transfer.

[22]  Antti Valmari.  More Stubborn Set Methods for Process Algebras , 2017, Concurrency, Security, and Puzzles.

[23]  Dragan Bosnacki,et al.  Partial-order reduction for general state exploring algorithms , 2006, International Journal on Software Tools for Technology Transfer.

[24]  Alfons Laarman,et al.  Partial-Order Reduction for Multi-core LTL Model Checking , 2014, Haifa Verification Conference.

[25]  Mihalis Yannakakis,et al.  On nested depth first search , 1996, The Spin Verification System.

[26]  Alex Groce,et al.  Swarm Verification Techniques , 2011, IEEE Transactions on Software Engineering.

[27]  Antti Valmari,et al.  Safety Property-Driven Stubborn Sets , 2016, RP.

[28]  Alfons Laarman,et al.  Improved Multi-Core Nested Depth-First Search , 2012, ATVA.

[29]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..