Deciding Program Properties via Complete Abstractions on Bounded Domains
No abstract available.
Related papers
- Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis POPL 2022
- Logics for Extensional, Locally Complete Analysis via Domain Refinements ESOP 2023
- Towards Complete Reasoning about Axiomatic Specifications VMCAI 2011
- Bounded model checking of signal temporal logic properties using syntactic separation POPL 2019
- Context-bounded verification of liveness properties for multithreaded shared-memory programs POPL 2021
- On the Hardness of Analyzing Quantum Programs Quantitatively ESOP 2024
- Recursive subtyping for all JFP 2025
- Early Verification of Legal Compliance via Bounded Satisfiability Checking CAV 2023