By Topic

IEE Proceedings E - Computers and Digital Techniques

Issue 2 • Date March 1982

Filter Results

Displaying Results 1 - 8 of 8
  • Specification and tasking in Ada

    Publication Year: 1982
    IEEE is not the copyright holder of this material | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • Axioms and proof rules for Ada tasks

    Publication Year: 1982, Page(s):38 - 48
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1429 KB)

    An axiomatic proof system is developed for use in proving partial correctness and absence of deadlock in Ada tasks. Axioms for the Ada tasking primitives in isolation are presented, and then rules proposed that describe the logical interaction of tasks through the rendezvous mechanism. These axioms and rules are then used to present partial correctness proofs of parallel-processing examples writte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ada package specifications: path expressions and monitors

    Publication Year: 1982, Page(s):49 - 54
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (743 KB)

    The paper describes how path expressions can be introduced in an Ada package specification to define the permitted interleavings between calls on the functions and procedures in the visible part of the package. A preprocessor is described which synthesises the internal task and entry calls required to enforce the specified protocols. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program verification and Ada

    Publication Year: 1982, Page(s):55 - 62
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1093 KB)

    One of the design aims of Ada was to provide a language which would encourage the production of reliable programs: An important technique used to provide greater reliability is program verification. In this paper, we comment on the design of Ada from this particular point of view and we indicate particular approaches to the verification of Ada programs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure and tasking features of the programming language Martlet

    Publication Year: 1982, Page(s):63 - 69
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (875 KB)

    This paper describes the structure and tasking features of the programming language Martlet. Martlet is based on two languages: Pascal and the US Department of Defence language Ada. Essentially, the sequential part of the language is Pascal and this has been extended to include a number of the structural and tasking features of Ada. The latter are described in the paper, and also the overheads req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying and implementing object managers in Ada

    Publication Year: 1982, Page(s):70 - 74
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (631 KB)

    An outline of a formalism for writing specifications of synchronisation behaviours is given, together with a sketch of an approach to the transformation between such a specification and an implementation in Ada. The model of implementation is that each specification is regarded as defining a mechanism, the 'object manager', which controls the occurrence of events in the system. Each object manager... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ada model arithmetic: costs and benefits

    Publication Year: 1982, Page(s):75 - 80
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (765 KB)

    The design of the Ada arithmetic capabilities is presented as an elaborate compromise between conflicting requirements of efficiency and machine independence. The costs and benefits incurred by this compromise are explored in some detail and some areas for eventual investigation in the light of future experience with Ada arithmetic are identified. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Book review: Ada: an Introduction and Reference Manual

    Publication Year: 1982
    IEEE is not the copyright holder of this material | PDF file iconPDF (126 KB)
    Freely Available from IEEE