Cantitate/Preț
Produs

Proof and System-Reliability: NATO Science, cartea 62

Autor Ralf Steinbruggen, Helmut Schwichtenberg
en Limba Engleză Hardback – 30 apr 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

Preț: 65333 lei

Preț vechi: 76862 lei
-15% Nou

Puncte Express: 980

Preț estimativ în valută:
12505 13005$ 10479£

Carte tipărită la comandă

Livrare economică 14-28 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781402006074
ISBN-10: 1402006071
Pagini: 415
Dimensiuni: 160 x 240 mm
Greutate: 0.78 kg
Editura: Springer
Seria NATO Science

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

Cartesian Closed Categories of Effective Domains; G. Hamrin, V. Stoltenberg-Hansen. Algebraic Game Semantics: A Tutorial Introduction; S. Abramsky. Algebra of Networks; G. Stefanescu. Computability and Complexity from a Programming Perspective; N.D. Jones. Logical Frameworks: A Brief Introduction; F. Pfenning. Ludics: An Introduction; J.-Y. Girard. Naïve Computational Type Theory; R. Constable. Proof-Carrying Code. Design and Implementation; G. Necula. Abstractions and Reductions in Model Checking; O. Grumberg. Hoare Logic: From First Order to Propositional Formalism; J. Tiuryn. Hoare Logics in Isabelle/HOL; T. Nipkow. Proof Theory and Complexity; G.E. Ostrin, S.S. Wainer. Feasible Computation with Higher Types; H. Schwichtenberg, S.J. Bellantoni.