• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 283
  • 90
  • 29
  • 11
  • 11
  • 11
  • 11
  • 11
  • 11
  • 4
  • 4
  • 2
  • 2
  • 2
  • 2
  • Tagged with
  • 602
  • 602
  • 146
  • 87
  • 87
  • 71
  • 66
  • 65
  • 63
  • 61
  • 55
  • 52
  • 47
  • 47
  • 44
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Data structures for a fragment based programming environment

Pinsonneault, Luc January 1987 (has links)
No description available.
2

Computer explorations.

Howson, Hugh R. January 1971 (has links)
No description available.
3

A distributed graph reducer for lazy functional languages /

Howson, Christopher January 1992 (has links)
This thesis describes a model for distributed graph reduction implemented on a network of transputers. The model allows variable size communications between processors, by exchanging subgraphs instead of single nodes. Functional languages with lazy semantics have graph nodes representing unevaluated arguments. These nodes require special treatment by the run time system because they must not be copied. By checking the structure of the transmitted subgraphs, it is possible to determine which unevaluated expressions have no external references to them and so may safely be included in the subgraph with no overhead. This allows large subgraphs to be exchanged while reducing the demands on the communications system. This technique raises the possibility of implementations on a wide variety of distributed computers such as networks of workstations, which hitherto has been considered impractical.
4

A partial implementation of the contour model of block structured processes

Laviana, Lyn D January 1974 (has links)
No description available.
5

Program manipulation using a grammar-based meta-programming system

Cameron, Robert Douglas January 1983 (has links)
Program manipulation is defined as the automated or semi-automated tailoring, modification or transformation of software to achieve programs with improved performance or other characteristics or to adapt programs to alternative uses. Program manipulation programs (and other sorts of software tool as well) are characterized as "programs about programs" or meta-programs. It is proposed that the implementation of these meta-programs be aided by a new type of meta-tool, the meta-programming system, which is characterized by its systematic treatment of programs as data objects. In support of the meta-programming system concept, a grammar-based scheme (called GRAMPS) for specifying meta-programming systems is put forward. This scheme is illustrated in its particular application to the programming language Pascal (yielding a specification for the meta-programming system Pascal MPS). The suitability of GRAMPS-based systems for implementing meta-programs is evaluated through theoretical consideration of the properties of GRAMPS systems in general, and an analysis of programming experiments using Pascal MPS in particular. The use of meta-programming systems for program manipulation tasks is analysed with respect to several application areas. Meta-programming systems are compared with various alternatives for the implementation of program transformations. Several types of programming utility are discussed including the use of meta-programs to develop versions of target programs specialized for program analysis. The use of meta-programming systems in the implementation of syntactic editors and integrated program manipulation systems is also considered. The results presented support both the GRAMPS scheme itself and the grammar-based treatment of programs as data objects in general. From a theoretical viewpoint, GRAMPS was found to have four important completeness properties. From an experimental perspective, Pascal MPS was found to be generally convenient and practical for large-scale applications. In each of the application areas considered, the meta-programming system approach compared favorably with available alternatives. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate
6

The role of exception mechanisms in software systems design

Atkins, Margaret Stella January 1985 (has links)
Exception handling is a crucial aspect of practical programming, particularly in systems allowing logical concurrency such as multi-process distributed systems. First, a survey of existing exception handling mechanisms in operating systems is performed, which shows a diversity of implementations, depending on the process model and the method of inter-process communication. The thesis then develops a model for designing software which exploits the different mechanisms for handling normal and exceptional events. The model is applicable in many multi-process programming environments, and not only preserves modularity, but also enhances efficiency and reliability, while often increasing concurrency. To derive such a model, exceptions in multi-process software are classified primarily according to the program level at which they are detected and handled. Server-to-client exceptions are of particular interest because of their ubiquity; these are exceptions detected by a server and handled by a client. The model treats systems programs as event driven, and proposes dividing the events into normal or exceptional, according to the cost and mechanisms for handling them. Techniques are described for designing software according to three criteria: minimising the average run-time, minimising the exception processing time, and incrementally increasing the program's functionality. Many examples are given which illustrate the use of the general model. Program paradigms in several languages and in several systems are introduced to model features which are system dependent, through illustrative examples for asynchronous i/o multiplexing, and for exception notification from a server to its client or clients. Finally, some programs which have been implemented according to the rules of the model are described and compared with their more conventional counterparts. These programs illustrate the practicality and usefulness of the model for diverse systems and concurrent environments. / Science, Faculty of / Computer Science, Department of / Graduate
7

A program development facility

DuMont, Mark Aurele Louis January 1974 (has links)
The implementation of a unified facility for program development and maintenance is described. The prototype (named "Eighty-One") provides for the entry, editing and compilation of program text within a unified system in which source text is immediately transformed into an intermediate tree structured representation for storage. The implications of the unification of these facilities under this representation are discussed from the viewpoints of user convenience and system efficiency. Technical problems posed by the implementation are also discussed. Finally, some comments are made upon the nature of the user interface to systems of this type. / Science, Faculty of / Computer Science, Department of / Graduate
8

Studies related to the process of program development

Williams, Morgan Howard January 1994 (has links)
The submitted work consists of a collection of publications arising from research carried out at Rhodes University (1970-1980) and at Heriot-Watt University (1980-1992). The theme of this research is the process of program development, i.e. the process of creating a computer program to solve some particular problem. The papers presented cover a number of different topics which relate to this process, viz. (a) Programming methodology programming. (b) Properties of programming languages. aspects of structured. (c) Formal specification of programming languages. (d) Compiler techniques. (e) Declarative programming languages. (f) Program development aids. (g) Automatic program generation. (h) Databases. (i) Algorithms and applications.
9

A dataflow diagram generator

Specht, Alicia Ellen January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.
10

Multitasking in a user partition with a contour model of processes

Allen, Lee January 2010 (has links)
Digitized by Kansas Correctional Industries

Page generated in 0.1201 seconds