S. Owre, N. Shankar . The formal semantics of PVS. Tech. Report Computer Science Laboratory, SRI International, www.csl.sri.com/papers/csl-97-2, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Grundlagenstreit in the Theory of Programming - Voda (2003) (Correct)
....environment o ered to end users [18] PVS, which belongs to the class of HOLs, is even worse in this respect because the derived schemas of inference are hardwired into the PVS proof assistant and 8 not visible as in Isabelle HOL through the theories. The ocial description of axioms of PVS [13] leaves much to be desired from the logical point of view. What con dence can we then have in the consistency of such theories After all, we are dealing with formal proofs carried out in interactive proof checking environments. The proof checking is meticulous down to the smallest detail and of ....
S. Owre, N. Shankar . The formal semantics of PVS. Tech. Report Computer Science Laboratory, SRI International, www.csl.sri.com/papers/csl-97-2, 1997.
What Can we Gain by Integrating a Language Processor with a.. - Voda (2003) (Correct)
No context found.
S. Owre, N. Shankar . The formal semantics of PVS. Tech. Report Computer Science Laboratory, SRI International, www.csl.sri.com/papers/csl-97-2, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC