Cantitate/Preț
Produs

Proof and System-Reliability: NATO Science Series II: Mathematics, Physics and Chemistry, cartea 62

Editat de Helmut Schwichtenberg, Ralf Steinbrüggen
en Limba Engleză Paperback – 31 mai 2002
As society comes to rely increasingly on software for its welfare and prosperity there is an urgent need to create systems in which it can trust. Experience has shown that confidence can only come from a more profound understanding of the issues, which in turn can come only if it is based on logically sound foundations.
This volume contains contributions from leading researchers in the critical disciplines of computing and information science, mathematics, logic, and complexity. All contributions are self-contained, aiming at comprehensibility as well as comprehensiveness. The volume also contains introductory hints to technical issues, concise surveys, introductions, and various fresh results and new perspectives.
Citește tot Restrânge

Din seria NATO Science Series II: Mathematics, Physics and Chemistry

Preț: 38770 lei

Nou

Puncte Express: 582

Preț estimativ în valută:
7420 7707$ 6163£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781402006081
ISBN-10: 140200608X
Pagini: 432
Ilustrații: XII, 415 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.59 kg
Ediția:Softcover reprint of the original 1st ed. 2002
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria NATO Science Series II: Mathematics, Physics and Chemistry

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

Cartesian Closed Categories of Effective Domains.- Algorithmic Game Semantics: A Tutorial Introduction.- Algebra of Networks.- Computability and Complexity from a Programming Perspective.- Logical Frameworks: A Brief Introduction.- Ludics: An Introduction.- Naïve Computational Type Theory.- Proof-Carrying Code. Design and Implementation.- Abstractions and Reductions in Model Checking.- Hoare Logic: From First-order to Propositional Formalism.- Hoare Logics in Isabelle/HOL.- Proof Theoretic Complexity.- Feasible Computation with Higher Types.