Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Evaluable Functions In The GöDel Programming Language: Parsing And Representing Rewrite Rules, Janet Vorvick
Evaluable Functions In The GöDel Programming Language: Parsing And Representing Rewrite Rules, Janet Vorvick
Dissertations and Theses
The integration of a functional component into a logic language extends the expressive power of the language. One logic language which would benefit from such an extension is Gödel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Gödel parser which enables the parsing of evaluable functions in Gödel. As the first part of an extended Gödel, the parser produces output similar to the output from the original Gödel parser, ensuring that Gödel modules are properly handled by the extended-Gödel parser. Parser output is structured to simplify, as much as …
Weakest Pre-Condition And Data Flow Testing, Griffin David Mcclellan
Weakest Pre-Condition And Data Flow Testing, Griffin David Mcclellan
Dissertations and Theses
Current data flow testing criteria cannot be applied to test array elements for two reasons: 1. The criteria are defined in terms of graph theory which is insufficiently expressive to investigate array elements. 2. Identifying input data which test a specified array element is an unsolvable problem. We solve the first problem by redefining the criteria without graph theory. We address the second problem with the invention of the wp_du method, which is based on Dijkstra's weakest pre-condition formalism. This method accomplishes the following: Given a program, a def-use pair and a variable (which can be an array element), the …
The Parser Converter Loader: An Implementation Of The Computational Chemistry Output Language (Ccol), Donald Randall Abel
The Parser Converter Loader: An Implementation Of The Computational Chemistry Output Language (Ccol), Donald Randall Abel
Dissertations and Theses
A necessity of managing scientific data is the ability to maintain experimental legacy information without continually modifying the applications that create and use that information. By facilitating the management of scientific data we hope to give scientists the ability to effectively use additional modeling applications and experimental data. We have demonstrated that an extensible interpreter, using a series of stored directives, allows the loading of data from computational chemistry applications into a generic database. Extending the interpreter to support a new application involves supplying a list of directives for each piece of information to be loaded. This research confirms that …
Psusort: A Parallel External Sort For A Shared Memory Multiprocessor System, Sujata V. Ramamoorthy
Psusort: A Parallel External Sort For A Shared Memory Multiprocessor System, Sujata V. Ramamoorthy
Dissertations and Theses
A method to parallelize external sorts on a shared memory multiprocessing system is presented in this thesis. The main goal of the thesis is to develop a sorting package that is scale able and efficient. No prior knowledge of the nature, source or size of the data is assumed for this work. A dynamic load-balancing architecture is used with no static allocation of tasks to processes. The package consists of an interface and a kernel. The interface provides the sort with the following - the sort input, output and temporary work spaces as abstract data types (ADTs), memory available, number …