Programming Concepts and Methods
Conference Proceedings
Published in November 1990
Book
Hardback
590 pages
978-0-444-88545-6 (ISBN)
Description
The papers presented in this book were originally presented at a conference organized jointly by IFIP working groups 2.2 and 2.3. The titles of the groups are "Formal Description of Programming Concepts" and "Programming Methodology" respectively. There is no formal division between these two areas. The papers here which relate to fundamental notions and notations reflect current issues in formal (semantic) description. Programming methods use such description languages but are also concerned with methods of developing implementations which can be shown to satisfy their specifications. Members of both working groups have an interest in mechanical support for the task of proving theorems and the book includes several papers relating to such systems or their underlying logical frameworks.
The papers presented in this book were originally presented at a conference organized jointly by IFIP working groups 2.2 and 2.3. The titles of the groups are "Formal Description of Programming Concepts" and "Programming Methodology" respectively. There is no formal division between these two areas. The papers here which relate to fundamental notions and notations reflect current issues in formal (semantic) description. Programming methods use such description languages but are also concerned with methods of developing implementations which can be shown to satisfy their specifications. Members of both working groups have an interest in mechanical support for the task of proving theorems and the book includes several papers relating to such systems or their underlying logical frameworks.
The papers presented in this book were originally presented at a conference organized jointly by IFIP working groups 2.2 and 2.3. The titles of the groups are "Formal Description of Programming Concepts" and "Programming Methodology" respectively. There is no formal division between these two areas. The papers here which relate to fundamental notions and notations reflect current issues in formal (semantic) description. Programming methods use such description languages but are also concerned with methods of developing implementations which can be shown to satisfy their specifications. Members of both working groups have an interest in mechanical support for the task of proving theorems and the book includes several papers relating to such systems or their underlying logical frameworks.
More details
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Elsevier Science & Technology
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 220 mm
ISBN-13
978-0-444-88545-6 (9780444885456)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Content
Stepwise Refinement of Mixed Specifications of Concurrent Programs (B.A. Sanders). The Refinement Theorem for ST-Bisimulation Semantics (R.J. van Glabbeek). On the Refinement of Non-Deterministic Recursive Routines by Transformations (R. Berghammer, H. Ehler, B. Moller). Language Constructs for Distributed Systems (S. Katz, I. Forman, M. Evangelist). Semantics-Driven Decompositions for the Verification of Distributed Programs (L. Fix, N. Francez, O. Grumberg). Timed Observations: A Semantic Model for Real-Time Concurrency (Y. Ortega-Mallen, D. de Frutos-Escrig). Deriving Denotational Models for Bisimulation from Structured Operational Semantics (J.J.M.M. Rutten). Refinement Concepts Formalized in Higher Order Logic (R.J.R. Back, J. von Wright). Formalization of the Bird-Meertens Algorithmic Calculus in the Deva Meta-Calculus (M. Weber). Automating Squiggol (U. Martin, T. Nipkow). Algorithms from Theorems (J. Jeuring). Abstract Relational Specifications (J. Desharnais, N.H. Madhavji). Global Control for Communicating Processes (A. Dietl). A Proof System for Process Creation (P. America, F. de Boer). Formalization of the VDM Reification in the DEVA Meta-Calculus - The Human-Leucocyte-Antigen Case Study (C. Lafontaine). Using LP to Debug Specifications (S.J. Garland, J.V. Guttag). Mechanizing Unity (D.M. Goldschlag). ATP: An Algebra for Timed Processes (X. Nicollin et al.). Algebraic Reasoning for Probabilistic Concurrent Systems (A. Giacalone, C.-C. Jou, S.A. Smolka). A Theory of Synchrony and Asynchrony (He Jifeng, M.B. Josephs, C.A.R. Hoare). Abstract Types and the Dot Notation (L. Cardelli, X. Leroy). Reasoning About Interpretations in Qualitative lambda-Models (F. Honsell, S. Ronchi della Rocca). Information Loss in the Programming Logic TK (M.C. Henson). Linear Types can Change the World! (P. Wadler).