Quasi-optimal partial order reduction
From MaRDI portal
Publication:2050101
Recommendations
Cites work
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 3651760 (Why is no real title available?)
- scientific article; zbMATH DE number 140487 (Why is no real title available?)
- scientific article; zbMATH DE number 7088727 (Why is no real title available?)
- Comparing Source Sets and Persistent Sets for Partial Order Reduction
- 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
- Dynamic partial-order reduction for model checking software
- 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
- Optimal dynamic partial order reduction
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Peephole Partial Order Reduction
- Petri nets, event structures and domains. I
- Quasi-optimal partial order reduction
- Source sets: a foundation for optimal dynamic partial order reduction
- Stateless model checking for TSO and PSO
- Symbolic partial-order execution for testing multi-threaded programs
- Unfolding-based partial order reduction
- Unfoldings: A partial-order approach to model checking.
Cited in
(10)- Dynamic Partial Order Reduction Using Probe Sets
- Context-sensitive dynamic partial order reduction
- Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
- Optimal dynamic partial order reduction
- Partial-Order Reduction
- Quasi-optimal partial order reduction
- Unfolding-based partial order reduction
- Constrained dynamic partial order reduction
- Unblocking dynamic partial order reduction
- Source sets: a foundation for optimal dynamic partial order reduction
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)