In: Computer Science
1) Provide a definition of the semantic correctness of algorithm A with respect to pre-condition alpha and post-condition beta. A well-presented precise and complete definition is expected.
The accuracy of the program spoke to in the item correctly execute the objectives and particulars that developers have proposed at the design stage.
In another manner, the program P is correct if P performs definitely and absolutely prerequisites from design specifications. For instance, in the event that you have input A after completed program P, you needed to get output B where A and B are rationale articulations.
Approach proving correctness of the program :-
Right off the bat, I need consider and comprehend to formal semantics of the program which indicate its technical characteristics under a formal representation.
At that point, I understood that need two things for this. One I need to discover some semantic specificationsas definitions can appear as a lot of aphorisms. What's more, a lot of surmising decides show that how the semantics of any code obstruct in the program are right.
So for one year back, I have concentrated to program check dependent on formal semantics approach because of C. A. R. Hoare. This is likewise my proposal, which is the heft of the improvement focuses on a fairly little center language of Java-projects to exhibit the materialness of formal semantics appear:
Semantics description methods :-
Thus,
Partial Correctness + Termination = Total Correctness