Source sets: a foundation for optimal dynamic partial order reduction
From MaRDI portal
concurrencydynamic partial order reductionsoftware model checkingsource setssystematic testingwakeup trees
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(14)- Quasi-optimal partial order reduction
- Context-sensitive dynamic partial order reduction
- Computing race variants in message-passing concurrent programming with selective receives
- Comparing Source Sets and Persistent Sets for Partial Order Reduction
- Optimal dynamic partial order reduction
- Quasi-optimal partial order reduction
- Prefix-based tracing in message-passing concurrency
- A pragmatic approach to stateful partial order reduction
- Reconciling preemption bounding with DPOR
- Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
- Awaiting for Godot: stateless model checking that avoids executions where nothing happens
- Partial-order reduction is hard
- Stateless model checking under a reads-value-from equivalence
This page was built for publication: Source sets: a foundation for optimal dynamic partial order reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640276)
