Consistency-Preserving Propagation for SMT Solving of Concurrent Program Verification

Explore a 13-minute conference talk from ACM SIGPLAN's OOPSLA that delves into a novel approach for concurrent program verification. Learn about a preventive reasoning method that automatically preserves ordering consistency, eliminating the need for consistency checking and conflict clause generation in SMT solving. Discover how this innovative technique, centered around happens-before orders for modeling thread interleaving behaviors, significantly improves the performance of concurrent program verifiers. Gain insights into the implementation of this approach in a prototype tool and its impressive results when tested on credible benchmarks.