Definition
In theoretical computer science, an algorithm is correct with respect to a specification if it behaves as specified. Best explored is functional correctness, which refers to the input–output behavior of the algorithm: for each input, it produces an output satisfying the specification.
Related concepts
Accuracy and precisionActa InformaticaAdaptabilityAlgorithmAlgorithmic efficiencyC (programming language)Communications of the ACMCompiler correctnessComputer memoryComputer programmingConstructive logicCurry–Howard correspondenceDeep resultDesign by contractFlexibility (engineering)Formal systemFormal verificationHalting problemHoare logicISO/IEC 9126IntegerLambda calculusList of system quality attributesLoose couplingMaintainabilityMathematical proofModel checkingNon-functional requirementNumber theoryOrthogonality (programming)Perfect numberProgram analysisProgram derivationProgram specificationProof theoryReliability engineeringReusabilityRobustness (computer science)ScalabilitySoftware development securitySoftware portabilitySoftware qualitySoftware quality assuranceSoftware quality controlSoftware quality managementSoftware sizingSoftware system safetySoftware testabilitySoftware testingTermination proofTheoretical computer scienceTony HoareUndecidable problemUnderstandabilityUsabilityVictor Basili
9 concepts already in your glossary