J. King. A Program Verifier. PhD thesis, Carnegie-Mellon University, 1969.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... verification of programs written in higher level programming languages such as Pascal [24] Lisp [6] Fortran [5] and Gypsy [15] Most of these projects are based on Floyd s inductive assertion method, and are therefore in the same spirit as the early mechanical verification work of King [32]. Our work differs from the previous work in that we address the correctness of programs at the machine code level executed on a widely used processor. In only a very few cases does research on formal, mechanical software verification address the correctness of programs at the machine code level. ....

J. C. King. A Program Verifier. PhD thesis, Carnegie-Mellon University, 1969.

....formulas to be proved. In the second step the formulas are proved using the usual laws of logic, algebra, number theory, etc. For an 1 V. Kahan, of U.C. Berkeley, reports that the algorithm was in fact advocated by Heron of Alexandria before 400 A.D. 2 introduction to program verification, see [9, 10, 11, 1]. Because the mathematics involved in program verification is often tedious and elementary, mechanical program verification systems have been developed. One such system is described in [6] That system handles a subset of ANSI FORTRAN 66 and 77 and has verified the above mentioned square root ....

J. C. King. A Program Verifier. Ph.D. Th., Carnegie-Mellon University, 1969.

....to the first location into which the values are copied. Here is how such a copy operation might be coded as a template function in C : template class T, class U 1 Although the use of symbolic execution in software verification goes back to some of the earliest program verification systems [11, 12, 13], and forward assignment axioms are sometimes mentioned in the literature (e.g. see [5, p. 120] we are not aware of any axiomatic system with this approach as its basis. U copy(T first, T last, U r) while (f = last) result = first ; return result; Instances of this algorithm can ....

J. C. King, A Program Verifier, Ph.D. thesis, Carnegie-Mellon University, 1969.

....if i is an InputIterator then it must be possible to use i as an rvalue but not necessarily as an lvalue, whereas the opposite is true of an OutputIterator . 4 Although the use of symbolic execution in software verification goes back at least to one of the earliest program verification systems [7], and forward assignment axioms are sometimes mentioned in the literature (e.g. see [2] we are not aware of any axiomatic system with this approach as its basis. 3 AXIOMS AND INFERENCE RULES FOR IMPERATIVE PROGRAMS 9 other formulations of Hoare logic) but we use both unevaluated and evaluated ....

J. C. King, A Program Verifier, Ph.D. thesis, Carnegie-Mellon University, 1969.

....over the integers or rationals (according to context) Linear integer arithmetic, and thus linear Peano arithmetic, is decidable. However, integer decision procedures (e.g. 8] are quite complicated compared to the many well known decision procedures for linear inequalities over the rationals [11], 10] 1] 16] 17] Therefore, following the tradition in program verification, we adopted a rational based procedure, exploiting the observation that if a conjunction of inequalities is unsatisfiable over the rationals it is unsatisfiable over the integers. Such a procedure is sound but ....

J. C. King. A Program Verifier. Ph.D. Th., Carnegie-Mellon University, 1969.

....verification systems based on the inductive assertion method usually consist of two main subsystems: a verification condition generator and an automatic theorem prover or proof checker to prove the verification conditions. The first mechanical program verification system was developed by King [36], a student of Floyd s. Many verification systems have been developed since [28, 35, 30, 20, 6] Using techniques similar to the generation of verification conditions it is possible to prove termination and absence of runtime errors. Consider for example the claim made for the system described in ....

J. C. King. A Program Verifier. Ph.D. Th., Carnegie-Mellon University, 1969.

.... mechanical verification of programs written in higher level programming languages such as Pascal [25] Lisp [6] Fortran [5] and Gypsy [16] Most of these projects are based on Floyd s inductive assertion method, and therefore in the same spirit as the early mechanical verification work of King [33]. Our work differs from all these works in that we address the correctness of programs at the machine code level executed on a widely used processor. It is well known that formal verification at the present time is extremely expensive. The very few cases where the cost of verification may be very ....

J. C. King. A Program Verifier. PhD thesis, Carnegie-Mellon University, 1969.

.... mechanical verification of programs written in higher level programming languages such as Pascal [25] Lisp [6] Fortran [5] and Gypsy [16] Most of these projects are based on Floyd s inductive assertion method, and therefore in the same spirit as the early mechanical verification work of King [33]. Our work differs from all these works in that we address the correctness of programs at the machine code level executed on a widely used processor. It is well known that formal verification at the present time is extremely expensive. The very few cases where the cost of verification may be very ....

J. C. King. A Program Verifier. PhD thesis, Carnegie-Mellon University, 1969.

No context found.

J. King. A Program Verifier. PhD thesis, Carnegie-Mellon University, 1969.

No context found.

J. C. King. A Program Verifier. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1969.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC