Difference between revisions of "Correctness"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
{{WikiEntry|key=Correctness (computer science)|qCode=360812}} is the quality of an algorithm being correct with respect to a specification. It is a logical property of a computing program that satisfies both [[safety]] and [[liveness]] properties of a system design requirements. These properties are reasoned about through the use of [[partially-ordered set]]s, or [[lattice]]s, as a sequence of causally dependent data points to guarantee rationality. | {{WikiEntry|key=Correctness (computer science)|qCode=360812}} is the quality of an algorithm being correct with respect to a specification. It is a logical property of a computing program that satisfies both [[safety]] and [[liveness]] properties of a system design requirements. These properties are reasoned about through the use of [[partially-ordered set]]s, or [[lattice]]s, as a sequence of causally dependent data points to guarantee rationality. | ||
{{PagePostfix | |||
|category_csd=Logic,Hoare Logic | |||
}} | |||
Latest revision as of 02:14, 10 September 2022
Correctness (computer science)(Q360812) is the quality of an algorithm being correct with respect to a specification. It is a logical property of a computing program that satisfies both safety and liveness properties of a system design requirements. These properties are reasoned about through the use of partially-ordered sets, or lattices, as a sequence of causally dependent data points to guarantee rationality.
References