Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)
Abstract elided by the publisher.
Related papers
- Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System ICFP 2024
- Using Partial Orders to Improve Automatic Verification Methods CAV 1990
- ESBMC v7.7: Efficient Concurrent Software Verification with Scheduling, Incremental SMT and Partial Order Reduction - (Competition Contribution) TACAS 2025
- A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract) CAV 1998
- Theta: Various Approaches for Concurrent Program Verification (Competition Contribution) TACAS 2025
- A framework for the integration of partial evaluation and abstract interpretation of logic programs TOPLAS 2004
- SCInfer: Refinement-Based Verification of Software Countermeasures Against Side-Channel Attacks CAV 2018
- Precise Verification of Transformers Through ReLU-Catalyzed Abstraction Refinement CAV 2026