Proof and system-reliability
Author(s)
Bibliographic Information
Proof and system-reliability
（NATO science series, II . Mathematics,
Kluwer Academic, c2002
- : pbk
Available at / 13 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P(*)||NATO S-II||6202017777
-
National Institutes of Natural Sciences Okazaki Library and Information Center図
421.5/Pr9108482021
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Proceedings of the NATO Advanced Study Institute on Proof and System-Reliability, Marktoberdorf, Germany, 24 July - 5 August, 2001
Description and Table of Contents
- Volume
-
ISBN 9781402006074
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.
- Volume
-
: pbk ISBN 9781402006081
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.
Table of Contents
- 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. Naive 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.
by "Nielsen BookData"