School of Computing

 

Sub-communities within this community

Collections in this community

Recent Submissions

  • Wulf, S. (Computer Society of South Africa (on behalf of SAICSIT), 1983-05-01)
  • Visser, P. (Computer Society of South Africa (on behalf of SAICSIT), 1983-05-01)
    This paper presents a summary of tutorial material on accepted management techniques and philosophies as applied to the development of large software systems, based upon the documentation for such systems.
  • Schach, S. R. (Computer Society of South Africa (on behalf of SAICSIT), 1983-05-01)
    Three levels of traces for data structures (as opposed to simple variables) are defined. A machine-code core dump is essentially a low level trace. A high level trace reflects the high level language in which the data ...
  • van Rooyen, M. H. (Computer Society of South Africa (on behalf of SAICSIT), 1983-05-01)
    SCRAP is 'n hoevlaktaal geskik vir stelsel- sowel as toepassingsprogrammering. Die uitstaanae kenmerke van die taal is 'n aantal goedgedefinieerde sintaktiese konstruksies, 'n modulere struktuur, masjienafhanklike datatipes ...
  • van Neikerk, J. C. (Computer Society of South Africa (on behalf of SAICSIT), 1983-05-01)
    Die operas1onele benadenng tot die ontleding van die enkelbed1enermodel word bespreek Daar word gekyk na Buzen se operas1onele ekw1valent v1r die stogast1ese geboorte/sterfte Markov model, waarna veralgemenings van die ...
  • Calingaert, P.; Popelas, J. M, (Computer Society of South Africa (on behalf of SAICSIT), 1983-05-01)
    The correction of errors in programs can be based on an analysis, that subordinates syntactic relationships to functional relationships among elements of a program. For this purpose, case grammars, originally developed ...
  • Calingaert, P.; Hetzel, B. (Computer Society of South Africa (on behalf of SAICSIT), 1983-05-01)
    A controlled experiment was designed and conducted to compare three methods for detecting errors in computer programs: disciplined, structured reading; specification or black-box testing; and a refined form of typical ...
  • Linck, M. H. (Computer Society of South Africa (on behalf of SAICSIT), 1982-11-01)
    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 ...
  • Pirow, P. (Computer Society of South Africa (on behalf of SAICSIT), 1982-11-01)
    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 ...
  • Postma, S. W. (Computer Society of South Africa (on behalf of SAICSIT), 1982-11-01)
    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 ...
  • Roets, P. P. (Computer Society of South Africa (on behalf of SAICSIT), 1982-11-01)
    An evaluation is made of the improvement of language interpreters by coding recurring sequences of instructions in micro-code. The results of an experiment with PASCAL indicate that the increase in speed expected may not ...
  • Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1982-11-01)
    The use of a high-level language generally masks the essential difference between the programmer's conception of a data structure and its computer implementation. However, in the course of debugging a program written in ...
  • Finnie, G. R. (Computer Society of South Africa (on behalf of SAICSIT), 1982-11-01)
    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 ...
  • Becker, Ronald I; Perl, Yehoshua; Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1982-11-01)
    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 O(k3rd(T) ...
  • Stein, D, M, (Computer Society of South Africa (on behalf of SAICSIT), 1980-03-01)
    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 ...
  • Scarrott, G. G. (Computer Society of South Africa (on behalf of SAICSIT), 1980-03-01)
    The era of information 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, ...
  • Postma, S. W. (Computer Society of South Africa (on behalf of SAICSIT), 1980-03-01)
    The language LISP 1.5 is neither easy to write nor to read. In the McCarthy et al. definitive manual on LISP 1.5 a higher level language, MLISP, is used From the early 1960's various people have proposed higher level ...
  • Williams, M. H. (Computer Society of South Africa (on behalf of SAICSIT), 1979-09-01)
    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, ...
  • Turton, T. (Computer Society of South Africa (on behalf of SAICSIT), 1979-09-01)
    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 ...
  • Roets, P. P. (Computer Society of South Africa (on behalf of SAICSIT), 1979-09-01)
    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 ...

View more