Proving Parameterized Systems Safe by Generalizing Clausal Proofs of Small Instances
No abstract available.
Related papers
- Parameterized Infinite-State Reactive Synthesis POPL 2026
- Encoding Redundancy for Satisfaction-Driven Clause Learning TACAS 2019
- Clausal Proofs for Pseudo-Boolean Reasoning TACAS 2022
- Code2Inv: A Deep Learning Framework for Program Verification CAV 2020
- Complete Local Reasoning About Parameterized Programs Over Topologies CAV 2026
- Compositional soundness proofs of abstract interpreters ICFP 2018
- 1-2-3-Go! Policy Synthesis for Parameterized Markov Decision Processes via Decision-Tree Learning and Generalization VMCAI 2025
- RepLib: a library for derivable type classes Haskell 2006