A note on Karr's algorithm
From MaRDI portal
Recommendations
Cited in
(25)- Context unification with one context variable
- A remark on the alternating algorithm
- A derivation of Kohnert's algorithm from Monk's rule
- A note on the performance of the ``Ahrens algorithm
- Intensional Kleene and Rice theorems for abstract program semantics
- Algebra-based synthesis of loops and their invariants (invited paper)
- Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
- Computing polynomial program invariants
- Generating all polynomial invariants in simple loops
- Region Analysis for Race Detection
- Invariant Checking for Programs with Procedure Calls
- Inferring Congruence Equations Using SAT
- A Note on The Row-Reduction Algorithm
- scientific article; zbMATH DE number 7559486 (Why is no real title available?)
- An accurate join for zonotopes, preserving affine input/output relations
- scientific article; zbMATH DE number 975789 (Why is no real title available?)
- What else is undecidable about loops?
- On the Monniaux problem in abstract interpretation
- Slice closures of indexed languages and word equations with counting constraints
- On strongest algebraic program invariants
- Algebraic tools for computing polynomial loop invariants
- A Rice's theorem for abstract semantics
- Algebraic and algorithmic methods for computing polynomial loop invariants
- On termination of polynomial programs with equality conditions
- Change-of-bases abstractions for non-linear hybrid systems
This page was built for publication: A note on Karr's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466534)