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...
Plasma Remediation Technology for…
Changming Du, Jianhua Yan Hardcover R2,653 Discovery Miles 26 530
Tower C13 Round Col. Code Labels - Red…
R31 R25 Discovery Miles 250
The Boy Who Could Keep A Swan In His…
John Hunt Paperback  (1)
R304 Discovery Miles 3 040
Tower C10 Round Col. Code Label Sheets…
R25 R20 Discovery Miles 200
Dancing The Death Drill
Fred Khumalo Paperback  (10)
R294 Discovery Miles 2 940
Fundamentals Of Project Management…
Rory Burke Paperback  (2)
R495 R457 Discovery Miles 4 570
Operational Risk Management
J Young Paperback R603 Discovery Miles 6 030
Global logistics management
Dr Craig Voortman Paperback  (3)
R426 Discovery Miles 4 260
Operations and Supply Chain Management
James Evans, David Collier Hardcover R1,423 R1,322 Discovery Miles 13 220
Documents of the Lewis and Clark…
C. BrĂ­d Nicholson Hardcover R2,721 Discovery Miles 27 210

 

Partners