A Brief Overview of PVS

DOI10.1007/978-3-540-71067-7_5zbMath1165.68468OpenAlexW1909120645MaRDI QIDQ3543645

Sam Owre, Natarajan Shankar

Publication date: 4 December 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71067-7_5

Mathematics Subject Classification ID

Related Items (10)

Theorem prover approach to semistructured data design ⋮ Proof normalization modulo ⋮ Compositional reasoning using intervals and time reversal ⋮ Proving the infeasibility of Horn formulas through read-once resolution ⋮ The Implicit Calculus of Constructions as a Programming Language with Dependent Types ⋮ Operations on fixpoint equation systems ⋮ Validating QBF Validity in HOL4 ⋮ PVS ⋮ Formalization of ring theory in PVS. Isomorphism theorems, principal, prime and maximal ideals, Chinese remainder theorem ⋮ Recursive tables and effective definition schemes

Uses Software

• TAME

Cites Work

• TAME: Using PVS strategies for special-purpose theorem proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Brief Overview of PVS