Frama-C-discuss mailing list archives
This page gathers the archives of the old Frama-C-discuss archives, that was hosted by Inria's gforge before its demise at the end of 2020. To search for mails newer than September 2020, please visit the page of the new mailing list on Renater.
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Frama-c-discuss] Jessie - sufficiency of proofs
- Subject: [Frama-c-discuss] Jessie - sufficiency of proofs
- From: kerstin.hartig at first.fraunhofer.de (Kerstin Hartig)
- Date: Thu, 23 Jul 2009 11:18:26 +0200
Hello everyone, I wonder about a general question. When is a proof considered to be sufficient and exhaustive? As i found different opinions I would like to make sure I understand this issue correctly. Is it necessary that at least one prover proves all PO's of a specified function. Or is it demanded that even more than one can prove it or is it exhaustive if each PO is proved by any of the provers, even if there's no prover proving all PO's at once ? I wonder which case would withstand appraisers or surveyors, when making official certificates about safety of a software.( for example) Could a proof that only consists of an addition of proved PO's, where each is proved but not by one prover but severals, be considered to be safe? I am really interested in understanding where are the limits and what is sufficient. I appreciate your thoughts about that, Thank you in advance, Regards, Kerstin
- Follow-Ups:
- [Frama-c-discuss] Jessie - sufficiency of proofs
- From: Pascal.Cuoq at cea.fr (Pascal Cuoq)
- [Frama-c-discuss] Jessie - sufficiency of proofs
- Prev by Date: [Frama-c-discuss] Integerdivision
- Next by Date: [Frama-c-discuss] Jessie - sufficiency of proofs
- Previous by thread: [Frama-c-discuss] Integerdivision
- Next by thread: [Frama-c-discuss] Jessie - sufficiency of proofs
- Index(es):