×

zbMATH — the first resource for mathematics

A brief overview of PVS. (English) Zbl 1165.68468
Mohamed, Otmane Ait (ed.) et al., Theorem proving in higher order logics. 21st international conference, TPHOLs 2008, Montreal, Canada, August 18–21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-71065-3/pbk). Lecture Notes in Computer Science 5170, 22-27 (2008).
Summary: 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.
For the entire collection see [Zbl 1149.68013].

MSC:
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
Software:
PVS; TAME
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Adams, A., Dunstan, M., Gottliebsen, H., Kelsey, T., Martin, U., Owre, S.: Computer algebra meets automated theorem proving: Integrating Maple and PVS. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 27–42. Springer, Heidelberg (2001) · Zbl 1005.68997 · doi:10.1007/3-540-44755-5_4
[2] Archer, M.: TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence 29(1–4), 139–181 (2000) · Zbl 1001.68127 · doi:10.1023/A:1018913028597
[3] Carreño, V., Muñoz, C.: Aircraft trajectory modeling and alerting algorithm verification. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 90–105. Springer, Heidelberg (2000) · Zbl 0974.68548 · doi:10.1007/3-540-44659-1_6
[4] Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
[5] Crow, J., Owre, S., Rushby, J., Shankar, N., Stringer-Calvert, D.: Evaluating, testing, and animating PVS specifications. Technical report, Computer Science Laboratory, SRI International, Menlo Park, CA (March 2001), http://www.csl.sri.com/users/rushby/abstracts/attachments
[6] Formal Methods Program. Formal methods roadmap: PVS, ICS, and SAL. Technical Report SRI-CSL-03-05, Computer Science Laboratory, SRI International, Menlo Park, CA (October 2003), http://fm.csl.sri.com/doc/roadmap03
[7] Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. EATCS Bulletin 62, 222–259 (1997) · Zbl 0880.68070
[8] Kim, T., Stringer-Calvert, D., Cha, S.: Formal verification of functional properties of an SCR-style software requirements specification using PVS. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 205–220. Springer, Heidelberg (2002) · Zbl 1043.68538 · doi:10.1007/3-540-46002-0_15
[9] Miller, S.P., Srivas, M.: Formal verification of the AAMP5 microprocessor: A case study in the industrial use of formal methods. In: WIFT 1995: Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, FL, pp. 2–16. IEEE Computer Society, Los Alamitos (1995) · doi:10.1109/WIFT.1995.515475
[10] Muñoz, C.: Rapid Prototyping in PVS. National Institute of Aerospace, Hampton, VA (2003), http://research.nianet.org/ munoz/PVSio/
[11] Owre, S.: Random testing in PVS. In: Workshop on Automated Formal Methods (AFM), Seattle, WA (August 2006), http://fm.csl.sri.com/AFM06/papers/5-Owre.pdf
[12] Owre, S., Rueß, H.: Integrating WS1S with PVS. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 548–551. Springer, Heidelberg (2000) · Zbl 0974.68557 · doi:10.1007/10722167_42
[13] Owre, S., Rushby, J., Shankar, N.: Analyzing tabular and state-transition specifications in PVS. Technical Report SRI-CSL-95-12, (1995); also published as NASA Contractor Report 201729, http://www.csl.sri.com/csl-95-12.html
[14] Pombo, C.L., Owre, S., Shankar, N.: A semantic embedding of the Ag dynamic logic in PVS. Technical Report SRI-CSL-02-04, Computer Science Laboratory, SRI International, Menlo Park, CA (October 2004)
[15] Rushby, J.: A separation kernel formal security policy in PVS. Technical note, Computer Science Laboratory, SRI International, Menlo Park, CA (March 2004)
[16] Saïdi, H., Graf, S.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997) · doi:10.1007/3-540-63166-6_42
[17] Shankar, N., Owre, S., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS System Guide, PVS Language Reference, PVS Prover Guide, PVS Prelude Library, Abstract Datatypes in PVS, and Theory Interpretations in PVS. Computer Science Laboratory, SRI International, Menlo Park, CA (1999), http://pvs.csl.sri.com/documentation.shtml
[18] Shankar, N.: Static analysis for safe destructive updates in a functional language. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol. 2372, pp. 1–24. Springer, Heidelberg (2002), ftp://ftp.csl.sri.com/pub/users/shankar/lopstr01.pdf · Zbl 1073.68564 · doi:10.1007/3-540-45607-4_1
[19] Skakkebæk, J.U., Shankar, N.: A Duration Calculus proof checker: Using PVS as a semantic framework. Technical Report SRI-CSL-93-10, Computer Science Laboratory, SRI International, Menlo Park, CA (December 1993)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.