WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/11875667

Is "Sometime" Sometimes Better Than "Always"? Intermittent Assertions in Proving Program Correctness

This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, which we call the intermittent-assertion method, involves documenting the program with assertions that must be true at some time when control is passing through the corresponding point, but that need not be true every time. The method, introduced by Burstall, promises to provide a valuable complement to the more conventional methods. The intermittent-assertion method is introduced with a number of examples of correctness and termination proofs. Some of these proofs are markedly simpler than their conventional counterparts. On the other hand, we show that a proof of correctness or termination by any of the conventional techniques can be rephrased directly as a proof using intermittent assertions. Finally, we show how the intermittent-assertion method can be applied to prove the validity of program transformations and the correctness of continuously operating programs.

Open All Close All

type

about

http://schema.org/about

contributor

creator

description

http://schema.org/description

  • "This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, which we call the intermittent-assertion method, involves documenting the program with assertions that must be true at some time when control is passing through the corresponding point, but that need not be true every time. The method, introduced by Burstall, promises to provide a valuable complement to the more conventional methods. The intermittent-assertion method is introduced with a number of examples of correctness and termination proofs. Some of these proofs are markedly simpler than their conventional counterparts. On the other hand, we show that a proof of correctness or termination by any of the conventional techniques can be rephrased directly as a proof using intermittent assertions. Finally, we show how the intermittent-assertion method can be applied to prove the validity of program transformations and the correctness of continuously operating programs."@en
  • "This paper explores a technique for proving the correctness and termination of computer programs simultaneously. This approach, which the authors call the intermittent-assertion method, involves documenting the program with assertions that must be true at some time when control passes through the corresponding point, but that need not be true every time. The method, introduced by Burstall, promises to provide a valuable complement to more conventional methods. The authors first introduce the intermittent-assertion method with a number of examples of correctness and termination proofs. Some of these proofs are markedly simpler than their conventional counterparts. On the other hand, they show that a proof of correctness or termination by any of the conventional techniques can be rephrased directly as a proof using intermittent assertions. Finally, they show how the intermittent-assertion method can be applied to prove the validity of program transformations and the correctness of continuously operating programs."@en
  • "This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, which we call the intermittent-assertion method, involves documenting the program with assertions that must be true at some time when control is passing through the corresponding point, but that need not be true every time. The method, introduced by Knuth and further developed by Burstall, promises to provide a valuable complement to the more conventional methods. The technique is introduced and illustrated with a number of examples. It is then shown that a correctness proof using the invariant assertion method or the subgoal induction method can always be expressed using intermittent assertions instead, but that the reverse is not always the case. The method can also be used just to prove termination, and any proof of termination using the conventional well-founded sets approach can be rephrased as a proof using intermittent assertions. Finally, it is shown how the method can be applied to prove the validity of program transformations and the correctness of continuously operating programs."@en

name

http://schema.org/name

  • "Is "Sometime" Sometimes Better Than "Always"? Intermittent Assertions in Proving Program Correctness"@en
  • "Is "sometimes" sometimes better than "always"? : intermittent assertations in proving program correctness"@en
  • "Is "sometime" sometimes better than "always"? : intermittent assertions in proving program correctness"@en
  • "Is "sometime" sometimes better than "always"? : intermittent assertions in proving program correctnes"@en
  • "Is "sometime" sometimes better than "always"?"@en
  • "Is "sometimes" sometimes better than "always"? : intermittent assertions in proving program correctness"@en
  • "Is "sometime" sometimes better than "always"?- Intermittent assertions in proving program correctness"
  • "Is 'Sometime' Sometimes Better Than 'Always'. Intermittent Assertions in Proving Program Correctness"@en
  • "Is "sometime" sometimes better than "always"? : Intermittent assertions in proving program correctness"
  • "Is "sometime" sometimes better than "always"? : Intermittent assertions in proving program correctness"@en
  • "Is 'sometime' sometimes better than 'always'? : intermittent assertions in proving program correctness"
  • "Is 'Sometime' Sometimes Better than 'Always'. Intermittent Assertions in Proving Program Correctness"@en

workExample