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 (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,611 Discovery Miles 86 110 Ships in 10 - 15 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 (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
R8,857 Discovery Miles 88 570 Ships in 10 - 15 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...
Casio LW-200-7AV Watch with 10-Year…
R999 R884 Discovery Miles 8 840
Aerolatte Cappuccino Art Stencils (Set…
R110 R95 Discovery Miles 950
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Snappy Tritan Bottle (1.2L)(Blue)
 (2)
R239 R169 Discovery Miles 1 690
Alcolin Cold Glue (125ml)
R46 Discovery Miles 460
Bostik Clear Gel (25ml)
R40 Discovery Miles 400
Maped Croc Croc 1 Hole Frog Canister…
R50 Discovery Miles 500
Salton 3 Bar Heater
R613 Discovery Miles 6 130
Microsoft Xbox Series X Console (1TB)
 (21)
R14,999 Discovery Miles 149 990
Bostik Easy Tear Tape (12mm x 33m)
R14 Discovery Miles 140

 

Partners