Model checking
TAME: Using PVS strategies for special-purpose theorem proving
Annals of Mathematics and Artificial Intelligence
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Aircraft Trajectory Modeling and Altering Algorithm Verification
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Static Analysis for Safe Destructive Updates in a Functional Language
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
WIFT '95 Proceedings of the 1st Workshop on Industrial-Strength Formal Specification Techniques
Validating QBF validity in HOL4
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Model checking agent programming languages
Automated Software Engineering
Proving consistency and completeness of model classes using theory interpretation
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Validating QBF invalidity in HOL4
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
PVS is now 15 years old, and has been extensively used in research, industry, and teaching. The system is very expressive, with unique features such as predicate subtypes, recursive and corecursive datatypes, inductive and coinductive definitions, judgements, conversions, tables, and theory interpretations. The prover supports a combination of decision procedures, automatic simplification, rewriting, ground evaluation, random test case generation, induction, model checking, predicate abstraction, MONA, BDDs, and user-defined proof strategies. In this paper we give a very brief overview of the features of PVS, some illustrative examples, and a summary of the libraries and PVS applications.