Zaloguj się

Gotowe bibliografie tematyczne / Computer programs / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Computer programs.

Rozprawy doktorskie na temat „Computer programs”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Computer programs”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Liang, Donglin. "Developing practical program analyses for programs with pointers." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/8203.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Bhullar, Amarjit Singh. "Program understanding tool for MODSIM programs (PUMP)." Thesis, University of Ottawa (Canada), 2001. http://hdl.handle.net/10393/9332.

Pełny tekst źródła

Streszczenie:

The focus of software engineering has traditionally been oriented toward new software construction inspite of the fact that very substantial costs arise in the maintenance phase of the software lifecycle. A key element in the maintenance phase is "program understanding" because the individuals assigned this task are typically distinct from those on the development team. Tools to assist with program understanding have, nevertheless, received only modest attention in recent years. In this thesis the topic is explored within the context of the development of a particular program understanding too

Style APA, Harvard, Vancouver, ISO itp.

3

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.

Pełny tekst źródła

Streszczenie:

Thesis (M.S.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains v, 80 p. : ill. Includes abstract. Includes bibliographical references (p. 33-35).

Style APA, Harvard, Vancouver, ISO itp.

4

Murrill, Branson Wayne. "Error flow in computer programs." W&M ScholarWorks, 1991. https://scholarworks.wm.edu/etd/1539623805.

Pełny tekst źródła

Streszczenie:

White box program analysis has been applied to program testing for some time, but this analysis is primarily grounded in program syntax, while errors arise from incorrect program semantics. We introduce a semantically-based technique called error flow analysis, which is used to investigate the behavior of a program at the level of data state transitions. Error flow analysis is based on a model of program execution as a composition of functions that each map a prior data state into a subsequent data state. According to the fault/failure model, failure occurs when a fault causes an infection in

Style APA, Harvard, Vancouver, ISO itp.

5

Green, Thomas Alan. "Computer programs supporting instruction in acoustics." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA327082.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Engineering Acoustics) Naval Postgraduate School, December 1996.<br>Thesis advisor(s): Sanders, J. V.; Atchley, A. A. "December 1996." Includes bibliographical references (p. 215). Also Available online.

Style APA, Harvard, Vancouver, ISO itp.

6

Melody, Kevin Andrew. "Computer programs supporting instruction in acoustics." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1998. http://handle.dtic.mil/100.2/ADA343632.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Engineering Acoustics) Naval Postgraduate School, March 1998.<br>Thesis advisor(s): Sanders, James V. "March 1998." Includes bibliographical references (p. 105). Also available online.

Style APA, Harvard, Vancouver, ISO itp.

7

Givan, Robert Lawrence. "Automatically inferring properties of computer programs." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/11051.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.<br>Includes bibliographical references (p. 97-101).<br>by Robert Lawrence Givan, Jr.<br>Ph.D.

Style APA, Harvard, Vancouver, ISO itp.

8

Metz, Gale Lynn. "The units of measure consistency checker for the entity-relationship-attribute requirements model." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9941.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Jones, Philip E. C. "Common subexpression detection in dataflow programs /." Title page, contents and summary only, 1989. http://web4.library.adelaide.edu.au/theses/09SM/09smj78.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Kushman, Nate. "Generating computer programs from natural language descriptions." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101572.

Pełny tekst źródła

Streszczenie:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 159-169).<br>This thesis addresses the problem of learning to translate natural language into preexisting programming languages supported by widely-deployed computer systems. Generating programs for existing computer systems enables us to take advantage of two important capabilities of these systems: computing the semantic equivalence between programs, and executing the programs to obtain a

Style APA, Harvard, Vancouver, ISO itp.

12

Tibbetts, Tracey D. "Computer generated music : a methodology for computer music composition." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1125059.

Pełny tekst źródła

Streszczenie:

This study will prove the fact that computers provide unprecedented opportunities to create music. Several distinct levels of computer participation can exist in the creative process. The lowest level, involving record-keeping functions, results in programs that serve as compositional aids. The intermediate level incorporates stochastic (literally "random") processes on a limited basis, and represents the midpoint between computer-assisted and computercomposed works. The highest level focuses on the design of algorithms that result in compositions determined in most of their details by stochas

Style APA, Harvard, Vancouver, ISO itp.

13

Mareček, Jakub. "Exploiting structure in integer programs." Thesis, University of Nottingham, 2012. http://eprints.nottingham.ac.uk/49276/.

Pełny tekst źródła

Streszczenie:

The thesis argues the case for exploiting certain structures in integer linear programs. Integer linear programs are optimisation problems, where one minimises or maximises a linear function of variables, whose values are required to be integral as well as satisfying certain linear equalities and inequalities. For such an abstract problem, there are very good general-purpose solvers. The state of the art in such solvers is an approach known as “branch and bound”. The performance of such solvers depends crucially on four types of in-built heuristics: primal, improvement, branching, and cut-sepa

Style APA, Harvard, Vancouver, ISO itp.

14

Vaughan-Taylor, Keir. "Geodesy : a geodetic database system." Thesis, The University of Sydney, 1990. https://hdl.handle.net/2123/26339.

Pełny tekst źródła

Streszczenie:

Geodesy is a geodetic storage and rendering system designed to retrieve and display textual information, topographic maps and three dimensional underground entities, particularly caves. This paper ﬁrst overviews the methods of data management in relation to the problems and techniques used in adopting cave survey data as a data source for three dimensional images. It then discusses a method used to generate a three dimensional image from the survey data. A display package was developed to show surfaces represented as polygons with hidden surface removal for intersecting surfaces and with sh

Style APA, Harvard, Vancouver, ISO itp.

15

Marlow, Simon David. "Deforestation for higher-order functional programs." Thesis, University of Glasgow, 1995. http://theses.gla.ac.uk/4818/.

Pełny tekst źródła

Streszczenie:

Functional programming languages are an ideal medium for program optimisations based on source-to-source transformation techniques. Referential transparency affords opportunities for a wide range of correctness-preserving transformations leading to potent optimisation strategies. This thesis builds on deforestation, a program transformation technique due to Wadler that removes intermediate data structures from first-order functional programs. Our contribution is to reformulate deforestation for higher-order functional programming languages, and to show that the resulting algorithm terminates g

Style APA, Harvard, Vancouver, ISO itp.

16

Collins, Graham Richard McFarlane. "Supporting formal reasoning about functional programs." Thesis, University of Glasgow, 2001. http://theses.gla.ac.uk/4609/.

Pełny tekst źródła

Streszczenie:

It is often claimed that functional programming languages, and in particular pure functional languages are suitable for formal reasoning. This claim is supported by the fact that many people in the functional programming community do reason about languages and programs in a formal or semi-formal way. Different reasoning principles such as equational reasoning, induction and co-induction, are used, depending on the nature of the problem. Using a computer program to check the application of rules and to mechanise the tedious bookkeeping involved can simplify proofs and provide more confidence in

Style APA, Harvard, Vancouver, ISO itp.

17

Veeder, Nadine M. "An exploratory study of software development measures across COBOL programs." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9977.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Illsley, Martin. "Transforming imperative programs." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/10973.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Chen, Mei 1962. "The characterization of learning environments and program structures of instructional programs produced using Logo /." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=56930.

Pełny tekst źródła

Streszczenie:

A methodology was developed in this study for identifying the cognitive, pedagogical, and computational characteristics of computer-based learning environments. The characterization of the cognitive and pedagogical features was achieved by decomposing the learning environments into episodes which were composed of sequences of "views". Each "view" was described in terms of the different types of knowledge presented, the pedagogical strategies used to present the knowledge, and the forms and functions of user-computer interactions elicited. The computational characteristics were described in ter

Style APA, Harvard, Vancouver, ISO itp.

20

Anderson, Steven Schuyler. "Is there a shortage of computer programmers/systems analysts? an examination of the empirical evidence /." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA240588.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Information Systems)--Naval Postgraduate School, September1990.<br>Thesis Advisor(s): Haga, William J. Second Reader: Mehay, Stephen L. "September 1990." Description based on title screen viewed on December 16, 2009. DTIC Descriptor(s): Computer personnel, shortages, programmers, analysts, systems analysis, theses, computers, specialists. DTIC Identifier(s): Computer programs, systems analysis, specialists, shortages, theses. Author(s) subject terms: Programmer, systems analysis, shortage, shortfall. Includes bibliographical references (p. 29-30). Also available in print.

Style APA, Harvard, Vancouver, ISO itp.

21

Xia, Ying Han. "Establishing trust in encrypted programs." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24761.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009.<br>Committee Chair: Owen, Henry; Committee Co-Chair: Abler, Randal; Committee Member: Copeland, John; Committee Member: Giffin, Jon; Committee Member: Hamblen, Jim.

Style APA, Harvard, Vancouver, ISO itp.

22

Quigley, Claire Louise. "A programming logic for Java bytecode programs." Thesis, University of Glasgow, 2004. http://theses.gla.ac.uk/3030/.

Pełny tekst źródła

Streszczenie:

One significant disadvantage of interpreted bytecode languages, such as Java, is their low execution speed in comparison to compiled languages like C. The mobile nature of bytecode adds to the problem, as many checks are necessary to ensure that downloaded code from untrusted sources is rendered as safe as possible. But there do exist ways of speeding up such systems. One approach is to carry out static type checking at load time, as in the case of the Java Bytecode Verifier. This reduces the number of runtime checks that must be done and also allows certain instructions to be replaced by fast

Style APA, Harvard, Vancouver, ISO itp.

23

Allemang, Dean T. "Understanding programs as devices /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261012487.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Handa, Sunny. "Reverse engineering computer programs under Canadian copyright law." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22693.

Pełny tekst źródła

Streszczenie:

The field of copyright law has been especially active in recent times as a result of its application to computer programs. Copyright law, not originally designed to protect such works, has had to adapt to suit the special nature of computer programs. This paper addresses the applicability of copyright law to the reverse engineering of computer programs. Reverse engineering is a method by which programmers may uncover the ideas and processes used within an existing computer program, thereby allowing the construction of compatible computer programs. Reverse engineering may also be used to create

Style APA, Harvard, Vancouver, ISO itp.

25

MacAllister, Craig M. "Computer graphics adaptation of several aerodynamic prediction programs." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25766.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Murphy, Kieran Gerard. "Parallelization of the atomic R-matrix computer programs." Thesis, Queen's University Belfast, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.333825.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Schroeder, Deborah. "Development of computer programs to aid synthesis planning." Thesis, University of Leeds, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329976.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Tanteri, E. "Analysis of computer programs for modeling casting processes." Thesis, Київський національний університет технологій та дизайну, 2019. https://er.knutd.edu.ua/handle/123456789/14621.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Alshammari, Bandar M. "Quality metrics for assessing security-critical computer programs." Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/49780/1/Bandar_Alshammari_Thesis.pdf.

Pełny tekst źródła

Streszczenie:

Existing secure software development principles tend to focus on coding vulnerabilities, such as buffer or integer overflows, that apply to individual program statements, or issues associated with the run-time environment, such as component isolation. Here we instead consider software security from the perspective of potential information flow through a program’s object-oriented module structure. In particular, we define a set of quantifiable "security metrics" which allow programmers to quickly and easily assess the overall security of a given source code program or object-oriented design. Al

Style APA, Harvard, Vancouver, ISO itp.

30

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Vemuri, Suresh P. "Jedit : a graph editor in Java." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1036185.

Pełny tekst źródła

Streszczenie:

There are increasing demands for graphics-oriented software packages for graph theory teaching and research. G-Net, a departmental research project headed by Dr. Jay Bagga, is an effort to create a software package that comprises of a graph database, a graph editor, 'and a collection of graph algorithms. Also, with widespread use of the World Wide Web, the graph editor should be accessible through the Web. Taking these issues into consideration Jedit (Java Graph editor) is developed. This thesis concentrates on the design and implementation of a graph editor and a graph object (Jgraph). Jgraph

Style APA, Harvard, Vancouver, ISO itp.

32

Florez-Larrahondo, German. "A trusted environment for MPI programs." Master's thesis, Mississippi State : Mississippi State University, 2002. http://library.msstate.edu/etd/show.asp?etd=etd-10172002-103135.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Hackett, James Simpson. "An economic analysis of multiple use forestry using FORPLAN-Version 2." Thesis, University of British Columbia, 1989. http://hdl.handle.net/2429/29033.

Pełny tekst źródła

Streszczenie:

This thesis examines a mathematical programming model called FORPLAN as a planning tool for strategic analysis of forest management alternatives. This model uses economic efficiency as the objective of forest management planning. The dynamic theory of multiple use forestry is analyzed and expressed as a linear programming analogue in FORPLAN. The main weakness of this theory is that it focuses on single stand analysis. Even so, forest wide constraints applied to certain FORPLAN formulations compensate for this weakness. A strata-based forest management problem is developed to show the econ

Style APA, Harvard, Vancouver, ISO itp.

34

Naeem, Nomair A. "Programmer-friendly decompiled Java." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101644.

Pełny tekst źródła

Streszczenie:

Java decompilers convert Java class files to Java source. Common Java decompilers are javac-specific decompilers since they target bytecode produced from a particular javac compiler. We present work carried out on Dava, a tool-independent decompiler that decompiles bytecode produced from any compiler. A known deficiency of tool-independent decompilers is the generation of complicated decompiled Java source which does not resemble the original source as closely as output produced by javac-specific decompilers. This thesis tackles this short-coming, for Dava, by introducing a new back-end consis

Style APA, Harvard, Vancouver, ISO itp.

35

O'Bagy, Janalee. "The implementation of generators and goal-directed evaluation in Icon." Diss., The University of Arizona, 1988. http://hdl.handle.net/10150/184491.

Pełny tekst źródła

Streszczenie:

Generators and goal-directed evaluation provide a rich programming paradigm when combined with traditional control structures in an imperative language. Icon is a language whose goal-directed evaluation is integrated with traditional control structures. This integration provides powerful mechanisms for formulating many complex programming operations in concise and natural ways. However, generators, goal-directed evaluation, and related control structures introduce implementation problems that do not exist for languages with only conventional expression evaluation. This dissertation presents an

Style APA, Harvard, Vancouver, ISO itp.

36

Nikolik, Borislav. "Data Dependence in Programs Involving Indexed Variables." PDXScholar, 1993. https://pdxscholar.library.pdx.edu/open_access_etds/4688.

Pełny tekst źródła

Streszczenie:

Symbolic execution is a powerful technique used to perform various activities such as program testing, formal verification of programs, etc. However, symbolic execution does not deal with indexed variables in an adequate manner. Integration of indexed variables such as arrays into symbolic execution would increase the generality of this technique. We present an original substitution technique that produces array-term-free constraints as a counterargument to the commonly accepted belief that symbolic execution cannot handle arrays. The substitution technique deals with constraints involving arr

Style APA, Harvard, Vancouver, ISO itp.

37

Muqtadir, Abdul. "Real-time finance management system." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/2992.

Pełny tekst źródła

Streszczenie:

Discusses the development of a real-time finance management system (RFMS) computer application. RFMS lets users learn about and manage their personal finances and stock portfolio. Finances can be managed using management tools and calculators. The program uses a Java/XML based approach where real-time market data from different stock exchanges is fetched and displayed for the user. Stock performance can then be graphed.

Style APA, Harvard, Vancouver, ISO itp.

38

Kong, Yow Wai. "Computer aided design of composite beams." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63364.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Wendt, N. Rodney. "Applications of program understanding and rule-based quality assurance to Slam II simulation programs." Thesis, University of Ottawa (Canada), 1993. http://hdl.handle.net/10393/6893.

Pełny tekst źródła

Streszczenie:

With the advance of time, our inventory of simulation programs has and continues to accumulate. To maximize the return on our investment of time and money into these software systems, it is advantageous for us to reuse software components as much as possible. For example, previously engineered simulation models can often be reused and exercised under a new set of experimental conditions. Before a software component can be reused, the analyst must learn and understand its functionality. This learning process is often made unnecessarily difficult due to incomplete documentation. Another contribu

Style APA, Harvard, Vancouver, ISO itp.

40

Keating, Marla Jo Matlick. "Computers in college art and design programs /." Online version of thesis, 1992. http://hdl.handle.net/1850/11630.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Challa, Varshi. "Accessing timesheets via internet through ASP and ODBC." CSUSB ScholarWorks, 2000. https://scholarworks.lib.csusb.edu/etd-project/1605.

Pełny tekst źródła

Streszczenie:

The purpose of this project is to develop a computerized timesheet application. Using this application, an employee of a company can log onto the company's Web site and fill out a timesheet from anywhere in the world. The project involved automating timesheet data entry and approval procedures using contemporary technologies like Active Server Pages (ASP), JavaScript, VB Script, Component Object Model (COM), Components and Open Database connectivity (ODBC).

Style APA, Harvard, Vancouver, ISO itp.

42

Deighan, John. "VPI PROLOG compiler project report." Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-01262010-020109/.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Ellis, Jason Benjamin. "Palaver tree online : technological support for classroom integration of Oral History." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/9189.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Tang, Dezheng. "Mapping Programs to Parallel Architectures in the Real World." PDXScholar, 1992. https://pdxscholar.library.pdx.edu/open_access_etds/4534.

Pełny tekst źródła

Streszczenie:

Mapping an application program to a parallel architecture can be described as a multidimensional optimization problem. To simplify the problem, we divide the overall mapping process into three sequential substeps: partitioning, allocating, and scheduling, with each step using a few details of the program and architecture description. Due to the difficulty in accurately describing the program and architecture and the fact that each substep uses incomplete information, inaccuracy is pervasive in the real-world mapping process. We hypothesize that the inaccuracy and the use of suboptimal, heurist

Style APA, Harvard, Vancouver, ISO itp.

45

Bartenstein, Thomas W. "Rate Types for Stream Programs." Thesis, State University of New York at Binghamton, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10643063.

Pełny tekst źródła

Streszczenie:

<p> RATE TYPES is a novel type system to reason about and optimize data-intensive programs. Built around stream languages, RATE TYPES performs static quantitative reasoning about <i>stream rates</i>—the frequency of data items in a stream being consumed, processed, and produced. Despite the fact that streams are fundamentally dynamic, there are two essential concepts of stream rate control—<i>throughput ratio</i> and <i>natural rate</i>—which are intimately related to the program structure itself and can be effectively reasoned about by a type system. RATE TYPES is proven to

Style APA, Harvard, Vancouver, ISO itp.

46

Lapointe, Stéphane. "Induction of recursive logic programs." Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7467.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Wassell, Mark P. "Semantic optimisation in datalog programs." Master's thesis, University of Cape Town, 1990. http://hdl.handle.net/11427/13556.

Pełny tekst źródła

Streszczenie:

Bibliography: leaves 138-142.<br>Datalog is the fusion of Prolog and Database technologies aimed at producing an efficient, logic-based, declarative language for databases. This fusion takes the best of logic programming for the syntax of Datalog, and the best of database systems for the operational part of Datalog. As is the case with all declarative languages, optimisation is necessary to improve the efficiency of programs. Semantic optimisation uses meta-knowledge describing the data in the database to optimise queries and rules, aiming to reduce the resources required to answer queries. In

Style APA, Harvard, Vancouver, ISO itp.

48

Lloyd, William Samuel. "Causal reasoning about distributed programs." W&M ScholarWorks, 1991. https://scholarworks.wm.edu/etd/1539623806.

Pełny tekst źródła

Streszczenie:

We present an integrated approach to the specification, verification and testing of distributed programs. We show how "global" properties defined by transition axiom specifications can be interpreted as definitions of causal relationships between process states. We explain why reasoning about causal rather than global relationships yields a clearer picture of distributed processing.;We present a proof system for showing the partial correctness of CSP programs that places strict restrictions on assertions. It admits no global assertions. A process annotation may reference only local state. Glue

Style APA, Harvard, Vancouver, ISO itp.

49

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Wendelborn, Andrew Lawrence. "Data flow implementations of a lucid-like programming language." Title page, contents and summary only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phw471.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!