Symbolic Computation and Automated Reasoning for Program Analysis
Author:
- 24 May 2016
- book chapter
- Published by Springer Nature
- p. 20-27
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- The vampire and the FOOL2016
- Reasoning About Loops Using Vampire in KeY2015
- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals2013
- A Complete Invariant Generation Approach for P-solvable LoopsLecture Notes in Computer Science, 2010
- 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 Practical and Complete Approach to Predicate Refinement2006
- Generating efficient test sets with a model checker2004
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints1977
- Quantifier elimination for real closed fields by cylindrical algebraic decompostion1975