# Formalization of the Integral Calculus in the PVS Theorem Prover

@article{Butler2009FormalizationOT, title={Formalization of the Integral Calculus in the PVS Theorem Prover}, author={Ricky W. Butler}, journal={J. Formaliz. Reason.}, year={2009}, volume={2}, pages={1-26} }

The PVS Theorem prover is a widely used formal verification tool used for the analysis of safetycritical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and Computer Science that is used in a verification. This is a formidable task, ultimately requiring the contributions of researchers and developers all…

## Figures from this paper

## 25 Citations

A Survey on Theorem Provers in Formal Methods

- Computer ScienceArXiv
- 2019

In this work, more than 40 theorem provers are studied in detail and compared to present a comprehensive analysis and evaluation of these tools.

Formalizing Ring Theory in PVS

- MathematicsITP
- 2018

The goal of the project in progress is to specify and formalize in PVS the main theorems from ring theory presented in undergraduate textbooks of abstract algebra, but in the short term the authors intended to formalize: the Second and the Third Isomorphism Theorems for rings.

Formalization of real analysis: a survey of proof assistants and libraries †

- Computer ScienceMathematical Structures in Computer Science
- 2015

This survey presents how real numbers have been defined in these various provers and how the notions of real analysis described above have been formalized.

Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives

- Computer Science, MathematicsCPP
- 2012

This paper proposes a way to define total operators for derivative and integral without having to extend Coq's standard axiomatization of real numbers, and proves the compatibility of the definitions with the standard library's in order to leverage existing results.

Formalization of Ring Theory in PVS

- MathematicsJ. Autom. Reason.
- 2021

The paper presents the formalization of the general algebraic-theoretical version of the Chinese remainder theorem (CRT) for the theory of rings, as given in abstract algebra textbooks, proved as a consequence of the first isomorphism theorem.

A verification system for timed interval calculus

- Computer Science2008 ACM/IEEE 30th International Conference on Software Engineering
- 2008

A system based on a generic theorem prover, Prototype Verification System (PVS), to assist formal verification of TIC at a high grade of automation, and a collection of supplementary rules and PVS strategies has been defined to facilitate the rigorous reasoning of Tic models with functional and non-functional requirements at the interval level.

A Formalisation in HOL of the Fundamental Theorem of Linear Algebra and Its Application to the Solution of the Least Squares Problem

- Computer Science, MathematicsJournal of Automated Reasoning
- 2016

This work intensively reuses previous results, such as the Rank–Nullity theorem and various applications of the Gauss–Jordan algorithm, and formalises in Isabelle/HOL a proof of the Fundamental Theorem of Linear Algebra for vector spaces over inner product spaces.

A verification system for interval-based specification languages

- Computer ScienceTSEM
- 2010

A verification system to facilitate the formal analysis of interval-based specification languages with machine-assisted proof support is developed using a generic theorem prover, Prototype Verification System (PVS), and elaborately encodes a highly expressive set-based notation, Timed Interval Calculus.

A Formal Proof Of The Riesz Representation Theorem

- MathematicsJ. Formaliz. Reason.
- 2011

A formal proof of the Riesz representation theorem is presented, and the function contstructed in the textbook does not satsify a key property, illustrating the ability of formal verification to find logical errors.

Formal Verification of Cyber-Physical Systems: Coping with Continuous Elements

- Computer ScienceICCSA
- 2013

This paper presents the formalization of the solutions of second-order homogeneous linear differential equations and proposes to use higher-order-logic theorem proving to analyze continuous models of cyber-physical systems.

## References

SHOWING 1-10 OF 21 REFERENCES

Real automation in the field

- Computer Science
- 2001

A package of strategies for automation of non-linear arithmetic in PVS is provided, in particular, a simplification procedure for the field of real numbers and a strategy for cancellation of common terms.

Constructive real analysis : a type-theoretical formalization and applications

- Computer Science
- 2004

The work described in this thesis can be summarized in three points: - construction of the C-CoRN library (formalization of Real Analysis and development of tactics); - development of a working methodology; - applications to program extraction (case study: extracting and optimizing a program from the formalized library).

A PVS Prover Strategy Package for Common Manipulations

- Computer Science
- 2002

This report presents the full set of arithmetic strategies and discusses how they are invoked within the prover, including a description of the extended expression notation for accessing terms as well as a substitution technique provided for higher-order strategies.

Elements of Mathematical Analysis in PVS

- MathematicsTPHOLs
- 1996

The formalization of some elements of mathematical analysis using the PVS verification system is presented, to extend the existing PVS libraries and provide means of modelling and reasoning about hybrid systems.

Theorem Proving with the Real Numbers

- Computer ScienceDistinguished Dissertations
- 1998

HOL extends Church's system by allowing also 'type variables' which give a form of polymorphism, and is capable not only of deciding whether it has a type, but inferring a most general type for it if it does.

On the Mechanization of Real Analysis in Isabelle/HOL

- Computer ScienceTPHOLs
- 2000

This paper presents an intuitive, yet rigorous, development of real analysis in Isabelle/HOL, and a relatively high degree of proof automation in many cases.

Formalizing Integration Theory with an Application to Probabilistic Algorithms

- Computer Science, MathematicsTPHOLs
- 2004

Building on previous work about formal verification of probabilistic algorithms, a primitive for randomized functional programming is developed to this end and a significant part of its theory is formalized in Higher Order Logic using Isabelle/Isar.

Introduction to Analysis

- Mathematics
- 1970

Cloth $85.00 “ Gunning’s book is a great introduction to analysis that presents precisely what an honors analysis course should include. The writing is rigorous but lively, and much interesting…

Aircraft Trajectory Modeling and Alerting Algorithm Verification

- Computer Science

A model of aircraft approaches to parallel runways and an alerting algorithm which warns the crew when one of the aircraft involved in a parallel landing is diverting from the intended flight path are presented.

Aircraft Trajectory Modeling and Altering Algorithm Verification

- Computer ScienceTPHOLs
- 2000

A model of aircraft approaches to parallel runways is presented and an alerting algorithm which warns the crew when one of the aircraft involved in a parallel landing is diverting from the intended flight path is analyzed.