Relevant bibliographies by topics / DYNAMO (Computer program language) / Dissertations / Theses
To see the other types of publications on this topic, follow the link: DYNAMO (Computer program language).

Dissertations / Theses on the topic 'DYNAMO (Computer program language)'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'DYNAMO (Computer program language).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

McMahon, James S. "DYNAMO systems model of the roll-response of semisubmersibles." Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-01262010-020130/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rushton, Matthew V. "Static and dynamic type systems." Diss., Connect to the thesis Connect to the thesis, 2004. http://hdl.handle.net/10066/1483.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Deitz, Steven J. "High-level programming language abstractions for advanced and dynamic parallel computations /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6967.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Beyer, Eric W. "Design, testing, and performance of a hybrid micro vehicle - the Hopping Rotochute." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29661.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cain, Andrew Angus, and n/a. "Dynamic data flow analysis for object oriented programs." Swinburne University of Technology, 2005. http://adt.lib.swin.edu.au./public/adt-VSWT20060904.161506.

Full text
Abstract:
There are many tools and techniques to help developers debug and test their programs. Dynamic data flow analysis is such a technique. Existing approaches for performing dynamic data flow analysis for object oriented programs have tended to be data focused and procedural in nature. An approach to dynamic data flow analysis that used object oriented principals would provide a more natural solution to analysing object oriented programs. Dynamic data flow analysis approaches consist of two primary aspects; a model of the data flow information, and a method for collecting action information from a running program. The model for data flow analysis presented in this thesis uses a meta-level object oriented approach. To illustrate the application of this meta-level model, a model for the Java programming language is presented. This provides an instantiation of the meta-level model provided. Finally, several methods are presented for collecting action information from Java programs. The meta-level model contains elements to represent both data items and scoping components (i.e. methods, blocks, objects, and classes). At runtime the model is used to create a representation of the executing program that is used to perform dynamic data flow analysis. The structure of the model is created in such a way that locating the appropriate meta-level entity follows the scoping rules of the language. In this way actions that are reported to the meta-model are routed through the model to their corresponding meta-level elements. The Java model presented contains classes that can be used to create the runtime representation of the program under analysis. Events from the program under analysis are then used to update the model. Using this information developers are able to locate where data items are incorrectly used within their programs. Methods for collecting action information from Java programs include source code instrumentation, as used in earlier approaches, and approaches that use Java byte code transformation, and the facilities of the Java Platform Debugger Architecture. While these approaches aimed to achieve a comprehensive analysis, there are several issues that could not be resolved using the approaches covered. Of the approaches presented byte code transformation is the most practical.
APA, Harvard, Vancouver, ISO, and other styles
6

Gordon, Donald James. "Encapsulation enforcement with dynamic ownership : a thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Master of Science in Computer Science /." ResearchArchive@Victoria e-Thesis, 2008. http://hdl.handle.net/10063/624.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Kun. "Dynamic pointer tracking and its applications." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33936.

Full text
Abstract:
Due to the significant limitations of static analysis and the dynamic nature of pointers in weakly typed programming languages like C and C++, the points-to sets obtained at compile time are quite conservative. Most static pointer analysis methods trade the precision for the analysis speed. The methods that perform the analysis in a reasonable amount of time are often context and/or flow insensitive. Other methods that are context, flow, and field sensitive have to perform the whole program inter-procedural analysis, and do not scale with respect to the program size. A large class of problems involving optimizations such as instruction prefetching, control and data speculation, redundant load/store instructions removal, instruction scheduling, and memory disambiguation suffer due to the imprecise and conservative points-to sets computed statically. One could possibly live without optimizations, but in domains involving memory security and safety, lack of the precise points-to sets can jeopardize the security and safety. In particular, the lack of dynamic points-to sets drastically reduce the ability to reason about a program's memory access behavior, and thus illegal memory accesses can go unchecked leading to bugs as well as security holes. On the other hand, the points-to sets can be very useful for other domains such as the heap shape analysis and garbage collection. The knowledge of precise points-to sets is therefore becoming very important, but has received little attention so far beyond a few studies, which have shown that the pointers exhibit very interesting behaviors during execution. How to track such behaviors dynamically and benefit from them is the topic covered by this research. In this work, we propose a technique to compute the precise points-to sets through dynamic pointer tracking. First, the compiler performs the pointer analysis to obtain the static points-to sets. Then, the compiler analyzes the program, and inserts the necessary instructions to refine the points-to sets. At runtime, the inserted instructions automatically update the points-to sets. Dynamic pointer tracking in software can be expensive and can be a barrier to the practicality of such methods. Several optimizations including removal of redundant update, post-loop update, special pattern driven update removal, pointer initialization update removal, update propagation, invariant removal, and on demand update optimization are proposed. Our experimental results demonstrate that our mechanism is able to compute the points-to sets dynamically with tolerable overheads. Finally, the memory protection and garbage collection work are presented as the consumers of dynamic pointer tracking to illustrate its importance. In particular, it is shown how different memory properties can be easily tracked using the dynamic points-to sets opening newer possibilities.
APA, Harvard, Vancouver, ISO, and other styles
8

Spoon, Steven Alexander. "Demand-Driven Type Inference with Subgoal Pruning." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7486.

Full text
Abstract:
Highly dynamic languages like Smalltalk do not have much static type information immediately available before the program runs. Static types can still be inferred by analysis tools, but historically, such analysis is only effective on smaller programs of at most a few tens of thousands of lines of code. This dissertation presents a new type inference algorithm, DDP, that is effective on larger programs with hundreds of thousands of lines of code. The approach of the algorithm borrows from the field of knowledge-based systems: it is a demand-driven algorithm that sometimes prunes subgoals. The algorithm is formally described, proven correct, and implemented. Experimental results show that the inferred types are usefully precise. A complete program understanding application, Chuck, has been developed that uses DDP type inferences. This work contributes the DDP algorithm itself, the most thorough semantics of Smalltalk to date, a new general approach for analysis algorithms, and experimental analysis of DDP including determination of useful parameter settings. It also contributes an implementation of DDP, a general analysis framework for Smalltalk, and a complete end-user application that uses DDP.
APA, Harvard, Vancouver, ISO, and other styles
9

Gupta, Pankaj. "The Design and Implementation of a Prolog Parser Using Javacc." Thesis, University of North Texas, 2002. https://digital.library.unt.edu/ark:/67531/metadc3251/.

Full text
Abstract:
Operatorless Prolog text is LL(1) in nature and any standard LL parser generator tool can be used to parse it. However, the Prolog text that conforms to the ISO Prolog standard allows the definition of dynamic operators. Since Prolog operators can be defined at run-time, operator symbols are not present in the grammar rules of the language. Unless the parser generator allows for some flexibility in the specification of the grammar rules, it is very difficult to generate a parser for such text. In this thesis we discuss the existing parsing methods and their modified versions to parse languages with dynamic operator capabilities. Implementation details of a parser using Javacc as a parser generator tool to parse standard Prolog text is provided. The output of the parser is an “Abstract Syntax Tree” that reflects the correct precedence and associativity rules among the various operators (static and dynamic) of the language. Empirical results are provided that show that a Prolog parser that is generated by the parser generator like Javacc is comparable in efficiency to a hand-coded parser.
APA, Harvard, Vancouver, ISO, and other styles
10

Vaswani, Kapil. "An Adaptive Recompilation Framework For Rotor And Architectural Support For Online Program Instrumentation." Thesis, Indian Institute of Science, 2003. http://hdl.handle.net/2005/174.

Full text
Abstract:
Microsoft Research
Although runtime systems and the dynamic compilation model have revolutionized the process of application development and deployment, the associated performance overheads continue to be a cause for concern and much research. In the first part of this thesis, we describe the design and implementation of an adaptive recompilation framework for Rotor, a shared source implementation of the Common Language Infrastructure (CLI) that can increase program performance through intelligent recompilation decisions and optimizations based on the program's past behavior. Our extensions to Rotor include a low overhead runtime-stack based sampling profiler that identifies program hotspots. A recompilation controller oversees the recompilation process and generates recompilation requests. At the first-level of a multi-level optimizing compiler, code in the intermediate language is converted to an internal intermediate representation and optimized using a set of simple transformations. The compiler uses a fast yet effective linear scan algorithm for register allocation. Hot methods can be instrumented in order to collect basic-block, edge and call-graph profile information. Profile-guided optimizations driven by online profile information are used to further optimize heavily executed methods at the second level of recompilation. An evaluation of the framework using a set of test programs shows that performance can improve by a maximum of 42.3% and by 9% on average. Our results also show that the overheads of collecting accurate profile information through instrumentation to an extent outweigh the benefits of profile-guided optimizations in our implementation, suggesting the need for implementing techniques that can reduce such overheads. A flexible and extensible framework design implies that additional profiling and optimization techniques can be easily incorporated to further improve performance. As previously stated, fine-grained and accurate profile information must be available at low cost for advanced profile-guided optimizations to be effective in online environments. In this second part of this thesis, we propose a generic framework that makes it possible for instrumentation based profilers to collect profile data efficiently, a task that has traditionally been associated with high overheads. The essence of the scheme is to make the underlying hardware aware of instrumentation using a special set of profile instructions and tuned microarchitecture. This not only allows the hardware to provide the runtime with mechanisms to control the profiling activity, but also makes it possible for the hardware itself to optimize the process of profiling in a manner transparent to the runtime. We propose selective instruction dispatch as one possible controlling mechanism that can be used by the runtime to manage the execution of profile instructions and keep profiling overheads under check. We propose profile flag prediction, a hardware optimization that complements the selective dispatch mechanism by not fetching profile instructions when the runtime has turned profiling off. The framework is light-weight and flexible. It eliminates the need for expensive book-keeping, recompilation or code duplication. Our simulations with benchmarks from the SPEC CPU2000 suite show that overheads for call-graph and basic block profiling can be reduced by 72.7% and 52.4% respectively with a negligible loss in accuracy.
APA, Harvard, Vancouver, ISO, and other styles
11

Stratton, David. "A program visualisation meta language." Thesis, University of Ballarat, 2003. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/63588.

Full text
Abstract:
The principle motivation of this work is to define an open PV architecture that will enable a variety of visualisation schemes to interoperate and that will encourage the generation of PV systems and research into their efficacy. Ultimately this may lead to more effective pedagogy in the field of computer programming and hence remove a barrier to students entering the profession.
Doctorate of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
12

Shepherd, David. "Natural language program analysis combining natural language processing with program analysis to improve software maintenance tools /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 176 p, 2007. http://proquest.umi.com/pqdweb?did=1397920371&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Chou, Robert Shih-pei. "A program design language for COBOL." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/13200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Fan, Yang, Hidehiko Masuhara, Tomoyuki Aotani, Flemming Nielson, and Hanne Riis Nielson. "AspectKE*: Security aspects with program analysis for distributed systems." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4136/.

Full text
Abstract:
Enforcing security policies to distributed systems is difficult, in particular, when a system contains untrusted components. We designed AspectKE*, a distributed AOP language based on a tuple space, to tackle this issue. In AspectKE*, aspects can enforce access control policies that depend on future behavior of running processes. One of the key language features is the predicates and functions that extract results of static program analysis, which are useful for defining security aspects that have to know about future behavior of a program. AspectKE* also provides a novel variable binding mechanism for pointcuts, so that pointcuts can uniformly specify join points based on both static and dynamic information about the program. Our implementation strategy performs fundamental static analysis at load-time, so as to retain runtime overheads minimal. We implemented a compiler for AspectKE*, and demonstrate usefulness of AspectKE* through a security aspect for a distributed chat system.
APA, Harvard, Vancouver, ISO, and other styles
15

Richardson, Joel E. "E a persistent systems implementation language /." Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept, 1989. http://catalog.hathitrust.org/api/volumes/oclc/20839601.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Gordon, Christopher Todd. "A visual language for ADA program unit specifications." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06232009-063007/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Yessenov, Kuat T. "A lightweight specification language for bounded program verification." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53184.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
This thesis presents a new light-weight specification language called JForge Specification Language (JFSL) for object-oriented languages such as Java. The language is amenable to bounded verification analysis by a tool called JForge that interprets JFSL specifications, fully integrates with a mainstream development environment, and assists programmers in examining counter example traces and debugging specifications. JFSL attempts to address challenges of specification languages such as inheritance, frame conditions, dynamic dispatch, and method calls inside specifications in the context of bounded verification. A collection of verification tasks illustrates the expressiveness and conciseness of JForge specifications and demonstrates effectiveness of the bounded verification technique.
by Kuat T. Yessenov.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
19

Leoutsarakos, Nikolaos. "A context sensitive command language /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63274.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Gibson, Barbara Brunner. "Ada as a design specification language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10215.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Ouren, Leslie Serine. "Integrating computer software within the Houghton Mifflin Language Arts program." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2918.

Full text
Abstract:
This project was created for third grade teachers who use the Houghton Mifflin Language Arts series and want to integrate computer software into their writing curriculum. The website created includes all the writing assignments that the students are to complete and the required software used to complete the assignment.
APA, Harvard, Vancouver, ISO, and other styles
22

Koh, Kyu Han Seals Cheryl D. "PineHill a novel approach to computer aided language learning /." Auburn, Ala., 2007. http://hdl.handle.net/10415/1365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Trachsel, Anne Roberta. "L-EQUEL : an embedded query language for Franz LISP." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9884.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Yildiz, Faruk. "Implementation of a human avatar for the MARG project in networked virtual environments." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FYildiz.pdf.

Full text
Abstract:
Thesis (M.S. in Modeling, Virtual Environments and Simulation (MOVES))--Naval Postgraduate School, March 2004.
Thesis advisor(s): Xiaoping Yun. Includes bibliographical references (p. 61-62). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
25

Calnan, Paul W. "EXTRACT, Extensible Transformation and Compiler Technology." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0429103-152947.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Pimentel, Richard. "Direct Simulation from a Model Specification Language." DigitalCommons@USU, 1986. https://digitalcommons.usu.edu/etd/6985.

Full text
Abstract:
The purpose of this thesis was to develop a program that would accept, as input, a finite set of algebraic equations and simple if-then conditional expressions that model a natural system, and then produce a continuous computer simulation with graphics and tabular output. The equations and conditionals can be in any order and key elements can be missing. The program can be used to run existing models or as a development tool to produce immediate prototypic computer simulations through synergistic man-machine interactions. The theoretical aspects of automatic program generation were discussed, as well as the architectural design of the system. The simulation system was used to develop a computer simulation of an exploited Northern Utah pheasant population and the results were compared to the results from an earlier FORTRAN computer simulation of the same model. It was concluded that the simulation system developed for this thesis produces verified computer simulations from mathematical models that are at least as accurate as the corresponding simulation written in FORTRAN. The system was easy to use and should be useful for unsophisticated users. Some "tuning'' of the input was needed to produce a verified simulation and it was concluded that further work was needed here.
APA, Harvard, Vancouver, ISO, and other styles
27

Miller, Ruane. "A study of PostScript as a graphics programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/11483.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Chan, Chi-hown Johnny. "Implementation of computer simulation software in learning low-level computer language : a case study /." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B24700770.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Kenyon, John L. "CHIMP the C/C++ hybrid imperative meta-programmer /." abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453647.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Bull, Tim. "Software maintenance by program transformation in a wide spectrum language." Thesis, Durham University, 1994. http://etheses.dur.ac.uk/5494/.

Full text
Abstract:
This thesis addresses the software maintenance problem of extracting high-level designs from code. The investigated solution is to use a mathematically-based formal program transformation system. The resulting tool, the Maintainer's Assistant, is based on Ward's [177] WSL (wide spectrum language) and method of proving program equivalence. The problems addressed include: how to reverse engineer from code alone (the only reliable source of information about a program [158]), how to express program transformations within the system, what kinds of transformations should be incorporated, how to make the tool simple to use, how to perform abstraction and how to create a tool suitable for use with large programs. Using the Maintainer's Assistant, the program code is automatically translated into WSL and the transformations, although tested for valid applicability by the system, are interactively applied by the user. Notable features include a mathematical simplifier, a large flexible transformation catalogue and, significantly, the use of an extension of WSL, A4etaWSL, for representing the transformations. MetaWSL expands WSL by incorporating a variety of extensions, including: program editing statements, pattern matching and template filling functions, symbolic mathematics and logic functions, statements for moving within the program’s syntax tree and statements for repeating an operation at each node of the tree. Using MetaWSL, 80% of the 601 transformations can be expressed in less than 20 program statements. The Maintainer's Assistant has been used on a wide variety of examples of up to several thousand lines, including commercial software written in IBM 370 assembler. It has been possible to transform initially unstructured programs into a hierarchy of procedures, facilitating subsequent design recovery. These results show that program transformation is a viable method of renovating old (370 assembler) code in a cost elective way, and that MetaWSL provides an effective basis for clearly and concisely expressing the required transformations.
APA, Harvard, Vancouver, ISO, and other styles
31

Nagulakonda, Vikram. "Assertion seeding development of program instrumentation through iterative formal analysis /." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1080.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 1999.
Title from document title page. Document formatted into pages; contains v, 80 p. : ill. Includes abstract. Includes bibliographical references (p. 33-35).
APA, Harvard, Vancouver, ISO, and other styles
32

Mosca, Peter. "A study of Ada and C in concurrent programming." Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1991. http://www.kutztown.edu/library/services/remote_access.asp.

Full text
Abstract:
Thesis (M.S.)--Kutztown University of Pennsylvania, 1991.
Source: Masters Abstracts International, Volume: 45-06, page: 3190. Abstract precedes thesis as [1] preliminary leaf. Typescript. Includes bibliographical references (leaf 54).
APA, Harvard, Vancouver, ISO, and other styles
33

Motwani, Manjula H. "An Occam2 implementation of Prolog /." Online version of thesis, 1994. http://hdl.handle.net/1850/12175.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Tollefson, Bradley A. "The J-shell command language interpreter." Virtual Press, 1985. http://liblink.bsu.edu/uhtbin/catkey/506686.

Full text
Abstract:
A command language interpreter (CLI) translates commands entered by the user into system actions. The shell is a specific type of CLI that was originally designed and used with UNIX operating systems.The author proposes to design and implement a shell-like CLI on top of the VMS operating system. The shell will enhance VMS features by providing an easier to use syntax and by providing features that are not currently available through VMS. These features include piping facilities and the ability to enter and/or reference multiple commands from a single command line. A language reference manual is provided with the J-shell. This manual explains the features and commands of the J-shell.
APA, Harvard, Vancouver, ISO, and other styles
35

Barrett, Kirk. "A program development system using an attribute grammar." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9821.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Yu, Henry 1961. "HPSIMC: AHPL SIMULATOR IMPLEMENTED IN C LANGUAGE (PARSER, SOFTWARE)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/291313.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Wright, Madeleine. "A detailed investigation of interoperability for web services." Thesis, Rhodes University, 2006. http://hdl.handle.net/10962/d1004832.

Full text
Abstract:
The thesis presents a qualitative survey of web services' interoperability, offering a snapshot of development and trends at the end of 2005. It starts by examining the beginnings of web services in earlier distributed computing and middleware technologies, determining the distance from these approaches evident in current web-services architectures. It establishes a working definition of web services, examining the protocols that now seek to define it and the extent to which they contribute to its most crucial feature, interoperability. The thesis then considers the REST approach to web services as being in a class of its own, concluding that this approach to interoperable distributed computing is not only the simplest but also the most interoperable. It looks briefly at interoperability issues raised by technologies in the wider arena of Service Oriented Architecture. The chapter on protocols is complemented by a chapter that validates the qualitative findings by examining web services in practice. These have been implemented by a variety of toolkits and on different platforms. Included in the study is a preliminary examination of JAX-WS, the replacement for JAX-RPC, which is still under development. Although the main language of implementation is Java, the study includes services in C# and PHP and one implementation of a client using a Firefox extension. The study concludes that different forms of web service may co-exist with earlier middleware technologies. While remaining aware that there are still pitfalls that might yet derail the movement towards greater interoperability, the conclusion sounds an optimistic note that recent cooperation between different vendors may yet result in a solution that achieves interoperability through core web-service standards.
APA, Harvard, Vancouver, ISO, and other styles
38

Chow, Kent. "GPLOT : a language for plotting graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Firth, Michael Anthony. "A fold/unfold transformation system for a non-strict language." Thesis, University of York, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Lindstrom, Lowell Richard. "The implementation of a SIMULA compiler on the Kansas State University Perkin-Elmer computers." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9934.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Pope, Bernard James. "A declarative debugger for Haskell /." Connect to thesis, 2006. http://eprints.unimelb.edu.au/archive/00003290.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Parsa, Saeed. "Design and specification of a program specification language for engineering applications." Thesis, University of Salford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Marsh, David William Roff. "Program refinement using a universal law : language specification and prototype tool." Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312873.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Vorvick, Janet. "Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5195.

Full text
Abstract:
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 Godel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Godel parser which enables the parsing of evaluable functions in Godel. As the first part of an extended Godel, the parser produces output similar to the output from the original Godel parser, ensuring that Godel modules are properly handled by the extended-Godel parser. Parser output is structured to simplify, as much as possible, the future task of creating an extended compiler implementing evaluation of functions using narrowing. We describe the structure of the original Godel parser, the objects produced by it, the modifications made for the implementation of the extended Godel and the motivation for those modifications. The ultimate goal of this research is production of a functional component for Godel which evaluates user-defined functions with needed narrowing, a strategy which is sound, complete, and optimal for inductively sequential rewrite systems.
APA, Harvard, Vancouver, ISO, and other styles
45

Barrett, Mark Douglas. "Teaching language arts in third grade with HyperStudio, an interactive computer program." CSUSB ScholarWorks, 1991. https://scholarworks.lib.csusb.edu/etd-project/849.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Coleman, Jesse J. "The design, construction, and implementation of an engineering software command processor and macro compiler /." Online version of thesis, 1995. http://hdl.handle.net/1850/12219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Widjaja, Hendra. "Visor++ : a software visualisation tool for task-parallel object-orientated programs." Title page, abstract and contents only, 1998. http://web4.library.adelaide.edu.au/theses/09AS/09asw639.pdf.

Full text
Abstract:
Bibliography: leaves 173-184. This thesis describes Visor++, a tool for visualising programs written in CC++, a task-parallel, object-orientated language derived from C++. Visor++ provides a framework of visualising task-parallel object-orientated programs in the absence of language support for visualisation, i.e. for programs such as CC++ which are written in languages which are not "visualisation-conscious". The development of techniques using a wide selection of language features are described and the effectiveness testified by experimentation.
APA, Harvard, Vancouver, ISO, and other styles
48

Haugh, J. Steven. "The design of a virtual fact base for Prolog." Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-02022010-020103/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Duffy, Sandra Lee. "PEDIT-- a resident structure editor for PROLOG." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9833.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Librers, Joseph. "A module declaration generator." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9861.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'DYNAMO (Computer program language)' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography