| David Grioen and Marieke Huisman. A comparison of PVS and Isabelle /HOL. In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs '98, volume 1479 of Lecture Notes in Computer Science, pages 123-142, Canberra, Australia, September 1998. Springer-Verlag. |
....have the advantage that the implementations are simple and reliable. PVS extends the simple type system in a number of ways, but these extensions are well supported by means of the proof automation in PVS. PVS has been compared with HOL by Gordon [Gor95] and with Isabelle by Grioen and Huisman [GH98] The type systems of PVS and Nuprl [CAB 86] have been compared by Jackson [Jac96] Dependent type theories were introduced as a formalization of constructive logics based on the Curry Howard isomorphism. Constructive logics like AUTOMATH [dB80] Nuprl [CAB 86] and Coq [DFH 91] ....
David Grioen and Marieke Huisman. A comparison of PVS and Isabelle /HOL. In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs '98, volume 1479 of Lecture Notes in Computer Science, pages 123-142, Canberra, Australia, September 1998. Springer-Verlag.
....have the advantage that the implementations are simple and reliable. PVS extends the simple type system in a number of ways, but these extensions are well supported by means of the proof automation in PVS. PVS has been compared with HOL by Gordon [Gor95] and with Isabelle by Grioen and Huisman [GH98] The type systems of PVS and Nuprl [CAB 86] have been compared by Jackson [Jac96] Dependent type theories were introduced as a formalization of constructive logics based on the Curry Howard isomorphism. Constructive logics like AUTOMATH [dB80] Nuprl [CAB 86] and Coq [DFH 91] ....
David Grioen and Marieke Huisman. A comparison of PVS and Isabelle /HOL. In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs '98, volume 1479 of Lecture Notes in Computer Science, pages 123-142, Canberra, Australia, September 1998. Springer-Verlag.
.... of an interactive consistency algorithm [88] and between PVS and HOL specifications of the IEEE 854 floating point standard [89] are available, while Mike Gordon provides a discussion of PVS from a HOL perspective [90] and David Griffioen and Marieke Huisman compare PVS and Isabelle HOL [91]. Heinrich Rust presents a PVS treatment for an invoicing example used in the comparison of many systems [92] Matt Wilding describes an approach, derived from those used with Nqthm and ACL2, for developing robust proofs of machine code programs [93] Merriam and Harrison provide an examination ....
David Griffioen and Marieke Huisman. A comparison of PVS and Isabelle/HOL. In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs '98, volume 1479 of Lecture Notes in Computer Science, pages 123--142, Canberra, Australia, September 1998. Springer-Verlag.
....type parameters in PVS versus type polymorphism in Isabelle HOL, so that the type theory and logic that we use is not really in the intersection. But with some good will it should be clear how to translate the constructions that we present into the particular languages of these proof tools. See [GH98] for a detailed comparison. 2 In this paper we only use non recursive types, but for the translation of Java constructs like catch and switch we also use the (recursive) list type constructor. 4 fPg S fQg fQgT fRg [composition] fPg S; T fRg fP CgS fQg fP :CgT fQg [if] fPg if C then S ....
W.O.D. Griffioen and M. Huisman. A comparison of PVS and Isabelle /HOL. In Jim Grundy and Malcolm Newey, editors, Proceedings of Theorem Proving in Higher Order Logics, September 1998. 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