Abstract
We have described Ariel and the approach to program verification upon which it is based. The full paper includes a sample verification of a numerical program. We have built a prototype verification system and are in the process of trying it out on a suite of production numerical routines. These routines implement a continuous simulation of a rocket trajectory. They comprise about 1400 lines of C code (translated from the original FORTRAN) and calculate such things as a solution to the two-body problem, a Runge-Kutta integration, a Newton-Raphson iteration to solve a version of Kepler's equation, etc. Our prototype verifys programs written in a subset of C; we are extending the C system to handle Unix system calls and are in the process of designing a new system for (a subset of) Ada.
Extended Abstract
Funded by the U.S. Air Force, RADC contract F30602-86-C-0116 and the STARS program contract BOA #3695.STARS-043.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Mark Bickford, Charlie Mills, and Edward A. Schneider. Clio: An Applicative Language-Based Verification System. Odyssey Research Associates Technical Report TR 15-7. April, 1989.
S.L. Hantler and J.C. King. An introduction to proving the correctness of programs. ACM Computing Surveys, 8(3):331–353, September, 1976.
Albert E. Hurd and Peter A. Loeb, An Introduction to Nonstandard Real Analysis. Academic Press, 1985.
Gordon D. Plotkin. A Structural Approach to Operational Semantics. DAIMI FN-19. Computer Science Department. Aarhus University, Denmark. September, 1981.
Ian Sutherland. A Mathematical Theory of Asymptotic Computation. Rome Air Development Center Technical Report RADC-TR-87-261, Air Force Systems Command, Griffiss Air Force Base, NY. 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morris, J.M., Howard, M. (1991). Program verification by symbolic execution of hyperfinite ideal machines. In: Clarke, E.M., Kurshan, R.P. (eds) Computer-Aided Verification. CAV 1990. Lecture Notes in Computer Science, vol 531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023746
Download citation
DOI: https://doi.org/10.1007/BFb0023746
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54477-7
Online ISBN: 978-3-540-38394-9
eBook Packages: Springer Book Archive