Quasi-optimal partial order reduction
From MaRDI portal
Publication:2050101
DOI10.1007/S10703-020-00350-4OpenAlexW2786247985MaRDI QIDQ2050101FDOQ2050101
Authors: Camille Coti, Laure Petrucci, César Rodríguez, Marcelo S. Sousa 
Publication date: 30 August 2021
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.03950
Recommendations
Cites Work
- Petri nets, event structures and domains. I
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Title not available (Why is that?)
- Dynamic partial-order reduction for model checking software
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unfoldings: A partial-order approach to model checking.
- Peephole Partial Order Reduction
- Title not available (Why is that?)
- Formal techniques for distributed objects, components, and systems. 39th IFIP WG 6.1 international conference, FORTE 2019, held as part of the 14th international federated conference on distributed computing techniques, DisCoTec 2019, Kongens Lyngby, Denmark, June 17--21, 2019. Proceedings
- Computer aided verification. 30th international conference, CAV 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 14--17, 2018. Proceedings. Part II
- Comparing Source Sets and Persistent Sets for Partial Order Reduction
- Optimal dynamic partial order reduction
- Quasi-optimal partial order reduction
- Unfolding-based Partial Order Reduction
- Symbolic partial-order execution for testing multi-threaded programs
- Source Sets
- Stateless Model Checking for TSO and PSO
Cited In (6)
Uses Software
This page was built for publication: Quasi-optimal partial order reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2050101)
