Invariant Generation for Multi-Path Loops with Polynomial Assignments
- 29 December 2017
- book chapter
- Published by Springer Nature
- p. 226-246
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences2017
- Polynomial Invariants by Linear Algebra2016
- Compositional recurrence analysis2016
- Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases2012
- The Concrete Tetrahedron2011
- A Complete Invariant Generation Approach for P-solvable LoopsLecture Notes in Computer Science, 2010
- Computing the algebraic relations of C-finite sequences and multisequencesJournal of Symbolic Computation, 2008
- Reasoning Algebraically About P-Solvable Loops2008
- Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial idealJournal of Symbolic Computation, 2006
- A Note on Karr’s Algorithm2004