PVS: A prototype verification system

Owre, Sam; Rushby, John; Shankar, Natarajan

doi:10.1007/3-540-55602-8_217

Cited by 941 publications

(568 citation statements)

References 6 publications

(2 reference statements)

Supporting

Mentioning

559

Contrasting

Unclassified

Order By: Relevance

“…PVS [9] and MathWorks Simulink [2] are modeling frameworks widely used in both industry and academia. Each has a native simulation environment for model animation.…”

Section: Introductionmentioning

confidence: 99%

Combining PVSio with Stateflow

Masci

Zhang

Jones

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. An approach is presented to integrate PVS executable specifications and Stateflow models. It uses web services to enable a seamless exchange of simulation events and data between PVSio and Stateflow. The approach's effectiveness is demonstrated on a medical device prototype. The prototype's user interface is a PVS specification with its software controller implemented in Stateflow. Using the web services approach, a simulation is run over the prototype, during which simulation data produced in PVSio and Stateflow are exchanged properly and smoothly. Such integration allows the wide range of applications developed in Stateflow to be complemented with the rigor of PVS verification.

show abstract

“…PVS [9] and MathWorks Simulink [2] are modeling frameworks widely used in both industry and academia. Each has a native simulation environment for model animation.…”

Section: Introductionmentioning

confidence: 99%

Combining PVSio with Stateflow

Masci

Zhang

Jones

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This implies that the possible solution to program verification problem is either by abstract interpretation to simplify the given proof obligation, or by interactive manner to acquire some oracles during verification, or by developing specific methods for specific verification problems which are decidable. Following the above three lines, there are various techniques to program verification that have been well established so far, e.g., the abstraction-based techniques [11] such as static program analysis [12,16] and program typing [13,19], theorem-proving based deductive methods [20,21], model-checking [4,5,6,24], etc. The main disadvantage of the abstraction-based techniques is that complicated properties cannot be dealt with well because complicated properties closely interwind with the actual executions of a program, but normally in abstract executions of the program lots of useful information will be lost.…”

Section: Introductionmentioning

confidence: 99%

Program Verification by Using DISCOVERER

Yang

Zhan

Xia

et al. 2008

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

Abstract. Recent advances in program verification indicate that various verification problems can be reduced to semi-algebraic system (SAS for short) solving. An SAS consists of polynomial equations and polynomial inequalities. Algorithms for quantifier elimination of real closed fields are the general method for those problems. But the general method usually has low efficiency for specific problems. To overcome the bottleneck of program verification with a symbolic approach, one has to combine special techniques with the general method. Based on the work of complete discrimination systems of polynomials [33,31], we invented new theories and algorithms [32,30,35] for SAS solving and partly implemented them as a real symbolic computation tool in Maple named DISCOVERER. In this paper, we first summarize the results that we have done so far both on SAS-solving and program verification with DISCOVERER, and then discuss the future work in this direction, including SAS-solving itself, termination analysis and invariant generation of programs, and reachability computation of hybrid systems etc.

show abstract

“…To experiment with our approach, we have implemented a tool that uses the PVS [ORS92] theorem prover as a back-end. The effectiveness of the automated proof strategies is illustrated on some case studies, including a handshake register [Hes98] and the spanning tree protocol [MW03] mentioned before.…”

Section: Introductionmentioning

confidence: 99%

Incremental Verification of Owicki/Gries Proof Outlines Using PVS

Mooij

Wesselink

2005

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Verifications of parallel programs are frequently based on automated state-space exploration techniques known as model checking. To avoid state-space explosion problems, theorem proving techniques can be used, for example by manually annotating programs with suitable assertions and using these assertions to prove their correctness (e.g. using the Owicki/Gries theory). We propose a method to support assertionbased methods with theorem provers like PVS. Emphasis is on the typical incremental character of assertion-based methods, and on automated strategies for proving correctness of the proof outlines.

show abstract

PVS: A prototype verification system

Cited by 941 publications

References 6 publications

Combining PVSio with Stateflow

Combining PVSio with Stateflow

Program Verification by Using DISCOVERER

Incremental Verification of Owicki/Gries Proof Outlines Using PVS

Contact Info

Product

Resources

About