A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) is described. Adequate specifications of basic definitions and notions such as reduction, confluence, normal form are given and well-known results proved, which includes non trivial ones such as Noetherian Induction, Newman’s Lemma and its generalizations, and Commutation Lemma among others....

PVS (Prototype Verification System) is a comprehensive framework for writing formal logical specifications and constructing proofs. An interactive proof checker is a key component of PVS. The capabilities of this proof checker can be extended by defining proof strategies that are similar to LCF-style tactics. Commonly used proof strategies include those for discharging typechecking proof obliga...

We present an efficient technique to compute the potentially visible set (PVS) of triangles in a complex 3D scene from a viewpoint. The algorithm computes a conservative PVS at object space accuracy. Our approach traces a high number of small, volumetric frusta and computes blockers for each frustum using simple intersection tests. In practice, the algorithm can compute the PVS of CAD and scann...

Photovoltaic modules and systems (PVs) play an important role in achieving self-sustainable airports. In particular, airport-based PVs (A-PVs) have access to their full potential because airports are typically located open spaces. However, the reflection of solar light by A-PVs’ front glass is unavoidable may cause accident due glare (SG). this study, we theoretically calculated risk SG from A-...

Formulas are difficult to formulate and to prove, and are often invalid during specification development. Testing formulas prior to attempting any proofs could potentially save a lot of effort. Here we describe an implementation of random testing in the PVS verification system.

Confluence is a critical property of computational systems which is related with determinism and non ambiguity and thus with other relevant computational attributes of functional specifications and rewriting system as termination and completion. Several criteria have been explored that guarantee confluence and their formalisations provide further interesting information. This work discusses top...

In this paper, we extend PVS specification logic with abstract metarouting theory to aid the development of complex routing protocol models based on metarouting, which is an algebraic framework for specifying routing protocols in a restricted fashion such that the protocol is guaranteed to converge. Our formalization of metarouting theory utilizes the theory-interpretation extensions of PVS. Ou...

The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by axioms. This is convenient for concrete applications where the rewrite mechanisms of PVS can be exp...

This paper presents an application of PVS to the veri cation of security protocols The objective is to provide mechanical support for a veri cation method described in The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties We present an application to the Needham Schroeder public key protocol

This paper presents an application of PVS to the veri cation of security protocols. The objective is to provide mechanical support for a veri cation method described in [14]. The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties. We present an application to the Needham-Schroeder public key pro...