0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R5,000 - R10,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Program Verification - Fundamental Issues in Computer Science (Hardcover, 1993 ed.): Timothy T. R. Colburn, J. H. Fetzer, R. L.... Program Verification - Fundamental Issues in Computer Science (Hardcover, 1993 ed.)
Timothy T. R. Colburn, J. H. Fetzer, R. L. Rankin
R7,888 Discovery Miles 78 880 Ships in 18 - 22 working days

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.

Program Verification - Fundamental Issues in Computer Science (Paperback, Softcover reprint of the original 1st ed. 1993):... Program Verification - Fundamental Issues in Computer Science (Paperback, Softcover reprint of the original 1st ed. 1993)
Timothy T. R. Colburn, J. H. Fetzer, R. L. Rankin
R8,336 Discovery Miles 83 360 Ships in 18 - 22 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Performance Analysis of Manufacturing…
Tayfur Altiok Hardcover R3,302 Discovery Miles 33 020
Three Lectures on Liberal Education
John Snelling Popkin Paperback R336 Discovery Miles 3 360
Bad Luck Penny
Amy Heydenrych Paperback  (1)
R350 R323 Discovery Miles 3 230
The Astrology Diary 2023
Ana Leo Paperback R372 Discovery Miles 3 720
Dancing The Death Drill
Fred Khumalo Paperback  (10)
R320 R295 Discovery Miles 2 950
Statistical Methods in Analytical…
P. C. Meier Hardcover R5,292 Discovery Miles 52 920
Babylon and Infidelity Foredoomed of God…
Edward Irving Paperback R712 Discovery Miles 7 120
Optimization of Stochastic Discrete…
Dmitrii Lozovanu, Stefan Pickl Hardcover R3,535 Discovery Miles 35 350
Nerves and Common Sense
Annie Payson Call Paperback R501 Discovery Miles 5 010
A Hibiscus Coast
Nick Mulgrew Paperback R290 R268 Discovery Miles 2 680

 

Partners