Reasoning Algebraically About P-Solvable Loops
Author:
- 2 April 2008
- book chapter
- Published by Springer Nature
- p. 249-264
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Theorema: Towards computer-aided mathematical theory explorationJournal of Applied Logic, 2006
- Combining Logic and Algebraic Techniques for Program Verification in Theorema2006
- A Quantifier-Elimination Based Heuristic for Automatically Generating Inductive Assertions for ProgramsJournal of Systems Science and Complexity, 2006
- SumCracker: A package for manipulating symbolic sums and related objectsJournal of Symbolic Computation, 2006
- Interprocedurally Analyzing Polynomial Identities2006
- Recurrence Sequences2003
- Automatic discovery of linear restraints among variables of a program1978
- Affine relationships among variables of a programActa Informatica, 1976
- A synthesizer of inductive assertionsIEEE Transactions on Software Engineering, 1975
- Quantifier elimination for real closed fields by cylindrical algebraic decompostion1975