Program verification through computer algebra

Authors:
Zhou Chaochen
Affiliations:
Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Year:
2006

Citing 2
Cited 0

Recent advances on determining the number of real roots of parametric polynomials

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
An algorithm for isolating the real solutions of semi-algebraic systems

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is to advocate the approach to reducing program verification to the algebraic symbolic computation. Recent advances indicate that various verification problems can be reduced to semi-algebraic systems (SAS for short), and resolved through computer algebra tools. In this talk, we report our encouraging attempts at applying DISCOVERER to program termination analysis and state reachability computation. DISCOVERER is a Maple program implementing an algorithm of real solution classification and isolation for SAS, which is based on the discovery of complete discrimination systems of parametric polynomials. The talk also concludes that this approach deserves further attention from the program verification community. For theoretical and technical details of the work, we refer the reader to [1,2,3,4,5].