School of Computing: Recent submissions

  • Quantifier elimination in second order predicate logic 
    Gabbay, D; Ohlbach, HJ (South African Computer Society (SAICSIT), 1992)
    An algorithm is presented which eliminates second-order quantifiers over predicate variables in formulae of type 3Pi , ...,Pn 1/; where 1/J is an arbitrary formula of first-order predicate logic. The resulting formula is ...
  • A multitasking operating system above MS-DOS 
    Foss, RJ; Rehmet, GM; Watkins, RC (South African Computer Society (SAICSIT), 1992)
    This paper describes the development of a memory resident version of the Xinu operating system for the IBM PC range of computers. The operating system co-resides with the MS-DOS operating system. The need for the operating ...
  • Placing processes in a transputer-based Linda programming environment 
    Clayton, Peter G.; de-Heer-Menlah, FK; Wentworth, EP (South African Computer Society (SAICSIT), 1992)
    This paper presents a process placement algorithm, designed for use in a transputer-based implementation of the Linda programming environment. A static, heuristic approach is adopted, which takes cognisance of the special ...
  • A model for object-oriented databases 
    Brand, M; Wood, PT (South African Computer Society (SAICSIT), 1992)
    Unlike the relational model, there is no universally accepted object-oriented data model. This has led to systems being defined in an ad-hoc manner, with the resultant difficulty of determining exactly what features are ...
  • Galileo: Experimenting with graphical user interfaces 
    Apteker, RT; Bishop, JM (South African Computer Society (SAICSIT), 1992)
    Graphic User Interfaces (GUls) are the key ingredient in the development of a new era of computer software. Pioneered at Xerox, launched at Apple, pursued by Microsoft, and challenged by a host of others, the age of the ...
  • ESML - A validation language for concurrent systems 
    De Villiers, PJA; Visser, WC (South African Computer Society (SAICSIT), 1992)
    Designing a concurrent reactive system which can be proven correct is a challenging task. A promising technique involves building a validation model which can be shown to have important correctness properties. This paper ...
  • The Design Objectives of Quadlisp 
    Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    Quadlisp is a symbol manipulation language for sophisticated users, and it is an improper extension of Lisp 1.5 (in the same sense that Pascal is an improper extension of Algol). Elements from Lisp thus are basic to the ...
  • The Relative Merits of Two Organisational Behaviour Models for Structuring a Management Information System 
    Pirow, Peter (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    The basic 'model' usually applied to the structure of MIS is that of Anthony. This paper investigates the use of the Paterson model as an alternative. This is approached from the theoretical standpoint, and reference is ...
  • A CSP Description of some Parallel Sorting Algorithms 
    Linck, M. H. (Linck, M.H. (1982) A CSP Description of some Parallel Sorting Algorithms,. Computer Society of South Africa (on behalf of SAICSIT), 1982)
    Hoare's CSP notation is used to describe 3 parallel sorting algorithms. The first algorithm uses n/2 processes working in parallel, the second uses an array of n parallel processes and the third algorithm is a parallel ...
  • The Design and Microprogrammed Implementation of a Structured Language Machine 
    Finnie, G.R. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    A computer architecture is described which is suitable for the execution of structured languages (such as Pascal or Algol) at the intermediate language level. The design is heavily stack oriented and consists basically ...
  • An Efficient Implementation of an Algorithm for Min-Max Tree Partitioning 
    Becker, Ronald I; Perl, Yehoshua; Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    An implementation of an algorithm for finding a min-max partition of a weighted tree T with n vertices into q subtrees by means of k = q-1 cuts is presented. The implementation is shown to have asymptotic complexity ...
  • Towards a framework to address governance requirements of IT projects in the South African banking industry 
    Anup, Charlene (2016-11)
    Project success is vitally important for companies to execute and achieve their strate-gies, as well as carry out their visions. Today, more than ever before, companies oper-ate under tremendous strain to deliver results ...
  • The Memory Organization of Future Large Processors 
    Stein, David M. (Computer Society of South Africa (on behalf of SAICSIT), 1980)
    In this paper some specifics and some generalities on the subject of memory organization for future large processors are discussed. We briefly review the current hierarchy and discuss technological and economic changes ...
  • Thirty Years of Information Engines 
    Scarrott, G.G. (Computer Society of South Africa (on behalf of SAICSIT), 1980)
    The era ofinformation engineering was initiated some thirty years' ago by the demonstration of the first stored program electronic computer. At that time there was intense innovative excitement among the pioneers which, ...
  • High-level Programming Language for Interactive Lisp-like Languages 
    Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1980)
    The language LISP 1.5 is neither easy to write nor to read. In the McCarthy etal. definitive manual on LISP 1.5 a higher level language, MLISP, is used From the early 1960's various people have proposed higher level ...
  • Design Principles of the Language BPL 
    Williams, M.H. (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    BASIC and Pascal are two rather different programming languages, both of which have proved to be very popular. A new language BPL has been designed as an interactive programming language based on these two languages, ...
  • The Management of Operating System State Data 
    Turton, Trevor (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    A new approach is proposed for the management of operating system state data. Relational database concepts are suggested for the analysis and organization of this data, and a common central service routine is described ...
  • An Algorithm for Merging Disk Files in Place 
    Roets, P. P. (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    An algorithm is presented for sorting a random access file in place. The algorithm is unique in the sense that no auxiliary storage, apart from a number of buffers in the machine's high-speed memory, is required. In ...
  • Die Toepaslikheid van 'n Analitiese Model by die Keuse van 'n Leerstruktuur vir 'n Teksverwerkingstelsel 
    Penzhorn, A. (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    Die keuse van 'n geskikte leerorganisasie vir 'n rekenaarstelsel is nie altyd eenvoudig en voor die hand liggend nie. In die geval onder bespreking moet 'n geskikte leerorganisasie gekies word vir 'n teksverwerkingstelsel ...
  • Database Design: Choice of a Methodology 
    King, M. C. F.; Naude, G.; von Solms, S. H. (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    Aspects are discussed of the pract.Ical applicat.Ion of recent relatlonal theory The relevant defirut.Ions, extracted from vanous papers, have been restated usmg a common notat.Ion An attempt is made to descnbe unambiguously ...

Search UnisaIR


Browse

My Account