2014/01/07 by Garry Pantelis, Pantelis, Garry · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #Computational Geometry and Mesh Generation #acm:03Fxx #cs.MS #cs.SE #msc:03Fxx
paper · pdf · doi:10.48550/arxiv.1401.1290
arxiv created 2014/01/07 · arxiv updated 2014/01/08
These notes outline a formal method for program verification of numerical computation. It forms the basis of the software package VPC in its initial phase of development. Much of the style of presentation is in the form of notes that outline the definitions and rules upon which VPC is based. The initial motivation of this project was to address some practical issues of computation, especially of numerically intensive programs that are commonplace in computer models. The project evolved into a wider area for program construction as proofs leading to a model of inference in a more general sense. Some basic results of machine arithmetic are derived as a demonstration of VPC.