SAT-Based Compositional Verification Using Lazy Learning
Abstract elided by the publisher.
Related papers
- Lazy Self-composition for Security Verification CAV 2018
- Symbolic Compositional Verification by Learning Assumptions CAV 2005
- Learning Assumptions for Compositional Verification TACAS 2003
- Learning Minimal Separating DFA's for Compositional Verification TACAS 2009
- Bounded Verification of Multi-threaded Programs via Lazy Sequentialization TOPLAS 2022
- A Scalable and Nearly Uniform Generator of SAT Witnesses CAV 2013
- Timed Automata Verification and Synthesis via Finite Automata Learning TACAS 2023
- Learning Assumptions for Compositional Verification of Timed Automata CAV 2023