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 as-sertions and using these assertions to prove their correctness (e.g. using the Owicki/Gries theory). We propose a method to support assertion-based methods with theorem provers like PVS. Emphasis is on the typi-cal incremental character of assertion-based methods, and on automated strategies for proving correctness of the proof outlines.
. We give an overview on our approach to symbolic simulation in the PVS theorem prover and demonstra...
Abstract. We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our...
Abstract. We present in this paper a library to compute with Taylor models, a technique extending in...
Verifications of parallel programs are frequently based on automated state-space exploration techniq...
. Theorem proving and model checking are complementary approaches to the verification of hardware de...
This thesis presents the first formalization of the Owicki-Gries method and its compositional versio...
We report a case study in automated incremental assertion-based proof checking with PVS. Given an an...
ISBN: 978-1-4244-2922-6International audienceModern assertion languages, such as PSL and SVA, includ...
International audienceThe purpose of this work is to allow the proof system PVS to export proof cert...
PVS stands for "Prototype Verification System." It consists of a specication language inte...
Interactive mechanical theorem proving can provide high assurance of correct design, but it can also...
Computer programs are an indispensable part of many of the systems we rely upon in our daily lives, ...
This paper describes the use of an automated theorem prover to analyse properties of interactive beh...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal softwar...
. We give an overview on our approach to symbolic simulation in the PVS theorem prover and demonstra...
Abstract. We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our...
Abstract. We present in this paper a library to compute with Taylor models, a technique extending in...
Verifications of parallel programs are frequently based on automated state-space exploration techniq...
. Theorem proving and model checking are complementary approaches to the verification of hardware de...
This thesis presents the first formalization of the Owicki-Gries method and its compositional versio...
We report a case study in automated incremental assertion-based proof checking with PVS. Given an an...
ISBN: 978-1-4244-2922-6International audienceModern assertion languages, such as PSL and SVA, includ...
International audienceThe purpose of this work is to allow the proof system PVS to export proof cert...
PVS stands for "Prototype Verification System." It consists of a specication language inte...
Interactive mechanical theorem proving can provide high assurance of correct design, but it can also...
Computer programs are an indispensable part of many of the systems we rely upon in our daily lives, ...
This paper describes the use of an automated theorem prover to analyse properties of interactive beh...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal softwar...
. We give an overview on our approach to symbolic simulation in the PVS theorem prover and demonstra...
Abstract. We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our...
Abstract. We present in this paper a library to compute with Taylor models, a technique extending in...