论文信息 - Elements of Mathematical Analysis in PVS

Elements of Mathematical Analysis in PVS

This paper presents the formalization of some elements of mathematical analysis using the PVS verification system. Our main motivation was to extend the existing PVS libraries and provide means of modelling and reasoning about hybrid systems. The paper focuses on several important aspects of PVS including recent extensions of the type system and discusses their merits and effectiveness. We conclude by a brief comparison with similar developments using other theorem provers.

Bruno Dutertre | B. Dutertre

[1] William M. Farmer,et al. The IMPS User's Manual , 1995 .

[2] John Harrison,et al. Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals , 1993, HUG.

[3] John Harrison,et al. Constructing the real numbers in HOL , 1992, Formal Methods Syst. Des..

[4] Mandayam K. Srivas,et al. Formal verification of the AAMP5 microprocessor: a case study in the industrial use of formal methods , 1995, Proceedings of 1995 IEEE Workshop on Industrial-Strength Formal Specification Techniques.

[5] William M. Farmer,et al. Little Theories , 1992, CADE.

[6] Jozef Hooman,et al. Correctness of Real Time Systems by Construction , 1994, FTRTFT.

[7] John Harrison. Floating Point Verification in HOL , 1995, TPHOLs.

[8] Mandayam K. Srivas,et al. A Tutorial Introduction to PVS , 1998 .

[9] Natarajan Shankar,et al. Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS , 1995, IEEE Trans. Software Eng..

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