Decidability of inferring inductive invariants
From MaRDI portal
Publication:2828258
Recommendations
- Property-directed inference of universal invariants or proving their absence
- scientific article; zbMATH DE number 1956575
- Computer Aided Verification
- Property-directed inference of universal invariants or proving their absence
- On the decidability of the existence of polyhedral invariants in transition systems
Cited in
(15)- scientific article; zbMATH DE number 1395882 (Why is no real title available?)
- What's decidable about program verification modulo axioms?
- scientific article; zbMATH DE number 4187777 (Why is no real title available?)
- When Is Reachability Intrinsically Decidable?
- Stratified guarded first-order transition systems
- Inferring inductive invariants from phase structures
- On invariant synthesis for parametric systems
- On the decidability of the existence of polyhedral invariants in transition systems
- scientific article; zbMATH DE number 1956575 (Why is no real title available?)
- Invariant Checking for Programs with Procedure Calls
- Invariant inference with provable complexity from the monotone theory
- scientific article; zbMATH DE number 7559486 (Why is no real title available?)
- Invariant checking for SMT-based systems with quantifiers
- Deciding the Inductive Validity of ∀ ∃ * Queries
- On the Monniaux problem in abstract interpretation
This page was built for publication: Decidability of inferring inductive invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828258)