Relaxed Visibility Enhances Partial Order Reduction
Abstract elided by the publisher.
Related papers
- Dynamic partial order reduction for relaxed memory models PLDI 2015
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT TACAS 2017
- ESBMC v7.7: Efficient Concurrent Software Verification with Scheduling, Incremental SMT and Partial Order Reduction - (Competition Contribution) TACAS 2025
- A Calculus for Relaxed Memory POPL 2015
- Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings CAV 2008
- Weak-consistency specification via visibility relaxation POPL 2019
- Maximal causality reduction for TSO and PSO OOPSLA 2016
- Verifying Visibility-Based Weak Consistency ESOP 2020