S. Owre, J. Rushby, N. Shankar, D. Stringer-Calvert, PVS: An Experience Report, In: Applied Formal Methods---FM-Trends 98. Eds. D. Hutter, W. Stephan, P. Traverso, M. Ullman. LNCS vol. 1641, pp. 338--345. Springer-Verlag, Germany. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Static Analyzer for Large Safety-Critical Software - Blanchet, Cousot, Cousot.. (2003) (13 citations) (Correct)
....that the size of the (semantically) expanded code to analyze is much larger than that of the original code. Furthermore, the properties we prove include fine numerical constraints, which excludes simple abstract models. 9. 3 Deductive Methods Proof assistants (such as Coq [33] ESC [17] or PVS [32]) face semantic problems when dealing with real life programming languages. First, the prover has to take the machinelevel semantics into account (e.g. floating point arithmetic with rounding errors as opposed to real numbers, which is far from being routinely available ) Obviously, any ....
....machine arithmetic will face the same semantic problems. However, if the task of taking concrete and rounding errors into account turned out to be feasible for our automated analyzer, this task is likely to be daunting in the case of complex decision procedures operating on ideal arithmetic [32]. Furthermore, exposing to the user the complexity brought by those errors is likely to make assisted manual proof harrowing. A second semantic di#culty is that the prover needs to operate on the C source code, not on some model written in a prototyping language so that the concrete program ....
S. Owre, N. Shankar, and D. Stringer-Calvert. PVS: An experience report. FM-Trends'98 (1999), LNCS 1641, Springer, 117--132.
Application Specific Higher Order Logic Theorem Proving - Kroening (2002) (2 citations) (Correct)
....correctness proof of control logic of hardware designs is often very tedious using theorem proving systems. However, because of their small state space, it is a simple problem for Model Checkers. Thus, many theorem proving systems integrate Model Checkers as decision procedure, e.g. PVS [ORS97, ORSSC98, Rus00a] The theorem prover is used to abstract the data paths, which makes Model Checking feasible. Besides the lack of application specific decision procedures, the obstacle for the verification of large designs is the size of the decision problems. In general, the decision procedures of most ....
Sam Owre, John Rushby, N. Shankar, and David Stringer-Calvert. PVS: an experience report. In Dieter Hutter, Werner Stephan, Paolo Traverso, and Markus Ullman, editors, Applied Formal Methods---FM-Trends 98, volume 1641 of Lecture Notes in Computer Science, pages 338--345, Boppard, Germany, October 1998. Springer-Verlag.
FLAVERS: a Finite State Verification Technique for.. - Cobleigh, Clarke.. (2001) (1 citation) (Correct)
....with a specification of its intended functional behavior. The basic idea is elegant, but demands a considerable amount of mathematical sophistication on the part of the analyst. Although significant progress has been made in providing automated support to assist with formal verification [ORSSC98, CW96] it still requires considerable effort and expertise. As a result, if used, it is usually applied only to small, critical portions of a system. Finite State Verification (FSV) has been gaining credibility and attention as an alternative to formal verification approaches based on theorem ....
Sam Owre, John Rushby, N. Shankar, and David Stringer-Calvert. PVS: an experience report. In Dieter Hutter, Werner Stephan, Paolo Traverso, and Markus Ullman, editors, Applied Formal Methods---FMTrends 98, volume 1641 of Lecture Notes in Computer Science, pages 338--345, Boppard, Germany, October 1998. Springer-Verlag.
An Environment for Building Mathematical Knowledge Libraries - Piroi, Buchberger (2004) (Correct)
No context found.
S. Owre, J. Rushby, N. Shankar, D. Stringer-Calvert, PVS: An Experience Report, In: Applied Formal Methods---FM-Trends 98. Eds. D. Hutter, W. Stephan, P. Traverso, M. Ullman. LNCS vol. 1641, pp. 338--345. Springer-Verlag, Germany.
An Environment for Building Mathematical Knowledge Libraries - Piroi, Buchberger (2004) (Correct)
No context found.
S. Owre, J. Rushby, N. Shankar, D. Stringer-Calvert, PVS: An Experience Report, In: Applied Formal Methods---FM-Trends 98. Eds. D. Hutter, W. Stephan, P. Traverso, M. Ullman. LNCS vol. 1641, pp. 338--345. Springer-Verlag, Germany.
Guaranteed Optimization for Domain-Specific Programming - Veldhuizen (2003) (Correct)
No context found.
Owre, S., Rushby, J., Shankar, N., Stringer-Calvert, D.: PVS: an experience report. In Hutter, D., Stephan, W., Traverso, P., Ullman, M., eds.: Applied Formal Methods|FM-Trends 98. Volume 1641 of Lecture Notes in Computer Science., Boppard, Germany, Springer-Verlag (1998) 338-345
Active Libraries and Universal Languages - Veldhuizen (2004) (1 citation) (Correct)
No context found.
Sam Owre, John Rushby, N. Shankar, and David Stringer-Calvert. PVS: an experience report. In Dieter Hutter, Werner Stephan, Paolo Traverso, and Markus Ullman, editors, Applied Formal Methods---FM-Trends 98, volume 1641 of Lecture Notes in Computer Science, pages 338--345, Boppard, Germany, October 1998. Springer-Verlag.
Constructor-based Observational Logic - Bidoit, Hennicker (2003) (1 citation) (Correct)
No context found.
Sam Owre, John Rushby, Natarajan Shankar, and David Stringer-Calvert. PVS: An Experience Report. In D. Hutter, W. Stephan, P. Traverso, and M. Ullman, editors, Applied Formal Methods---FM-Trends 98, volume 1641 of Lecture Notes in Computer Science, pages 338--345. Springer, 1998. 58
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