Optimal dynamic partial order reduction

DOI10.1145/2535838.2535845MaRDI QIDQ5408432zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stavros Aronis, Parosh A. Abdulla, Bengt Jonsson, K. Sagonas

Publication date 10 April 2014

Published in Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2535838.2535845

zbMATH Keywords

concurrencydynamic partial order reductionsoftware model checkingsource setssystematic testingwakeup trees

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Nonnumerical algorithms (68W05)

Recommendations

• Source sets: a foundation for optimal dynamic partial order reduction
• Quasi-optimal partial order reduction
• Quasi-optimal partial order reduction
• Optimal dynamic partial order reduction with observers
• Context-sensitive dynamic partial order reduction

Cited in

(29)

• Stateless model checking for TSO and PSO
• Approximate partial order reduction
• Quasi-optimal partial order reduction
• Context-sensitive dynamic partial order reduction
• POR for security protocol equivalences. Beyond action-determinism
• Analysis of correct synchronization of operating system components
• Optimal dynamic partial order reduction with observers
• On Distributed Monitoring and Synthesis
• Bounded symbolic execution for runtime error detection of Erlang programs
• Automated synthesis of distributed controllers
• Dynamic Partial Order Reduction Using Probe Sets
• Dynamic Path Reduction for Software Model Checking
• Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
• Generalized dynamic reduction in finite element dynamic optimization
• Source sets: a foundation for optimal dynamic partial order reduction
• Global reproducibility through local control for distributed active objects
• Quasi-optimal partial order reduction
• Constrained dynamic partial order reduction
• A pragmatic approach to stateful partial order reduction
• Quantifiability: a concurrent correctness condition modeled in vector space
• Unfolding-based dynamic partial order reduction of asynchronous distributed programs
• Reconciling preemption bounding with DPOR
• Optimal stateless model checking for causal consistency
• Unblocking dynamic partial order reduction
• 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
• Compositional correctness and completeness for symbolic partial order reduction
• Optimal concolic dynamic partial order reduction
• Stateless model checking under a reads-value-from equivalence

Describes a project that uses

Uses Software

• Erlang

This page was built for publication: Optimal dynamic partial order reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408432)