论文信息 - Predicate Subtyping with Predicate Sets

Predicate Subtyping with Predicate Sets

We show how PVS-style predicate subtyping can be simulated in HOL using predicate sets, and explain how to perform subtype checking using this model. We illustrate some applications of this to specification and verification in HOL, and also demonstrate some limits of the approach. Finally we report on the effectiveness of a subtype checker used as a condition prover in a contextual rewriter.

Joe Hurd

[1] Adriana B. Compagnoni,et al. Higher-order subtyping with intersection types , 1995 .

[2] Leslie Lamport,et al. Should your specification language be typed , 1999, TOPL.

[3] Shankar Natarajan,et al. The Formal Semantics of PVS , 1999 .

[4] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[5] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[6] Michael Jones. Restricted Types for HOLMichael Jones ? , 1996 .

[7] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[8] Harry G. Mairson. Deciding ML typability is complete for deterministic exponential time , 1989, POPL '90.

[9] J. Strother Moore,et al. An Industrial Strength Theorem Prover for a Logic Based on Common Lisp , 1997, IEEE Trans. Software Eng..

[10] Natarajan Shankar,et al. Principles and Pragmatics of Subtyping in PVS , 1999, WADT.

[11] Joe Hurd,et al. Verification of the Miller-Rabin probabilistic primality test , 2003, J. Log. Algebraic Methods Program..

[12] Tim Leonard,et al. Formal Verification of the Alpha 21364 Network Protocol , 2000, TPHOLs.

[13] John Harrison,et al. Optimizing Proof Search in Model Elimination , 1996, CADE.