
Proof and System-Reliability
Kluwer Academic Publishers
1st Edition
Published on 31. May 2002
Book
Hardback
XII, 415 pages
978-1-4020-0607-4 (ISBN)
Article exhausted; check different version
Description
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.
More details
Series
Edition
1., 2002
Language
English
Place of publication
Dordrecht
United States
Target group
College/higher education
Professional and scholarly
Research
Product notice
sewn/stitched
Cloth over boards
Illustrations
XII, 415 p.
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 29 mm
Weight
811 gr
ISBN-13
978-1-4020-0607-4 (9781402006074)
DOI
10.1007/978-94-010-0413-8
Schweitzer Classification
Other editions
Additional editions

Helmut Schwichtenberg | Ralf Steinbrüggen
Proof and System-Reliability
Book
05/2002
Kluwer Academic Publishers
€53.49
Shipment within 15-20 days
Content
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.