Using Partial Orders to Improve Automatic Verification Methods
No abstract available.
DOI 10.1007/bfb0023731
Related papers
- Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract) CAV 1993
- Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models TOPLAS 2023
- ESBMC v7.7: Efficient Concurrent Software Verification with Scheduling, Incremental SMT and Partial Order Reduction - (Competition Contribution) TACAS 2025
- Dynamic partial order reduction for relaxed memory models PLDI 2015
- Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching Haskell 2008
- Satisfiability modulo ordering consistency theory for multi-threaded program verification PLDI 2021
- Partial Order Reduction for Deep Bug Finding in Synchronous Hardware TACAS 2020
- Compositional Verification of Heap-Manipulating Programs Through Property-Guided Learning APLAS 2019