Robert S. Boyer, M. W. Green, and J S. Moore. The use of a formal simulator to verify a simple real-time control program. In Beauty is Our Business, pages 54--66. Springer-Verlag, 1990. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Machine-Checked Real-Time System Verificatio - Wilding (1996) (Correct)
....151 automatically with this system. Some real time system correctness theorems have been proved using a mechanical theorem prover. A simple model of a rowboat is constructed in which it travels down a river and the boat is acted upon by wind and force exerted by an actuator under program control [12]. Both the wind and actuator forces are integral units of unspecified size. There is a sensor that detects the position of the boat with respect to the centerline of the river, and the controller adjusts the actuator such that the boat stays close to this centerline. The control algorithm adjusts ....
....instantaneous updates of the actuator using the algorithm, several nice theorems are proved that suggest that this algorithm is effective in controlling the boat. The requirements on an implementation of the rowboat controller are not obviously derivable from the algorithm and model presented in [12]. For example, to conform to the simple model the program needs to take no time to execute. Young presents an Nqthm based specification of a simple real time system [60] Similar in style to the rowboat, it captures the requirements of a railroad crossing. The behavior of the train, a railway ....
Robert S. Boyer, M. W. Green, and J S. Moore. The use of a formal simulator to verify a simple real-time control program. In Beauty is Our Business, pages 54--66. Springer-Verlag, 1990.
The Boyer-Moore Theorem Prover and Its Interactive Enhancement - Boyer, Kaufmann, Moore (1995) (19 citations) Self-citation (Boyer Moore) (Correct)
.... above; the work includes a formalization of string functional semantics for circuit descriptions and its use to verify the correctness properties of many circuits, including the Saxe Leiserson retimed correlator, a pipelined ripple adder, and an abstract pipelined cpu (Boyer, Moore, and Green, [BGM90], basic controller.events ) a model of the problem of controlling a vehicle s course and a proof that under certain conditions a particular program keeps the vehicle within a certain corridor of the desired course and, under more ideal conditions, homes to the course (Cowles, ....
.... the same file as basic fortran, above, which is duplicated on this subdirectory for technical reasons (Boyer and Moore, BM81] fortran vcg fsrch.events ) proofs of the verification conditions for a Fortran implementation of the Boyer Moore fast string searching algorithm (Boyer and Moore, [BGM90], fortran vcg isqrt.events ) proofs of the verification conditions for a Fortran implementation of the integer version of Newton s square root algorithm (Boyer and Moore, BM91] fortran vcg mjrty.events ) proofs of the verification conditions for a Fortran implementation of a linear time ....
R. S. Boyer, M. W. Green, and J S. Moore. The Use of a Formal Simulator to Verify a Simple Real Time Control Program. In W.H.J. Feijen, A.J.M. van Gasteren, D. Gries, and J. Misra, editor, Beauty is Our Business: A Birthday Salute to Edsger W. Dijkstra, pages 54--66. Springer-Verlag Texts and Monographs in Computer Science, 1990.
Program Verification - Boyer, Moore (1985) Self-citation (Boyer Moore) (Correct)
....authorizing this nonsense. 3. Problems and Current Directions Several important programming areas have been virtually ignored in program verification. One such area is the the mechanical verification of real time control programs. A minor investigation into the area was done by Boyer and Moore in [13] in which they used their theorem prover to prove that a simple program keeps a vehicle on course in a varying cross wind. A major problem in real time control verification is the specification of the non digital world with which such programs interact. A related area of concern is hardware ....
R. S. Boyer, M. W. Green and J S. Moore. The Use of a Formal Simulator to Verify a Simple Real Time Control Program. In Beauty Is Our Business, Springer, 1990, pp. 55-64.
A Theorem Prover for a Computational Logic - Boyer, Moore (1990) (22 citations) Self-citation (Boyer Moore) (Correct)
....with Shankar s checking of the Church Rosser theorem. On pp. 4 9 of ACLH, we enumerate many other applications of NQTHM, including those in list processing, elementary number theory, metamathematics, set theory, and concurrent algorithms. Descriptions of some of these applications may be found in [16, 66, 12, 21, 17, 67, 68, 69, 20, 60, 28, 51, 37, 52, 13, 14, 15, 22, 77] and also in [1, 31, 32, 33, 40, 75, 3, 48, 44, 41, 42, 39, 45, 23, 24, 25] Recently colleagues of ours at Computational Logic, Inc. Bill Young and Bill Bevier, have used NQTHM to construct mechanically checked proofs of properties relating to faulttolerance. A key problem facing the designers ....
R. S. Boyer, M. W. Green and J S. Moore. The Use of a Formal Simulator to Verify a Simple Real Time Control Program. In D. Gries, et. al, Ed., Beauty Is Our Business, Springer, 1990. To Appear.
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