Programming methodology

From MaRDI portal





The book represents a collections of essays concerning the various topics of programming methodology. The idea of assembling papers on this theme to form a book arose in the technical meetings of the members of the Working Group 2.3 of the International Federation for Information Processing. The book is dedicated to the memory of two founding members of IFIP: O. J. Dahl and E. W. Dijkstra. The book comprises three parts, each one devoted to a major theme in programming methodology. The parts are further divided into subsections where essays focussing on a particular topic are gathered together. Part I -- Models and correctness contains subsections A -- Concurrency and interaction, B -- Logical approaches to asynchrony, C -- Systems and real time, D - Specifying complex behaviour. Part II -- Programming techniques contains subsections E -- Object orientation and F -- Type theory. Part III -- Applications and automated theories contains subsections G -- Putting theories into practice by automation and I -- Security and keeping secrets. J. Misra in ``A reduction theorem for concurrent object-oriented programs introduces a programming notation for concurrent programs, called Seuss, and show that concurrent executions of these programs are, under certain conditions, equivalent to serial executions. The paper ``Aspects of system description written by M. Jackson describes some of the problems associated with the development of systems in the context of the real world. It clarifies the distinction between ``real world requirements in the problem domain and abstract ``program specification at the computer interface. P. Henderson in ``Modelling architectures for dynamic systems is concerned with formally defining architectures for a dynamic system that changes its configuration as it runs. M. Broy in ``Object-oriented programming and software development - a critical assesment shows that object-oriented techniques of today are not in accordance with the state of the art in scientific programming methodology and software engineering. B.C. Pierce in ``Type systems discusses the motivations and history of type systems (for automatically proving the absence of certain program behaviors) and their role in programming language design. P. Zave in ``An experiment in feature engineering presents a feature-oriented specification method. It consists of a base specification and feature modules, each of which specifies a separate feature of the system. The method is illustrated on an example of a modular architecture for describing the communication services. S. Chari et al. in the paper ``Power analysis: attacks and countermeasures focus on the leakage of information from the instantaneous power consumption of a system executing a cryptographic computation. The authors propose a model for the power consumption of system and a generic programming technique for creation provably secure implementations. The last essay by A. Melver and C. Morgan, who are editors of this book, is concerned with a probabilistic approach to information hiding. A sample selected above from twenty essays of the book shows the topics cover relatively broad spectrum of programming methodology. The authors mostly presuppose good familiarity with the subject and used notation. Each essay concludes with a good set of references. This interesting book may be recommended namely to readers actively working in the field.











This page was built for publication: Programming methodology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797830)