• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 543
  • 135
  • 59
  • 26
  • 26
  • 26
  • 26
  • 26
  • 26
  • 24
  • 8
  • 7
  • 7
  • 7
  • 4
  • Tagged with
  • 1007
  • 1007
  • 787
  • 208
  • 206
  • 188
  • 139
  • 138
  • 116
  • 116
  • 112
  • 109
  • 107
  • 103
  • 88
  • 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.
211

Concurrency and sharing in prolog and in a picture editor for aldat

Gunnlaugsson, Bjorgvin January 1987 (has links)
No description available.
212

Run-time comparison C++ vs. Java

Jones, Linwood D. January 1999 (has links)
C++ is one of the most commonly used programming languages in academic and professional environments. Java is a relatively new language that is rapidly gaining popularity and acceptance. Java's designers claim that Java offers all the functionality of C++ and more. Java's syntax is similar to C++, but Java code is not compatible with C++. Java offers platform independence and better support for internet-oriented applications. Platform independence may come at a price. A major concern regarding any language is performance.This thesis looks at the performance of Java and C++. A comparison is made of C++ and Java runtimes for a simple algorithm (bubblesort). It covers the differences in compilation of an application developed in C++ versus an application developed in Java. It reports the execution time of an algorithm written in both languages. / Department of Computer Science
213

Formal memory models for verifying C systems code

Tuch, Harvey, Computer Science & Engineering, Faculty of Engineering, UNSW January 2008 (has links)
Systems code is almost universally written in the C programming language or a variant. C has a very low level of type and memory abstraction and formal reasoning about C systems code requires a memory model that is able to capture the semantics of C pointers and types. At the same time, proof-based verification demands abstraction, in particular from the aliasing and frame problems. In this thesis, we study the mechanisation of a series of models, from semantic to separation logic, for achieving this abstraction when performing interactive theorem-prover based verification of C systems code in higher- order logic. We do not commit common oversimplifications, but correctly deal with C's model of programming language values and the heap, while developing the ability to reason abstractly and efficiently. We validate our work by demonstrating that the models are applicable to real, security- and safety-critical code by formally verifying the memory allocator of the L4 microkernel. All formalisations and proofs have been developed and machine-checked in the Isabelle/HOL theorem prover.
214

A declarative debugger for Haskell /

Pope, Bernard James. January 2006 (has links)
Thesis (Ph.D.)--University of Melbourne, Dept. of Computer Science and Software Engineering, 2007. / Typescript. Includes bibliographical references (leaves 253-264).
215

Visor++ : a software visualisation tool for task-parallel object-orientated programs /

Widjaja, Hendra. January 1998 (has links) (PDF)
Thesis (M.App.Sc.)--University of Adelaide, Dept. of Computer Science, 1998? / Bibliography: leaves 173-184.
216

PineHill a novel approach to computer aided language learning /

Koh, Kyu Han Seals, Cheryl D. January 2007 (has links)
Thesis--Auburn University, 2007. / Abstract. Includes bibliographic references (p.43-45).
217

A study of Ada and C in concurrent programming

Mosca, Peter. January 1991 (has links)
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).
218

The implementation of ACT++ on a shared memory multiprocessor /

Mukherji, Manibrata. January 1992 (has links)
Project (M.S.)--Virginia Polytechnic Institute and State University. M.S. 1992. / Vita. Abstract. Includes bibliographical references (leaves 202-204). Also available via the Internet.
219

SQL front-end for the JRelix relational-programming system

Khaya, Ibrahima. January 1900 (has links)
Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2009/06/25). Includes bibliographical references.
220

An Occam2 implementation of Prolog /

Motwani, Manjula H. January 1994 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1994. / Typescript. Includes bibliographical references (leaf 217).

Page generated in 0.0596 seconds