Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
The verifying compiler: A grand challenge for computing research
Journal of the ACM (JACM)
Keep it clean: a unique approach to functional programming.
ACM SIGPLAN Notices
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
Theory Interpretations in PVS
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
The 1st verified software competition: experience report
FM'11 Proceedings of the 17th international conference on Formal methods
| Hi-index | 0.00 |
The first Verified Software Competition (VSComp) was held in August 2010 as part of the third conference on Verified Software: Theories, Tools, and Experiments. The competition consisted of five problems of varying difficulty. These problems have been useful for illustrating the strengths and weaknesses of different verification methods. We present solutions to these problems using the SRI's Prototype Verification System (PVS).We also discuss how certain features of PVS were exploited in these exercises.