International audienceWe propose a deductive verification approach for proving partial-correctness and invariance properties on transition-system models. Regarding partial correctness, we gen-eralise the recently introduced formalism of Reachability Logic, currently used as a language-parametric logic for programs, to transition systems. We propose a sound and relatively complete proof system for the resulting reachability logic. The soundness of the proof system is formally established in the Coq proof assistant, and the mechanised proof provides us with a Coq-certified Reachability-Logic prover for transition-system models. The relative completeness of the proof system, although theoretical in nature, also has a practical value, as it ind...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
International audienceIn product line engineering, systems are developed in families and differences...
International audienceProving programs correct is hard. During the last decades computer scientists ...
International audienceWe propose a deductive verification approach for proving partial-correctness a...
(27 pages)We propose a deductive-verification approach for proving partial-correctness and invarianc...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
AbstractIn this paper a systematic method for generating, comparing and proving the properties of tr...
Reachability analysis asks whether a system can evolve from legitimate initial states to unsafe stat...
Does the application of time quantifiers, such as “sometimes” and “always” in loop invariants, incre...
AbstractPartial transition systems support abstract model checking of complex temporal properties by...
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relativel...
International audienceReachability Logic is a formalism that can be used, among others, for expressi...
The properties that we would like to express on data-intensive applications cannot be limited to sta...
International audienceThis paper deals with the use of two verification approaches : theorem proving...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
International audienceIn product line engineering, systems are developed in families and differences...
International audienceProving programs correct is hard. During the last decades computer scientists ...
International audienceWe propose a deductive verification approach for proving partial-correctness a...
(27 pages)We propose a deductive-verification approach for proving partial-correctness and invarianc...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
AbstractIn this paper a systematic method for generating, comparing and proving the properties of tr...
Reachability analysis asks whether a system can evolve from legitimate initial states to unsafe stat...
Does the application of time quantifiers, such as “sometimes” and “always” in loop invariants, incre...
AbstractPartial transition systems support abstract model checking of complex temporal properties by...
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relativel...
International audienceReachability Logic is a formalism that can be used, among others, for expressi...
The properties that we would like to express on data-intensive applications cannot be limited to sta...
International audienceThis paper deals with the use of two verification approaches : theorem proving...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
International audienceIn product line engineering, systems are developed in families and differences...
International audienceProving programs correct is hard. During the last decades computer scientists ...