Robust Computer System Proofs in PVS
نویسنده
چکیده
Practical formal veriication of complex computer systems requires proof robustness and eeciency to protect against inevitable mistakes and system spec-iication and design changes. PVS is a theorem-proving system based on higher-order logic with which we demonstrate the kind of robust code proofs needed for veriication of realistic-sized computing systems.
منابع مشابه
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
We describe an interface between version 6 of the Maple computer algebra system with the PVS automated theorem prover. The interface is designed to allow Maple users access to the robust and checkable proof environment of PVS. We also extend this environment by the provision of a library of proof strategies for use in real analysis. We demonstrate examples using the interface and the real analy...
متن کاملFormalization of the Integral Calculus in the PVS Theorem Prover
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 verificatio...
متن کاملFormal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Eves. Shostak, in 1984, published a decision procedure for the combination of canonizable and solvable theories. Recently, Ruess and Shankar showed Shostak’s method to be incomplete and nonterminating, and presented a c...
متن کاملRepresenting, Verifying and Applying Software Development Steps using the PVS System
In this paper generic software development steps of diierent complexity are represented and veriied using the (higher-order, strongly typed) speciication and veriication system PVS. The transformations considered in this paper include \large" powerful steps encoding general algorithmic paradigms as well as \smaller" transformations for the operationalization of a descriptive speciication. The a...
متن کاملTowards a Duration Calculus Proof Assistant in PVS
The Duration Calculus (DC) is an interval temporal logic for reasoning about real-time systems. This paper describes a tool for constructing DC speciications and checking DC proofs. The proof assistant is implemented by encoding the semantics of DC within the higher-order logic of a general-purpose speciication and veriication environment called PVS. We develop a Gentzen style sequent proof sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997