. "\u6B63\u5F53\u6027 (\u8A08\u7B97\u6A5F\u79D1\u5B66)"@ja . . . . . "Poprawno\u015B\u0107 ca\u0142kowita"@pl . . . "357339"^^ . . . "En teor\u00EDa de la computaci\u00F3n, la correcci\u00F3n de un algoritmo, tambi\u00E9n llamada correctitud (como adaptaci\u00F3n de la palabra inglesa correctness), corresponde a una propiedad que distingue a un algoritmo de un procedimiento efectivo. Un algoritmo es correcto si: 1. \n* Resuelve el problema computacional para el cual fue dise\u00F1ado. 2. \n* Para cada entrada, produce la salida deseada. 3. \n* Termina en un tiempo de ejecuci\u00F3n finito. \n* Datos: Q360812"@es . . . . . "Korrektheit (Informatik)"@de . . "En teor\u00EDa de la computaci\u00F3n, la correcci\u00F3n de un algoritmo, tambi\u00E9n llamada correctitud (como adaptaci\u00F3n de la palabra inglesa correctness), corresponde a una propiedad que distingue a un algoritmo de un procedimiento efectivo. Un algoritmo es correcto si: 1. \n* Resuelve el problema computacional para el cual fue dise\u00F1ado. 2. \n* Para cada entrada, produce la salida deseada. 3. \n* Termina en un tiempo de ejecuci\u00F3n finito. Si cualquiera de estos tres puntos no se cumple, entonces estamos hablando de un algoritmo incorrecto, que para efectos pr\u00E1cticos, carece de utilidad, al no ser m\u00E1s que un procedimiento efectivo, es decir, una secuencia ordenada y determinista de pasos. \n* Datos: Q360812"@es . "Unter Korrektheit versteht man in der Informatik die Eigenschaft eines Computerprogramms, einer Spezifikation zu gen\u00FCgen (siehe auch Verifikation). Spezialgebiete der Informatik, die sich mit dieser Eigenschaft befassen, sind die Formale Semantik und die Berechenbarkeitstheorie. Nicht abgedeckt vom Begriff Korrektheit ist, ob die Spezifikation die vom Programm zu l\u00F6sende Aufgabe korrekt beschreibt (siehe dazu Validierung). Ein Programmcode wird bez\u00FCglich einer Vorbedingung P und einer Nachbedingung Q partiell korrekt genannt, wenn bei einer Eingabe, die die Vorbedingung P erf\u00FCllt, jedes Ergebnis die Nachbedingung Q erf\u00FCllt. Dabei ist es noch m\u00F6glich, dass das Programm nicht f\u00FCr jede Eingabe ein Ergebnis liefert, also nicht f\u00FCr jede Eingabe terminiert. Ein Code wird total korrekt genannt, wenn er partiell korrekt ist und zus\u00E4tzlich f\u00FCr jede Eingabe, die die Vorbedingung P erf\u00FCllt, terminiert. Aus der Definition folgt sofort, dass total korrekte Programme auch immer partiell korrekt sind. Der Nachweis partieller Korrektheit (Verifikation) kann z. B. mit dem wp-Kalk\u00FCl erfolgen. Um zu zeigen, dass ein Programm total korrekt ist, muss hier der Beweis der Terminierung in einem gesonderten Schritt behandelt werden. Mit dem Hoare-Kalk\u00FCl kann die totale Korrektheit in vielen F\u00E4llen nachgewiesen werden. Der Nachweis der Korrektheit eines Programms kann jedoch nicht in allen F\u00E4llen gef\u00FChrt werden: Das folgt aus der Nicht-Entscheidbarkeit des Halteproblems bzw. aus dem G\u00F6delschen Unvollst\u00E4ndigkeitssatz. Auch wenn die Korrektheit f\u00FCr Programme, die bestimmten Einschr\u00E4nkungen unterliegen, bewiesen werden kann, so z\u00E4hlt die Korrektheit von Programmen allgemein zu den nicht-berechenbaren Problemen. Die Durchf\u00FChrung einer \u00DCberpr\u00FCfung auf Korrektheit bezeichnet man als Beweis. Dabei ist ein Beweis der totalen Korrektheit ein Spezialfall eines mathematischen Beweises, erlaubt also im Gegensatz zum umgangssprachlichen Beweisbegriff eine absolute Aussage."@de . . "Corretude (l\u00F3gica)"@pt . . . . "\u5728\u7406\u8BBA\u8BA1\u7B97\u673A\u79D1\u5B66\u4E2D\uFF0C\u7B97\u6CD5\u7684\u6B63\u786E\u6027\uFF08\u82F1\u8BED\uFF1Acorrectness\uFF09\u662F\u6307\u4E00\u4E2A\u7B97\u6CD5\u5728\u7A0B\u5E8F\u89C4\u8303\u4E0B\u88AB\u8BA4\u5B9A\u4E3A\u6B63\u786E\u7684\u5224\u5B9A\u3002\u5176\u4E2D\uFF0C\u529F\u80FD\u6B63\u786E\uFF08\u82F1\u8BED\uFF1Afunctional correctness\uFF09\u9488\u5BF9\u8F93\u5165\u8F93\u51FA\u7684\u884C\u4E3A\uFF08\u4F8B\u5982\uFF1A\u5BF9\u6BCF\u4E00\u4E2A\u8F93\u5165\uFF0C\u7B97\u6CD5\u90FD\u80FD\u7ED9\u51FA\u9884\u671F\u7684\u8F93\u51FA\uFF09\u3002 \u4EBA\u4EEC\u5C06\u6B63\u786E\u6027\u5206\u4E3A\u4E24\u7C7B\u3002\u4E00\u7C7B\u88AB\u79F0\u4E3A\u90E8\u5206\u6B63\u786E\u6027\uFF08\u82F1\u8BED\uFF1Apartial correctness\uFF09\uFF0C\u5B83\u8981\u6C42\u5728\u7B97\u6CD5\u8FD4\u56DE\u7ED3\u679C\u65F6\u8FD9\u4E00\u7ED3\u679C\u662F\u6B63\u786E\u7684\uFF1B\u53E6\u4E00\u7C7B\u88AB\u79F0\u4E3A\u5B8C\u5168\u6B63\u786E\u6027\uFF08\u82F1\u8BED\uFF1Atotal correctness\uFF09\uFF0C\u5B83\u5728\u90E8\u5206\u6B63\u786E\u6027\u7684\u57FA\u7840\u4E4B\u4E0A\u8FD8\u8981\u6C42\u7B97\u6CD5\u5FC5\u987B\u80FD\u591F\u7ED3\u675F\u3002\u7531\u4E8E\u5BF9\u4E8E\u505C\u673A\u95EE\u9898\u6CA1\u6709\u901A\u7528\u7684\u89E3\u51B3\u65B9\u6848\uFF0C\u56E0\u6B64\u5224\u5B9A\u5B8C\u5168\u6B63\u786E\u6027\u7684\u65AD\u8A00\u6709\u7740\u66F4\u591A\u9700\u8981\u6DF1\u5C42\u6B21\u7814\u7A76\u7684\u5730\u65B9\u3002\u662F\u6307\u4E00\u7C7B\u6570\u5B66\u8BC1\u660E\uFF0C\u56E0\u4E3A\u5B8C\u5168\u6B63\u786E\u6027\u9700\u8981\u8BC1\u660E\u4E00\u4E2A\u7B97\u6CD5\u4F1A\u7EC8\u6B62\uFF0C\u6240\u4EE5\u5B83\u5728\u7A0B\u5E8F\u7684\u5F62\u5F0F\u9A8C\u8BC1\u4E2D\u8D77\u7740\u81F3\u5173\u91CD\u8981\u7684\u4F5C\u7528\u3002 \u4F8B\u5982\u8003\u8651\u8FD9\u6837\u4E00\u4E2A\u95EE\u9898\uFF1A\u4F9D\u6B21\u641C\u7D22\u6574\u6570\u52171, 2, 3, \u2026\u6765\u770B\u662F\u5426\u5B58\u5728\u67D0\u4E2A\u7279\u5B9A\u73B0\u8C61\u2014\u2014\u6BD4\u5982\u8BF4\u5B58\u5728\u4E00\u4E2A\u5947\u6570\u4E3A\u5B8C\u5168\u6570\u3002\u5BF9\u4E8E\u8FD9\u4E2A\u95EE\u9898\u800C\u8A00\uFF0C\u6211\u4EEC\u5F88\u5BB9\u6613\u5199\u51FA\u4E00\u4E2A\u90E8\u5206\u6B63\u786E\u7684\u7A0B\u5E8F\uFF08\u76F4\u63A5\u5BF9\u4E8E\u6BCF\u4E2A\u6570\u5B57\u505A\u957F\u9664\u6CD5\u5224\u5B9A\u5176\u662F\u5426\u5B8C\u5168\uFF09\u3002\u7136\u800C\u5982\u679C\u6211\u4EEC\u60F3\u8BC1\u660E\u8FD9\u4E2A\u7A0B\u5E8F\u662F\u5B8C\u5168\u6B63\u786E\u7684\uFF0C\u90A3\u5C31\u76F8\u5F53\u4E8E\u6211\u4EEC\u5728\u65AD\u8A00\u4E00\u4E2A\u5728\u6570\u8BBA\u91CC\u76EE\u524D\u8FD8\u672A\u77E5\u7684\u7ED3\u8BBA\u3002 \u5728\u7B97\u6CD5\u548C\u7A0B\u5E8F\u89C4\u8303\u90FD\u662F\u57FA\u4E8E\u5F62\u5F0F\u5316\u6765\u7ED9\u51FA\u65F6\uFF0C\u5BF9\u6B63\u786E\u6027\u7684\u8BC1\u660E\u5E94\u5F53\u4E3A\u4E00\u4E2A\u6570\u5B66\u8BC1\u660E\u3002\u7136\u800C\u6211\u4EEC\u5E76\u4E0D\u671F\u5F85\u80FD\u591F\u7ED9\u51FA\u7279\u5B9A\u673A\u5668\u4E0A\u5B9E\u73B0\u7684\u7279\u5B9A\u7A0B\u5E8F\u7684\u6B63\u786E\u6027\u65AD\u8A00\uFF0C\u56E0\u4E3A\u90A3\u6837\u5C06\u9700\u8981\u8003\u8651\u8BF8\u5982\u5185\u5B58\u9650\u5236\u5728\u5185\u7684\u66F4\u591A\u95EE\u9898\u3002"@zh . "\u6B63\u786E\u6027 (\u8BA1\u7B97\u673A\u79D1\u5B66)"@zh . . . . . . . . . . "Correctness (computer science)"@en . . . . "Na Ci\u00EAncia da computa\u00E7\u00E3o te\u00F3rica, a corretude de um algoritmo pode ser afirmada quando se diz que o algoritmo \u00E9 correto com respeito \u00E0 determinada especifica\u00E7\u00E3o. O termo corretude funcional se refere ao comportamento de entrada-sa\u00EDda do algor\u00EDtimo (isto \u00E9, para cada entrada ele produz a sa\u00EDda correta). Na teoria da prova, o Isomorfismo de Curry-Howard, afirma que uma prova da corretude funcional na L\u00F3gica intuicionista corresponde a um certo programa no C\u00E1lculo lambda. Converter uma prova dessa maneira \u00E9 chamado extra\u00E7\u00E3o de programa."@pt . . . . "\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3051\u308B\u6B63\u5F53\u6027\uFF08Correctness\uFF09\u3068\u306F\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u304C\u305D\u306E\u4ED5\u69D8\u306B\u7167\u3089\u3057\u3066\u6B63\u3057\u3044\u3053\u3068\u3092\u610F\u5473\u3059\u308B\u3002\u300C\u6A5F\u80FD\u7684\u300D\u6B63\u5F53\u6027\u3068\u306F\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306E\u5165\u51FA\u529B\u52D5\u4F5C\u306B\u95A2\u3059\u308B\u6B63\u5F53\u6027\u3067\u3042\u308B\uFF08\u3059\u306A\u308F\u3061\u3001\u5404\u5165\u529B\u306B\u5BFE\u3057\u3066\u6B63\u3057\u304F\u51FA\u529B\u3092\u751F\u6210\u3059\u308B\u3053\u3068\uFF09\u3002\u5F62\u5F0F\u7684\u691C\u8A3C\u3092\u53C2\u7167\u3055\u308C\u305F\u3044\u3002 \u5B8C\u5168\u6B63\u5F53\u6027\uFF08Total Correctness\uFF09\u306F\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u304C\u5E38\u306B\u505C\u6B62\u3059\u308B\u3053\u3068\u3082\u8981\u6C42\u3055\u308C\u308B\u3002\u4E00\u65B9\u3001\u90E8\u5206\u6B63\u5F53\u6027\uFF08Partial Correctness\uFF09\u306F\u5358\u306B\u8FD4\u3063\u3066\u304F\u308B\u7B54\u3048\u304C\u6B63\u3057\u3044\u3053\u3068\u306E\u307F\u3092\u8981\u6C42\u3059\u308B\uFF08\u5E38\u306B\u7B54\u3048\u304C\u8FD4\u3063\u3066\u304F\u308B\u3068\u306F\u9650\u3089\u306A\u3044\uFF09\u3002\u505C\u6B62\u554F\u984C\u306B\u306F\u6C4E\u7528\u7684\u89E3\u6CD5\u306F\u306A\u3044\u306E\u3067\u3001\u5B8C\u5168\u6B63\u5F53\u6027\u306F\u3088\u308A\u6DF1\u3044\u554F\u984C\u3092\u306F\u3089\u3093\u3067\u3044\u308B\u3002 \u4F8B\u3048\u3070\u3001\u6574\u6570\u3092 1 \u304B\u3089\u9806\u306B\u8ABF\u3079\u3066\u5947\u6570\u306E\u5B8C\u5168\u6570\u3092\u63A2\u3059\u3068\u3057\u305F\u5834\u5408\u3001\u90E8\u5206\u6B63\u5F53\u6027\u3092\u5099\u3048\u305F\u30D7\u30ED\u30B0\u30E9\u30E0\u3092\u66F8\u304F\u306E\u306F\u6975\u3081\u3066\u7C21\u5358\u3067\u3042\u308B\uFF08\u7D20\u56E0\u6570\u5206\u89E3\u3092\u884C\u3063\u3066 n \u304C\u5B8C\u5168\u6570\u304B\u3069\u3046\u304B\u3092\u8ABF\u3079\u308B\uFF09\u3002\u3057\u304B\u3057\u3001\u305D\u306E\u30D7\u30ED\u30B0\u30E9\u30E0\u304C\u5B8C\u5168\u6B63\u5F53\u6027\u3092\u5099\u3048\u3066\u3044\u308B\u3068\u3059\u308B\u306B\u306F\u6570\u8AD6\u306B\u304A\u3044\u3066\u672A\u77E5\u306E\u77E5\u8B58\u3092\u5FC5\u8981\u3068\u3059\u308B\u3002 \u6B63\u5F53\u6027\u306E\u8A3C\u660E\u306F\u6570\u5B66\u7684\u8A3C\u660E\u3067\u306A\u3051\u308C\u3070\u306A\u3089\u305A\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3082\u305D\u306E\u4ED5\u69D8\u8A18\u8FF0\u3082\u5F62\u5F0F\u7684\u306B\u4E0E\u3048\u3089\u308C\u306A\u3051\u308C\u3070\u306A\u3089\u306A\u3044\uFF08\u5F62\u5F0F\u7684\u4ED5\u69D8\u8A18\u8FF0\uFF09\u3002\u7279\u306B\u305D\u306E\u8A3C\u660E\u306F\u3001\u305D\u306E\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3092\u7279\u5B9A\u306E\u30DE\u30B7\u30F3\u4E0A\u3067\u30D7\u30ED\u30B0\u30E9\u30E0\u3068\u3057\u3066\u5B9F\u88C5\u3057\u305F\u3082\u306E\u306B\u3064\u3044\u3066\u6B63\u5F53\u6027\u3092\u610F\u5473\u3059\u308B\u3082\u306E\u3067\u306F\u306A\u3044\u3002\u305D\u306E\u5834\u5408\u30E1\u30E2\u30EA\u91CF\u306E\u9650\u754C\u3092\u8003\u616E\u3059\u308B\u5FC5\u8981\u304C\u3042\u308B\u3002 \u8A3C\u660E\u8AD6\u306B\u304A\u3051\u308B\u30AB\u30EA\u30FC\u30FB\u30CF\u30EF\u30FC\u30C9\u5BFE\u5FDC\u306F\u3001\u76F4\u89B3\u4E3B\u7FA9\u8AD6\u7406\u306B\u304A\u3051\u308B\u6A5F\u80FD\u7684\u6B63\u5F53\u6027\u306E\u8A3C\u660E\u304C\u30E9\u30E0\u30C0\u8A08\u7B97\u306B\u304A\u3051\u308B\u7279\u5B9A\u30D7\u30ED\u30B0\u30E9\u30E0\u306B\u5BFE\u5FDC\u3059\u308B\u3068\u3057\u3066\u3044\u308B\u3002\u3053\u306E\u3088\u3046\u306A\u8A3C\u660E\u306E\u5909\u63DB\u3092\u300C\u30D7\u30ED\u30B0\u30E9\u30E0\u62BD\u51FA; program extraction\u300D\u3068\u547C\u3076\u3002"@ja . . "\u5728\u7406\u8BBA\u8BA1\u7B97\u673A\u79D1\u5B66\u4E2D\uFF0C\u7B97\u6CD5\u7684\u6B63\u786E\u6027\uFF08\u82F1\u8BED\uFF1Acorrectness\uFF09\u662F\u6307\u4E00\u4E2A\u7B97\u6CD5\u5728\u7A0B\u5E8F\u89C4\u8303\u4E0B\u88AB\u8BA4\u5B9A\u4E3A\u6B63\u786E\u7684\u5224\u5B9A\u3002\u5176\u4E2D\uFF0C\u529F\u80FD\u6B63\u786E\uFF08\u82F1\u8BED\uFF1Afunctional correctness\uFF09\u9488\u5BF9\u8F93\u5165\u8F93\u51FA\u7684\u884C\u4E3A\uFF08\u4F8B\u5982\uFF1A\u5BF9\u6BCF\u4E00\u4E2A\u8F93\u5165\uFF0C\u7B97\u6CD5\u90FD\u80FD\u7ED9\u51FA\u9884\u671F\u7684\u8F93\u51FA\uFF09\u3002 \u4EBA\u4EEC\u5C06\u6B63\u786E\u6027\u5206\u4E3A\u4E24\u7C7B\u3002\u4E00\u7C7B\u88AB\u79F0\u4E3A\u90E8\u5206\u6B63\u786E\u6027\uFF08\u82F1\u8BED\uFF1Apartial correctness\uFF09\uFF0C\u5B83\u8981\u6C42\u5728\u7B97\u6CD5\u8FD4\u56DE\u7ED3\u679C\u65F6\u8FD9\u4E00\u7ED3\u679C\u662F\u6B63\u786E\u7684\uFF1B\u53E6\u4E00\u7C7B\u88AB\u79F0\u4E3A\u5B8C\u5168\u6B63\u786E\u6027\uFF08\u82F1\u8BED\uFF1Atotal correctness\uFF09\uFF0C\u5B83\u5728\u90E8\u5206\u6B63\u786E\u6027\u7684\u57FA\u7840\u4E4B\u4E0A\u8FD8\u8981\u6C42\u7B97\u6CD5\u5FC5\u987B\u80FD\u591F\u7ED3\u675F\u3002\u7531\u4E8E\u5BF9\u4E8E\u505C\u673A\u95EE\u9898\u6CA1\u6709\u901A\u7528\u7684\u89E3\u51B3\u65B9\u6848\uFF0C\u56E0\u6B64\u5224\u5B9A\u5B8C\u5168\u6B63\u786E\u6027\u7684\u65AD\u8A00\u6709\u7740\u66F4\u591A\u9700\u8981\u6DF1\u5C42\u6B21\u7814\u7A76\u7684\u5730\u65B9\u3002\u662F\u6307\u4E00\u7C7B\u6570\u5B66\u8BC1\u660E\uFF0C\u56E0\u4E3A\u5B8C\u5168\u6B63\u786E\u6027\u9700\u8981\u8BC1\u660E\u4E00\u4E2A\u7B97\u6CD5\u4F1A\u7EC8\u6B62\uFF0C\u6240\u4EE5\u5B83\u5728\u7A0B\u5E8F\u7684\u5F62\u5F0F\u9A8C\u8BC1\u4E2D\u8D77\u7740\u81F3\u5173\u91CD\u8981\u7684\u4F5C\u7528\u3002 \u4F8B\u5982\u8003\u8651\u8FD9\u6837\u4E00\u4E2A\u95EE\u9898\uFF1A\u4F9D\u6B21\u641C\u7D22\u6574\u6570\u52171, 2, 3, \u2026\u6765\u770B\u662F\u5426\u5B58\u5728\u67D0\u4E2A\u7279\u5B9A\u73B0\u8C61\u2014\u2014\u6BD4\u5982\u8BF4\u5B58\u5728\u4E00\u4E2A\u5947\u6570\u4E3A\u5B8C\u5168\u6570\u3002\u5BF9\u4E8E\u8FD9\u4E2A\u95EE\u9898\u800C\u8A00\uFF0C\u6211\u4EEC\u5F88\u5BB9\u6613\u5199\u51FA\u4E00\u4E2A\u90E8\u5206\u6B63\u786E\u7684\u7A0B\u5E8F\uFF08\u76F4\u63A5\u5BF9\u4E8E\u6BCF\u4E2A\u6570\u5B57\u505A\u957F\u9664\u6CD5\u5224\u5B9A\u5176\u662F\u5426\u5B8C\u5168\uFF09\u3002\u7136\u800C\u5982\u679C\u6211\u4EEC\u60F3\u8BC1\u660E\u8FD9\u4E2A\u7A0B\u5E8F\u662F\u5B8C\u5168\u6B63\u786E\u7684\uFF0C\u90A3\u5C31\u76F8\u5F53\u4E8E\u6211\u4EEC\u5728\u65AD\u8A00\u4E00\u4E2A\u5728\u6570\u8BBA\u91CC\u76EE\u524D\u8FD8\u672A\u77E5\u7684\u7ED3\u8BBA\u3002 \u5728\u7B97\u6CD5\u548C\u7A0B\u5E8F\u89C4\u8303\u90FD\u662F\u57FA\u4E8E\u5F62\u5F0F\u5316\u6765\u7ED9\u51FA\u65F6\uFF0C\u5BF9\u6B63\u786E\u6027\u7684\u8BC1\u660E\u5E94\u5F53\u4E3A\u4E00\u4E2A\u6570\u5B66\u8BC1\u660E\u3002\u7136\u800C\u6211\u4EEC\u5E76\u4E0D\u671F\u5F85\u80FD\u591F\u7ED9\u51FA\u7279\u5B9A\u673A\u5668\u4E0A\u5B9E\u73B0\u7684\u7279\u5B9A\u7A0B\u5E8F\u7684\u6B63\u786E\u6027\u65AD\u8A00\uFF0C\u56E0\u4E3A\u90A3\u6837\u5C06\u9700\u8981\u8003\u8651\u8BF8\u5982\u5185\u5B58\u9650\u5236\u5728\u5185\u7684\u66F4\u591A\u95EE\u9898\u3002 \u8BC1\u660E\u8BBA\u4E2D\u6709\u4E00\u4E2A\u7ED3\u8BBA\u67EF\u91CC-\u970D\u534E\u5FB7\u540C\u6784\u3002\u8FD9\u4E00\u7ED3\u8BBA\u8BA4\u4E3A\uFF1A\u4EFB\u610F\u4E00\u4E2A\u5728\u6784\u9020\u6027\u903B\u8F91\u4E0B\u7684\u529F\u80FD\u6B63\u786E\u6027\u7684\u8BC1\u660E\u90FD\u5BF9\u5E94\u4E86\u4E00\u4E2A\u03BB\u6F14\u7B97\u7A0B\u5E8F\u3002\u8FD9\u79CD\u8F6C\u6362\u8BC1\u660E\u7684\u65B9\u5F0F\u88AB\u79F0\u4E3A\u7A0B\u5E8F\u62BD\u51FA\uFF08\u82F1\u6587\uFF1Aprogram extraction\uFF09\u3002 \u970D\u5C14\u903B\u8F91\u662F\u4E00\u4E2A\u5177\u4F53\u7684\u80FD\u591F\u4E25\u5BC6\u9A8C\u8BC1\u7A0B\u5E8F\u6B63\u786E\u6027\u7684\u5F62\u5F0F\u7CFB\u7EDF\u3002\u5B83\u7528\u4E00\u7CFB\u5217\u7684\u516C\u7406\u6765\u5B9A\u4E49\u7A0B\u5E8F\u8BED\u8A00\u7684\u8BED\u4E49\uFF0C\u4ECE\u800C\u901A\u8FC7\u79F0\u4E4B\u4E3A\u970D\u5C14\u4E09\u5143\u7EC4\u7684\u65AD\u8A00\u6765\u9A8C\u8BC1\u7A0B\u5E8F\u7684\u6B63\u786E\u6027\u3002 \u8F6F\u4EF6\u6D4B\u8BD5\u662F\u6307\u9A8C\u8BC1\u4E00\u4E2A\u7A0B\u5E8F\u6216\u7CFB\u7EDF\u7684\u67D0\u4E9B\u5C5E\u6027\u6216\u80FD\u529B\u6765\u5224\u65AD\u5B83\u662F\u5426\u8FBE\u5230\u9884\u671F\u76EE\u7684\u7684\u884C\u4E3A\u3002\u5C3D\u7BA1\u8F6F\u4EF6\u6D4B\u8BD5\u5728\u8F6F\u4EF6\u8D28\u91CF\u65B9\u9762\u8D77\u7740\u81F3\u5173\u91CD\u8981\u7684\u4F5C\u7528\uFF0C\u5E76\u4E14\u88AB\u7A0B\u5E8F\u5458\u548C\u6D4B\u8BD5\u5458\u4EEC\u5E7F\u6CDB\u91C7\u7528\uFF0C\u4F46\u7531\u4E8E\u4EBA\u4EEC\u5BF9\u8F6F\u4EF6\u7684\u8BA4\u8BC6\u5341\u5206\u6709\u9650\uFF0C\u5B83\u4ECD\u65E7\u662F\u4E00\u4E2A\u8270\u6DF1\u7684\u9886\u57DF\u3002\u8F6F\u4EF6\u6D4B\u8BD5\u7684\u6700\u5927\u96BE\u70B9\u5728\u4E8E\u5982\u4F55\u63A7\u5236\u5176\u590D\u6742\u6027\uFF1A\u6211\u4EEC\u6CA1\u6709\u529E\u6CD5\u5728\u4E00\u4E2A\u5408\u7406\u7684\u590D\u6742\u5EA6\u5185\u5B8C\u6574\u5730\u6D4B\u8BD5\u4E00\u4E2A\u7A0B\u5E8F\u3002\u6D4B\u8BD5\u4E0D\u53EA\u662F\u8C03\u8BD5\u3002\u6D4B\u8BD5\u7684\u76EE\u7684\u5305\u62EC\u4F46\u4E0D\u9650\u4E8E\u786E\u4FDD\u8F6F\u4EF6\u8D28\u91CF\u3001\u9A8C\u8BC1\u5176\u6B63\u786E\u6027\u548C\u4F30\u7B97\u5176\u7A33\u5B9A\u6027\u3002\u6211\u4EEC\u5BF9\u6D4B\u8BD5\u7684\u5B9A\u4E49\u4E5F\u53EF\u4EE5\u66F4\u52A0\u4E00\u822C\u5316\uFF0C\u5176\u4E2D\u6B63\u786E\u6027\u6D4B\u8BD5\u548C\u7A33\u5B9A\u6027\u6D4B\u8BD5\u662F\u4E24\u4E2A\u6700\u5927\u7684\u7814\u7A76\u9886\u57DF\u3002\u8F6F\u4EF6\u6D4B\u8BD5\u662F\u9884\u7B97\u3001\u65F6\u95F4\u548C\u8F6F\u4EF6\u8D28\u91CF\u7684\u4E00\u4E2A\u5E73\u8861\u3002"@zh . . . "\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3051\u308B\u6B63\u5F53\u6027\uFF08Correctness\uFF09\u3068\u306F\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u304C\u305D\u306E\u4ED5\u69D8\u306B\u7167\u3089\u3057\u3066\u6B63\u3057\u3044\u3053\u3068\u3092\u610F\u5473\u3059\u308B\u3002\u300C\u6A5F\u80FD\u7684\u300D\u6B63\u5F53\u6027\u3068\u306F\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306E\u5165\u51FA\u529B\u52D5\u4F5C\u306B\u95A2\u3059\u308B\u6B63\u5F53\u6027\u3067\u3042\u308B\uFF08\u3059\u306A\u308F\u3061\u3001\u5404\u5165\u529B\u306B\u5BFE\u3057\u3066\u6B63\u3057\u304F\u51FA\u529B\u3092\u751F\u6210\u3059\u308B\u3053\u3068\uFF09\u3002\u5F62\u5F0F\u7684\u691C\u8A3C\u3092\u53C2\u7167\u3055\u308C\u305F\u3044\u3002 \u5B8C\u5168\u6B63\u5F53\u6027\uFF08Total Correctness\uFF09\u306F\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u304C\u5E38\u306B\u505C\u6B62\u3059\u308B\u3053\u3068\u3082\u8981\u6C42\u3055\u308C\u308B\u3002\u4E00\u65B9\u3001\u90E8\u5206\u6B63\u5F53\u6027\uFF08Partial Correctness\uFF09\u306F\u5358\u306B\u8FD4\u3063\u3066\u304F\u308B\u7B54\u3048\u304C\u6B63\u3057\u3044\u3053\u3068\u306E\u307F\u3092\u8981\u6C42\u3059\u308B\uFF08\u5E38\u306B\u7B54\u3048\u304C\u8FD4\u3063\u3066\u304F\u308B\u3068\u306F\u9650\u3089\u306A\u3044\uFF09\u3002\u505C\u6B62\u554F\u984C\u306B\u306F\u6C4E\u7528\u7684\u89E3\u6CD5\u306F\u306A\u3044\u306E\u3067\u3001\u5B8C\u5168\u6B63\u5F53\u6027\u306F\u3088\u308A\u6DF1\u3044\u554F\u984C\u3092\u306F\u3089\u3093\u3067\u3044\u308B\u3002 \u4F8B\u3048\u3070\u3001\u6574\u6570\u3092 1 \u304B\u3089\u9806\u306B\u8ABF\u3079\u3066\u5947\u6570\u306E\u5B8C\u5168\u6570\u3092\u63A2\u3059\u3068\u3057\u305F\u5834\u5408\u3001\u90E8\u5206\u6B63\u5F53\u6027\u3092\u5099\u3048\u305F\u30D7\u30ED\u30B0\u30E9\u30E0\u3092\u66F8\u304F\u306E\u306F\u6975\u3081\u3066\u7C21\u5358\u3067\u3042\u308B\uFF08\u7D20\u56E0\u6570\u5206\u89E3\u3092\u884C\u3063\u3066 n \u304C\u5B8C\u5168\u6570\u304B\u3069\u3046\u304B\u3092\u8ABF\u3079\u308B\uFF09\u3002\u3057\u304B\u3057\u3001\u305D\u306E\u30D7\u30ED\u30B0\u30E9\u30E0\u304C\u5B8C\u5168\u6B63\u5F53\u6027\u3092\u5099\u3048\u3066\u3044\u308B\u3068\u3059\u308B\u306B\u306F\u6570\u8AD6\u306B\u304A\u3044\u3066\u672A\u77E5\u306E\u77E5\u8B58\u3092\u5FC5\u8981\u3068\u3059\u308B\u3002 \u6B63\u5F53\u6027\u306E\u8A3C\u660E\u306F\u6570\u5B66\u7684\u8A3C\u660E\u3067\u306A\u3051\u308C\u3070\u306A\u3089\u305A\u3001\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3082\u305D\u306E\u4ED5\u69D8\u8A18\u8FF0\u3082\u5F62\u5F0F\u7684\u306B\u4E0E\u3048\u3089\u308C\u306A\u3051\u308C\u3070\u306A\u3089\u306A\u3044\uFF08\u5F62\u5F0F\u7684\u4ED5\u69D8\u8A18\u8FF0\uFF09\u3002\u7279\u306B\u305D\u306E\u8A3C\u660E\u306F\u3001\u305D\u306E\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u3092\u7279\u5B9A\u306E\u30DE\u30B7\u30F3\u4E0A\u3067\u30D7\u30ED\u30B0\u30E9\u30E0\u3068\u3057\u3066\u5B9F\u88C5\u3057\u305F\u3082\u306E\u306B\u3064\u3044\u3066\u6B63\u5F53\u6027\u3092\u610F\u5473\u3059\u308B\u3082\u306E\u3067\u306F\u306A\u3044\u3002\u305D\u306E\u5834\u5408\u30E1\u30E2\u30EA\u91CF\u306E\u9650\u754C\u3092\u8003\u616E\u3059\u308B\u5FC5\u8981\u304C\u3042\u308B\u3002"@ja . "1052944498"^^ . "Un algorithme est correct s'il fait ce qu'on attend de lui. Plus pr\u00E9cis\u00E9ment, rappelons qu'un algorithme est d\u00E9crit par une sp\u00E9cification des donn\u00E9es sur lesquelles l'algorithme va d\u00E9marrer son calcul et une sp\u00E9cification du r\u00E9sultat produit par l'algorithme. D\u00E9montrer la correction de l'algorithme consiste \u00E0 d\u00E9montrer que l'algorithme retourne, quand il calcule en partant des donn\u00E9es, un objet qui est un des r\u00E9sultats escompt\u00E9s et qui satisfait la sp\u00E9cification du r\u00E9sultat comme \u00E9nonc\u00E9 dans la description de l'algorithme."@fr . . . . . . . . . . "Correctitud"@es . . . . . "Na Ci\u00EAncia da computa\u00E7\u00E3o te\u00F3rica, a corretude de um algoritmo pode ser afirmada quando se diz que o algoritmo \u00E9 correto com respeito \u00E0 determinada especifica\u00E7\u00E3o. O termo corretude funcional se refere ao comportamento de entrada-sa\u00EDda do algor\u00EDtimo (isto \u00E9, para cada entrada ele produz a sa\u00EDda correta). \u00C9 feita uma distin\u00E7\u00E3o entre corretude total, que requer que o algoritmo tenha um fim, e corretude parcial, que requer simplesmente que se o algoritmo retornar uma resposta ela esteja correta. Uma vez que n\u00E3o h\u00E1 nenhuma solu\u00E7\u00E3o geral para o Problema da parada, afirmar a corretude total de um algoritmo pode ser algo muito dif\u00EDcil. A [An\u00E1lise de t\u00E9rmino] \u00E9 um tipo de prova matem\u00E1tica que desempenha um papel muito importante na verifica\u00E7\u00E3o formal por que a corretude total de um algoritmo depende de seu t\u00E9rmino. Por exemplo, buscando sucessivamente atrav\u00E9s dos n\u00FAmeros inteiros 1, 2, 3, \u2026 para ver se encontramos algum tipo de fen\u00F4meno \u2014 como encontrar um n\u00FAmero perfeito \u2014 \u00E9 muito f\u00E1cil escrever um programa parcialmente correto. Mas para dizer que este programa \u00E9 totalmente correto seria afirmar algo ainda desconhecido na teoria dos n\u00FAmeros. Uma prova teria de ser uma prova matem\u00E1tica, supondo que o algoritmo e a especifica\u00E7\u00E3o est\u00E3o dados formalmente. Em particular n\u00E3o se espera uma afirma\u00E7\u00E3o de corretude de um determinado programa implementando um algoritmo numa dada m\u00E1quina. Pois envolveria algumas considera\u00E7\u00F5es como limita\u00E7\u00F5es na mem\u00F3ria do computador. Na teoria da prova, o Isomorfismo de Curry-Howard, afirma que uma prova da corretude funcional na L\u00F3gica intuicionista corresponde a um certo programa no C\u00E1lculo lambda. Converter uma prova dessa maneira \u00E9 chamado extra\u00E7\u00E3o de programa. L\u00F3gica de Hoare \u00E9 um Sistema formal espec\u00EDfico com um conjunto de regras l\u00F3gicas para um racioc\u00EDnio rigoroso sobre a corretude na computa\u00E7\u00E3o."@pt . . . . . "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 (i.e., for each input it produces an output satisfying the specification). Within the latter notion, partial correctness, requiring that if an answer is returned it will be correct, is distinguished from total correctness, which additionally requires that an answer is eventually returned, i.e. the algorithm terminates. Correspondingly, to prove a program's total correctness, it is sufficient to prove its partial correctness, and its termination. The latter kind of proof (termination proof) can never be fully automated, since the halting problem is undecidable. For example, successively searching through integers 1, 2, 3, \u2026 to see if we can find an example of some phenomenon\u2014say an odd perfect number\u2014it is quite easy to write a partially correct program (see box). But to say this program is totally correct would be to assert something currently not known in number theory. 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. A deep result in proof theory, the Curry\u2013Howard correspondence, states that a proof of functional correctness in constructive logic corresponds to a certain program in the lambda calculus. Converting a proof in this way is called program extraction. Hoare logic is a specific formal system for reasoning rigorously about the correctness of computer programs. It uses axiomatic techniques to define programming language semantics and argue about the correctness of programs through assertions known as Hoare triples. Software testing is any activity aimed at evaluating an attribute or capability of a program or system and determining that it meets its required results. Although crucial to software quality and widely deployed by programmers and testers, software testing still remains an art, due to limited understanding of the principles of software. The difficulty in software testing stems from the complexity of software: we can not completely test a program with moderate complexity. Testing is more than just debugging. The purpose of testing can be quality assurance, verification and validation, or reliability estimation. Testing can be used as a generic metric as well. Correctness testing and reliability testing are two major areas of testing. Software testing is a trade-off between budget, time and quality."@en . "Un algorithme est correct s'il fait ce qu'on attend de lui. Plus pr\u00E9cis\u00E9ment, rappelons qu'un algorithme est d\u00E9crit par une sp\u00E9cification des donn\u00E9es sur lesquelles l'algorithme va d\u00E9marrer son calcul et une sp\u00E9cification du r\u00E9sultat produit par l'algorithme. D\u00E9montrer la correction de l'algorithme consiste \u00E0 d\u00E9montrer que l'algorithme retourne, quand il calcule en partant des donn\u00E9es, un objet qui est un des r\u00E9sultats escompt\u00E9s et qui satisfait la sp\u00E9cification du r\u00E9sultat comme \u00E9nonc\u00E9 dans la description de l'algorithme."@fr . "6698"^^ . . "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 (i.e., for each input it produces an output satisfying the specification). A deep result in proof theory, the Curry\u2013Howard correspondence, states that a proof of functional correctness in constructive logic corresponds to a certain program in the lambda calculus. Converting a proof in this way is called program extraction."@en . . . "Correction d'un algorithme"@fr . "Poprawno\u015B\u0107 ca\u0142kowita i cz\u0119\u015Bciowa algorytmu. \n* WP \u2013 warunek pocz\u0105tkowy \u2013 formu\u0142a logiczna definiuj\u0105ca dane wej\u015Bciowe algorytmu. \n* WK \u2013 warunek ko\u0144cowy \u2013 formu\u0142a logiczna definiuj\u0105ca dane wyj\u015Bciowe algorytmu uzyskane dla danych wej\u015Bciowych spe\u0142niaj\u0105cych WP."@pl . . . . . . . "Poprawno\u015B\u0107 ca\u0142kowita i cz\u0119\u015Bciowa algorytmu. \n* WP \u2013 warunek pocz\u0105tkowy \u2013 formu\u0142a logiczna definiuj\u0105ca dane wej\u015Bciowe algorytmu. \n* WK \u2013 warunek ko\u0144cowy \u2013 formu\u0142a logiczna definiuj\u0105ca dane wyj\u015Bciowe algorytmu uzyskane dla danych wej\u015Bciowych spe\u0142niaj\u0105cych WP."@pl . "Unter Korrektheit versteht man in der Informatik die Eigenschaft eines Computerprogramms, einer Spezifikation zu gen\u00FCgen (siehe auch Verifikation). Spezialgebiete der Informatik, die sich mit dieser Eigenschaft befassen, sind die Formale Semantik und die Berechenbarkeitstheorie. Nicht abgedeckt vom Begriff Korrektheit ist, ob die Spezifikation die vom Programm zu l\u00F6sende Aufgabe korrekt beschreibt (siehe dazu Validierung)."@de . . . .