Institutional Repository

Browsing 1987 4th Southern African Computer Symposium by Issue Date

Browsing 1987 4th Southern African Computer Symposium by Issue Date

Sort by: Order: Results:

  • Protocol performance using image protocols 
    Kritzinger, PS (1987)
    Performance analyses of data communication systems do not always rely on a detailed analysis of the underlying protocols. Those analyses which do, usually rely on an analysis of the protocol state transition graph. These ...
  • Experience with a pattern-matching code generator 
    Mulders, MA Serwy, DA Van Biljon, WR (1987)
    An implementation of a Graham-Glanville type pattern-matching code generator for the NRIMS systems programming language SCRAP is discussed. The simple heuristic algorithm on which the pattern matcher is based is presented ...
  • Set-oriented functional style of programming 
    Mueller, CSM (1987)
    A novel way of programming, which starts with specific details of a particular example and abstracts these details into generalised sets, is proposed. The whole program is constructed around the definition of these sets. ...
  • The representation of chemical structures by random context structure grammars 
    Ehlers, EM Von Solms, SH (1987)
    A representation of chemical molecules by Random Context Structure Grammars is proposed. Random Context Structure Grammars generate three-dimensional digital structures. Random Context Structure Grammars and Random Context ...
  • A semantic data model approach to logical data independence 
    Berman, S (1987)
    Semantic data models were originally introduced as a tool for data description and design. SDMI (Semantic Data Model Interface) investigates their use in another role - as the basis for a data manipulation language - and ...
  • A generalised expression structure 
    Van Biljon, WR (1987)
    The expression structure of programming languages is examined. Two weaknesses are identified. The first pertains to the inability, or limited ability, to redefine operators or to define new operators. The second pertains ...
  • The design and use of a Prolog trace generator for CSP 
    Kourie, DG (1987)
    The role of traces in the context of formal description techniques is discussed, as well as issues arising in the generation of these traces by means of software. A trace generator (written in Prolog) for systems described ...
  • Hidden surface elimination in raster graphics using visigrams 
    Gorringe, HP (1987)
    In any form of display where three-dimensional images are required to be projected onto a two-dimensional display the hidden surface or hidden line removal certainly helps to enhance the realism of the final image. This ...
  • Ada for multi-microprocessors: some problems and solutions 
    Bishop, JM (1987)
    This paper looks at ways of obtaining a distributed version of an Ada program. Since current approaches require a large investment in system software, we propose instead the use of an Adapter, which can be a manual methodology ...
  • The ELSIM language: an FSM-based language for the ELSIM SEE 
    Du Plessis, L Borman, C (1987)
    A formal requirements specification language, the ELSIM language, is presented. The language uses conceptual models for modelling data processing, and control characteristics and behaviour of real-time systems, and is ...
  • SPS-ALGOL: Semantic constructs in a persistent programming language 
    Berman, S (1987)
    Persistent data is defined as that which survives on secon­dary store after program execution terminates. In a persistent programming language there is no distinction what ­ever between persistent data and ...
  • An approach to direct end-user usage of multiple databases 
    Philips, MJ (1987)
    The difficulties encountered by users without experience of the use of multiple databases are described, as well as an approach which allow such users to make worthwhile use of these systems, encompassing potentially ...
  • On syntax and semantics related to incomplete information databases 
    Orlowska, ME (1987)
    We propose a mathematical model of a database with incomplete information, which we call the N-system. Basically speaking, such a system stores information concerning properties of some objects. The information may be ...
  • An extensible system and a programming tool for workstation computers 
    Wirth, N (1987)
  • Three packaging rules for information systems design 
    Mende, J (1987)
    After identifying the processing functions required in a computer based information system, the designer needs to combine them into an optimal se t of load un its. Some “packaging” arrangements yield a better system than ...
  • A new general-purpose operating system 
    Venter, BH (1987)
    The current generation of widely-used, multi-user, general-purpose operating systems have evolved from versions that were designed when many of the issues that are important today were unimportant or not even thought of. ...
  • Towards a programming environment standard in LISP 
    Mori, R (1987)
    The programming requirements of the Artificial Intelligence ( AI ) community have led to the creation of tools to aid the software development process. One such tool is the programming environment. ...
  • An approximate solution method for multiclass queueing networks with state dependent routing and window flow control 
    Krzesinski, AE (1987)
    A Multidass Queueing Network (MQN) Q ( N, .M ) consisting of M centres with index set .M and population vector N is partitioned into two subnetworks Q ( fJ -V , .M -1) ) and Q (V , V ) . The centres in Q (V , · V ) are ...
  • A protocol validation system 
    Punt, JL (1987)
    This paper discusses a protocol validation system. The input to the system is a protocol definition specified in the specification language ESTELLE. The ESTELLE specification is the input to a translator program which ...
  • Petri net topologies for a specification language 
    Watson, AG (1987)
    This paper presents a formal technique for enforcing deterministic exec­ution in Petri nets, and proceeds to demonstrate how the resultant topology may be used to enforce partial sequencing so that various ...

Search UnisaIR


Browse

My Account