Proving program correctness











up vote
0
down vote

favorite












I want to prove the correctness of iterative method for square root of "a" as given below:


    s,m := 0, a
while m > ε/2
if (s+m)^2 <= a
s := s + m
m := m /2

I have been given a precondition $$Q: a = a' ∧ a > 1$$ and postcondition $$R: Q ∧ |s^{2} - a| < varepsilon$$
and a loop invariant $$P: Q ∧ |s^{2} - a| < 2m$$

Can you please prove or disprove $$P∧Mgeqfrac{varepsilon}{2} wedge |(S+M)^{2}- A|leq A Rightarrow |(S+M)^{2}- A| < 2M$$



Thanks in advance!










share|cite|improve this question






















  • Hi, in your code as written, if $s$ and $m$ start as 0, $m$ will always be 0 and $s$ will never change, so program is clearly incorrect. I also don't understand what is $a^{prime}$.
    – Todor Markov
    Nov 19 at 9:36

















up vote
0
down vote

favorite












I want to prove the correctness of iterative method for square root of "a" as given below:


    s,m := 0, a
while m > ε/2
if (s+m)^2 <= a
s := s + m
m := m /2

I have been given a precondition $$Q: a = a' ∧ a > 1$$ and postcondition $$R: Q ∧ |s^{2} - a| < varepsilon$$
and a loop invariant $$P: Q ∧ |s^{2} - a| < 2m$$

Can you please prove or disprove $$P∧Mgeqfrac{varepsilon}{2} wedge |(S+M)^{2}- A|leq A Rightarrow |(S+M)^{2}- A| < 2M$$



Thanks in advance!










share|cite|improve this question






















  • Hi, in your code as written, if $s$ and $m$ start as 0, $m$ will always be 0 and $s$ will never change, so program is clearly incorrect. I also don't understand what is $a^{prime}$.
    – Todor Markov
    Nov 19 at 9:36















up vote
0
down vote

favorite









up vote
0
down vote

favorite











I want to prove the correctness of iterative method for square root of "a" as given below:


    s,m := 0, a
while m > ε/2
if (s+m)^2 <= a
s := s + m
m := m /2

I have been given a precondition $$Q: a = a' ∧ a > 1$$ and postcondition $$R: Q ∧ |s^{2} - a| < varepsilon$$
and a loop invariant $$P: Q ∧ |s^{2} - a| < 2m$$

Can you please prove or disprove $$P∧Mgeqfrac{varepsilon}{2} wedge |(S+M)^{2}- A|leq A Rightarrow |(S+M)^{2}- A| < 2M$$



Thanks in advance!










share|cite|improve this question













I want to prove the correctness of iterative method for square root of "a" as given below:


    s,m := 0, a
while m > ε/2
if (s+m)^2 <= a
s := s + m
m := m /2

I have been given a precondition $$Q: a = a' ∧ a > 1$$ and postcondition $$R: Q ∧ |s^{2} - a| < varepsilon$$
and a loop invariant $$P: Q ∧ |s^{2} - a| < 2m$$

Can you please prove or disprove $$P∧Mgeqfrac{varepsilon}{2} wedge |(S+M)^{2}- A|leq A Rightarrow |(S+M)^{2}- A| < 2M$$



Thanks in advance!







algorithms computer-science






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 19 at 2:40









King Lear

1




1












  • Hi, in your code as written, if $s$ and $m$ start as 0, $m$ will always be 0 and $s$ will never change, so program is clearly incorrect. I also don't understand what is $a^{prime}$.
    – Todor Markov
    Nov 19 at 9:36




















  • Hi, in your code as written, if $s$ and $m$ start as 0, $m$ will always be 0 and $s$ will never change, so program is clearly incorrect. I also don't understand what is $a^{prime}$.
    – Todor Markov
    Nov 19 at 9:36


















Hi, in your code as written, if $s$ and $m$ start as 0, $m$ will always be 0 and $s$ will never change, so program is clearly incorrect. I also don't understand what is $a^{prime}$.
– Todor Markov
Nov 19 at 9:36






Hi, in your code as written, if $s$ and $m$ start as 0, $m$ will always be 0 and $s$ will never change, so program is clearly incorrect. I also don't understand what is $a^{prime}$.
– Todor Markov
Nov 19 at 9:36

















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004454%2fproving-program-correctness%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004454%2fproving-program-correctness%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

ComboBox Display Member on multiple fields

Is it possible to collect Nectar points via Trainline?