Constraint-Based Invariant Inference over Predicate Abstraction
From MaRDI portal
Recommendations
Cited in
(15)- On the complexity of the quantified bit-vector arithmetic with binary encoding
- Synthesis of domain specific CNF encoders for bit-vector solvers
- From invariant checking to invariant inference using randomized search
- Automatically inferring loop invariants via algorithmic learning
- Truncating abstraction of bit-vector operations for BDD-based SMT solvers
- Counterexample-guided precondition inference
- Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference
- Efficiently solving quantified bit-vector formulas
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
- Bugs, moles and skeletons: symbolic reasoning for software development
- Verification Constraint Problems with Strengthening
- Programming Languages and Systems
- Combining model checking and data-flow analysis
- Counterexample-Guided Model Synthesis
- Predicate generation for learning-based quantifier-free loop invariant inference
This page was built for publication: Constraint-Based Invariant Inference over Predicate Abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600470)