correctness problem computer science (5 résultats)

Hardcover. Etat : UsedGood. Hardcover; surplus library copy with the usual stampings; reference number taped to spine; fading, scuffing, and shelf wear to exterior; in good condition with clean text, firm binding.

Hard Cover. Etat : Very Good. No Jacket. First Edition. VG, hardback, white pictorial glazed boards with green titles on tarnished spine, contents are clean and unmarked, 279pp. Ex-Royal Aircraft Establishment Library, weight 500g. International Lecture series in Computer Science. Ex-Library.

.- London - New York - Toronto - Sydney - San Francisco. 1981. Academic Press . 4º menor. XIII- 279 pgs. Cartoné editorial. Muy buen estado. . . ISBN 10: 0121229203. Informática.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! In computer science, termination analysis attempts to determine whether the evaluation of a given program will definitely terminate. It is a form of program analysis that is related to the halting problem. Because the Halting Problem is undecidable, termination analysis cannot work correctly in all cases. The aim is to find the answer 'program does terminate' (or 'program does not terminate') whenever this is possible. Without success the algorithm (or human) working on the termination analysis may answer with 'maybe' or continue working infinitely long.

Taschenbuch. Etat : Neu. Termination Analysis | Computer Science, Computer Program, Program Analysis, Halting Problem, Mathematical Proof, Formal Verification, Total Correctness | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131155277 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.