• Colloquium at Windy Brow : celebration photo 

  Gruner, Stefan; Pieterse, Vreda; Cleophas, Loek G.W.A.; Liang, Lorraine (2009-03-11)
• Web-based development : putting practice into theory 

  Vosloo, Iwan (2009-03-11)
• Verifying the uniform candy distribution puzzle with CSP Prover 

  Isobe, Yoshinao; Roggenbach, Markus (2009-03-11)
• The values of the myths of postgraduate studies in Computer Science 

  Olivier, Martin S. (2009-03-11)
• The lazy programmer 

  Bishop, Judith (2009-03-11)
• The ethical researcher 

  Roode, Dewald (2009-03-09)
• Software Engineering Professionalism 

  Theunissen, William Herman Morkel (2009-03-09)

  The state of contemporary software and the practice of its development continue to raise the need for evaluating the concept of professionalism in software development. This paper investigates the definition and the concept ...
• Random Generation of Unary Finite Automata over the Domain of the Regular Languages 

  Van Zijl, Lynette; Raitt, Lesley (2009-03-09)

  We show that the standard methods for the random generation of finite automata are inadequate if considered over the domain of the regular languages, for small n. We then present a consolidated, practical method for the ...
• Software and inventive ideation 

  Ross, Marlene (2009-03-09)

  A plethora of creative thinking techniques and invention heuristics exist to guide problem solvers towards innovative solutions. One of the problems that one is faced with is the selection of the appropriate technique for ...
• Querying large C and C++ code bases: the open approach 

  Telea, Alexandru; Byelas, Heorhiy (2009-03-09)

  Static code analysis offers a number of tools for the assessment of complexity, maintainability, modularity and safety of industrysize source code bases. Most analysis scenarios include two main phases. First, the code ...
• Musings about text redundancy and text compression 

  Gruner, Stefan (2009-03-09)

  I muse about some “stringological” questions: Is it possible to encode and compress any given string in such a way that all redundancy is removed? And, if this not possible: How closely could we approximate the ideal aim? ...
• Modelling your domain using ontologies 

  Meyer, Thomas (2009-03-09)

  This paper provides a brief overview of the use of ontologies in Computer Science and argues that one of the main reasons for its popularity in recent years is that it has become possible, in practice, to perform a variety ...
• Mobile spectrum auctions 

  Lalioti, Vali (2009-03-09)
• Improving architectural design decisions 

  Boake, Andrew B. (2009-03-09)

  The value of architecture in a corporate information technology environment lies in guidance on technology choice and system design. Underlying this is the ability of the architecture team to research the relevant architectural ...
• Implementation of deterministic finite automata on parallel computers 

  Holub, Jan; Stekr, Stanislav (2009-03-09)
• Deriving the Boyer-Moore-Horspool algorithm 

  Cleophas, L.G.W.A. (Loek) (2009-03-04)
• Reflections on coding standards in tertiary Computer Science education 

  Kourie, Derrick G.; Pieterse, Vreda (2009-03-04)
• An assertion-guided derivation of a circle drawing algorithm 

  Kourie, Derrick G.; Watson, Bruce William (2009-03-04)
• A Computing medley on program verification, specification, and automated reasoning 

  Van der Poll, John A. (2009-02-26)
• A burden of wonder 

  Strauss, Tinus (2009-02-26)

View more