P. B. Jackson. Nuprl and its use in circuit design. In V. Stavridou, T. Melham, and R. Boute, editors, Theorem Provers in Circuit Design, pages 311--336. North-Holland, 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the system. Information on how to obtain the system can be obtained from the author. A number of research papers related to Nuprl have been published. Some extensions to the type theory are described in [1, 2, 3, 6, 10, 19, 20, 24, 26] Numerous applications of Nuprl have been made; these include [5, 8, 9, 11, 16, 17, 18, 21, 22]. In order to illustrate explicit and implicit programming in Nuprl, and to show how the system works, we focus on a simple case study in which we verify Boyer and Moore s majority algorithm. We first take a conventional approach, writing the program and then proving that the output is ....

P. B. Jackson. Nuprl and its use in circuit design. In V. Stavridou, T. Melham, and R. Boute, editors, Theorem Provers in Circuit Design, pages 311--336. North-Holland, 1992.

....interest in the early 1980s in response to the concerns discussed in the previous section. Formal notations and automated proof systems have been used in a variety of methodologies. These include formal logics (e.g. first order [98,34] higher order [84,79] temporal [139,171] type theory [102], state machines and automata [81,28,15] process algebras (e.g. Circal [132] hop [74] and others [56,155,165] Many other formalisms and systems have been studied, some of which are reviewed in [66,35] The avoidance of the combinatorial explosion of test vectors, mentioned above, is a major ....

....the Boyer Moore system [21] otter [34] Clio [12] and the Larch Prover [166] Proof assistants are proof systems which may perform small proofs with no user intervention but are normally used in an interactive mode, driven by the user. These include hol [79] Veritas [88,87] Lambda [64] Nuprl [46,102]. Proof checkers are proof assistants which have to be supplied with all details of a proof. Their function is to validate proofs. An example is the Stanford lcf system [127] Appendix A. Glossary of Terminology and Notation 238 A.2 Notation This section describes the notation adopted in the ....

Paul B Jackson. Nuprl and its uses in circuit design. In V Stavridou, T F Melham, and R T Boute, editors, Theorem Provers in Circuit Design: Theory, Practice and Experience, pages 311--336. IFIP TC10/WG 10.2, North Holland, June 1992.

....is required. For example, digital signal processing, fast fourier transform, and hybrid control systems. I see these applications as providing focussed and worthwhile challenges for theorem proving technology. This is an area of interest that I pursued earlier in my thesis research [Jac91, Jac92] and that provided the initial motivation for much of the work described in this thesis. ffl One of the most significant problems with Nuprl is that of performance. The main cause of this problem is the highly redundant checking of wellformedness by proof. Proof caching schemes have been ....

Paul B. Jackson. Nuprl and its use in circuit design. In R.T. Boute V. Stavridou, T.F.Melham, editor, Proceedings of the 1992 International Conference on Theorem Provers in Circuit Design, IFIP Transactions A-10. North-Holland, 1992.

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