Optimal concolic dynamic partial order reduction

DOI10.4230/LIPICS.CONCUR.2025.26MaRDI QIDQ7310301zbMATH OpenFDO

Authors Mohammad Hossein Khoshechin Jorshari, Michalis Kokologiannakis, Rupak Majumdar, Srinidhi Nagendra

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.26

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A scalable, correct time-stamped stack
• Common2 extended to stacks and unbounded concurrency
• Concurrency of operations on B-trees
• Dynamic partial-order reduction for model checking software
• Dynamic reductions for model checking concurrent software
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• Model checking JAVA programs using JAVA PathFinder
• Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
• Optimal dynamic partial order reduction
• Optimal stateless model checking for causal consistency
• Partial order aware concurrency sampling
• Stateless model checking for TSO and PSO
• Symbolic execution and program testing
• Symbolic partial-order execution for testing multi-threaded programs
• Tools and Algorithms for the Construction and Analysis of Systems
• Unblocking dynamic partial order reduction

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

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