Transport gratuit la punctele de livrare Pick Up peste 299 lei
Packeta 15 lei Easybox 20 lei Cargus 25 lei FAN 25 lei

Limba englezăengleză
Carte Copertă tare
Carte Program Verification Timothy T. R. Colburn
Codul Libristo: 05249984
Editura Springer, ianuarie 1993
Among the most important problems confronting computer science is that of developing a paradigm appr... Descrierea completă
? points 944 b
1.900 lei
În depozitul extern în cantități mici Expediem în 14-18 zile

30 de zile pentru retur bunuri


Ar putea de asemenea, să te intereseze


Klavierspielen mit der Maus Bettina Schwedhelm / Carte broșată
common.buy 147 lei
Torre Attack: Move by Move Richard Palliser / Carte broșată
common.buy 133 lei
Sadar + Vuga: A Review Andreas Ruby / Copertă tare
common.buy 451 lei
Tide is Right Hugo Charteris / Carte broșată
common.buy 50 lei
Women in the Chartist Movement Jutta Schwarzkopf / Copertă tare
common.buy 847 lei
Topics In Integral Geometry D. L. Ren / Carte broșată
common.buy 303 lei
Sex Crimes under the Wehrmacht David Raub Snyder / Copertă tare
common.buy 324 lei

Among the most important problems confronting computer science is that of developing a paradigm appropriate to the discipline. Proponents of formal methods - such as John McCarthy, C.A.R. Hoare, and Edgar Dijkstra - have advanced the position that computing is a mathematical activity and that computer science should model itself after mathematics. Opponents of formal methods - by contrast, suggest that programming is the activity which is fundamental to computer science and that there are important differences that distinguish it from mathematics, which therefore cannot provide a suitable paradigm. Disagreement over the place of formal methods in computer science has recently arisen in the form of renewed interest in the nature and capacity of program verification as a method for establishing the reliability of software systems. A paper that appeared in Communications of the ACM entitled, `Program Verification: The Very Idea', by James H. Fetzer triggered an extended debate that has been discussed in several journals and that has endured for several years, engaging the interest of computer scientists (both theoretical and applied) and of other thinkers from a wide range of backgrounds who want to understand computer science as a domain of inquiry. The editors of this collection have brought together many of the most interesting and important studies that contribute to answering questions about the nature and the limits of computer science. These include early papers advocating the mathematical paradigm by McCarthy, Naur, R. Floyd, and Hoare (in Part I), others that elaborate the paradigm by Hoare, Meyer, Naur, and Scherlis and Scott (in Part II), challenges, limits and alternatives explored by C. Floyd, Smith, Blum, and Naur (in Part III), and recent work focusing on formal verification by DeMillo, Lipton, and Perlis, Fetzer, Cohn, and Colburn (in Part IV). It provides essential resources for further study. This volume will appeal to scientists, philosophers, and laypersons who want to understand the theoretical foundations of computer science and be appropriately positioned to evaluate the scope and limits of the discipline.

Dăruiește această carte chiar astăzi
Este foarte ușor
1 Adaugă cartea în coș și selectează Livrează ca un cadou 2 Îți vom trimite un voucher în schimb 3 Cartea va ajunge direct la adresa destinatarului

Logare

Conectare la contul de utilizator Încă nu ai un cont Libristo? Crează acum!

 
obligatoriu
obligatoriu

Nu ai un cont? Beneficii cu contul Libristo!

Datorită contului Libristo, vei avea totul sub control.

Creare cont Libristo