Formally Proving Code Correctness: An Example

Watch a more elaborate example of proving code correctness ► • Formally Proving Code ...
In this video, we are applying a special technique to formally prove the attributes assigned to certain points in the function's execution, so to prove that the function is indeed returning the correct result. The question of correctness is delegated to the requirements - instead of insisting that a function is correct in absolute sense, we are instead proving that it is returning the result which corresponds with the requirements.
*************************************
Subscribe for more videos on software development ► www.youtube.co...
*************************************
Additional videos:
Want to Start with DDD? Try Ubiquitous Language First! ► • Want to Start with DDD...
Using C# Record Types ► • Here is What Hides in ...
Covariance and Contravariance in C# ► • What is Covariance and...
How do Virtual Functions Work? ► • How Do Virtual Functio...
Practical Design playlist at KZbin ► • Practical C# Design
*************************************
Video courses:
Beginning Object-oriented Programming with C# ► codinghelmet.c...
Collections and Generics in C# ► codinghelmet.c...
Making Your C# Code More Object-oriented ► codinghelmet.c...
Other courses at Pluralsight ► codinghelmet.c...
Other courses at Udemy ► codinghelmet.c...
#dotnet #csharp #pluralsight

[@doomonduty8303]

My teacher spend an hour teaching us this , and I got it just in 3 mins thank you sir .

[@zoran-horvat]

Glad to hear it helped.

[@josel.guzman6247]

This is great, thanks

[@programmingpersistence5716]

How do i describe the notation max

[@zoran-horvat]

That is a singular case, where k is drawn from set only consisting of a zero. In subsequent iterations, this set will increase to {0, 1}, {0, 1, 2}, etc. Sorry if this notation has caused confusion.

[@jbipmni8984]

how to proof correctness of this algorithm: function increment(y) comment Return y + 1, where y in N x := 0; c:= 1; d:= 1; while (y > 0) V (c > 0) do a :=y mod 2; if a XOR c then x=x+d; c:= a AND c; d:= 2d; y := [y/2] : return(x)

[@218defacto]

@zoran Horvat, when I want to talk about using proof when creating a Basic programmed calculator. How do use proof in this instance? I hope you get back to me ASAP.

[@rimvydasb3531]

How you prove that your formal prove is in align with program and correct?

[@zoran-horvat]

I am not sure I understand the question. Have you found a flaw in the proof?