Correctness (computer science)
In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. Functional correctness refers to the input-output behavior of the algorithm (i.e., for each input it produces the expected output). A proof would have to be a mathematical proof, assuming both the algorithm and specification are given formally. In particular it is not expected to be a correctness assertion for a given program implementing the algorithm on a given machine. That would involve such considerations as limitations on computer memory.
known for
Wikipage disambiguates
AlgorithmAlgorithmic program debuggingAlloy (specification language)Artifact (software development)Axiomatic semanticsBerlekamp–Rabin algorithmCompiler correctnessComputer-aided software engineeringComputer engineering compendiumComputer securityConcurrent hash tableConst (computer programming)Constant (computer programming)CorrectnessCorrectness of computer programsCurry–Howard correspondenceData integrityData typeDecision Linear assumptionDesign by contractDistributed constraint optimizationDistributed transactionEdsger W. DijkstraEhud ShapiroException handlingFail-stopFormal methodsFormal proof of correctnessFormal specificationFormal verificationHalting problemHoare logicInvariant (mathematics)Key exchangeLamport's bakery algorithmLanguage-based securityLas Vegas algorithmLi Cai (psychometrician)Liskov substitution principleList of computability and complexity topics
Link from a Wikipage to another Wikipage
primaryTopic
Correctness (computer science)
In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. Functional correctness refers to the input-output behavior of the algorithm (i.e., for each input it produces the expected output). A proof would have to be a mathematical proof, assuming both the algorithm and specification are given formally. In particular it is not expected to be a correctness assertion for a given program implementing the algorithm on a given machine. That would involve such considerations as limitations on computer memory.
has abstract
En teoría de la computación, l ...... ta de pasos.
* Datos: Q360812
@es
In theoretical computer scienc ...... ween budget, time and quality.
@en
Na Ciência da computação teóri ...... bre a corretude na computação.
@pt
Poprawność całkowita i częścio ...... wejściowych spełniających WP.
@pl
Un algorithme est correct s'il ...... a description de l'algorithme.
@fr
Unter Korrektheit versteht man ...... begriff eine absolute Aussage.
@de
在理论计算机科学中，算法的正确性（英语：correctnes ...... 个最大的研究领域。软件测试是预算、时间和软件质量的一个平衡。
@zh
計算機科学における正当性（Correctness）とは、アル ...... グラム抽出; program extraction」と呼ぶ。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,953,685
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
En teoría de la computación, l ...... ción finito.
* Datos: Q360812
@es
In theoretical computer scienc ...... imitations on computer memory.
@en
Na Ciência da computação teóri ...... chamado extração de programa.
@pt
Poprawność całkowita i częścio ...... wejściowych spełniających WP.
@pl
Un algorithme est correct s'il ...... a description de l'algorithme.
@fr
Unter Korrektheit versteht man ...... eibt (siehe dazu Validierung).
@de
在理论计算机科学中，算法的正确性（英语：correctnes ...... 的正确性断言，因为那样将需要考虑诸如内存限制在内的更多问题。
@zh
計算機科学における正当性（Correctness）とは、アル ...... るものではない。その場合メモリ量の限界を考慮する必要がある。
@ja
label
Correction d'un algorithme
@fr
Correctitud
@es
Correctness (computer science)
@en
Corretude (lógica)
@pt
Korrektheit (Informatik)
@de
Poprawność całkowita
@pl
正当性 (計算機科学)
@ja
正确性 (计算机科学)
@zh