9786131155277 - termination analysis: computer science, computer program, program analysis, halting problem, mathematical proof, formal verification, total correctness (4 resultados)

- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 39,00
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 for…m 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. 104 pp. Englisch.

- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 40,58
Envío por EUR 60,87Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.

- Tapa blanda
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 125,30
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: 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 & C…o. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 156,00
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computerscience, termination analysis attempts to determine whether theevaluation of a given program will…definitely terminate. It is a form ofprogram analysis that is related to the halting problem. Because theHalting Problem is undecidable, termination analysis cannot workcorrectly in all cases. The aim is to find the answer 'program doesterminate' (or 'program does not terminate') whenever this is possible.Without success the algorithm (or human) working on the terminationanalysis may answer with 'maybe' or continue working infinitely long.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 104 pp. Englisch.