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

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.

Thesis (Ph.D.)--University of Melbourne, Dept. of Computer Science and Software Engineering, 2007. / Typescript. Includes bibliographical references (leaves 253-264).

Thesis (M.App.Sc.)--University of Adelaide, Dept. of Computer Science, 1998? / Bibliography: leaves 173-184.

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).

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.

Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2009/06/25). Includes bibliographical references.

Thesis (M.S.)--Rochester Institute of Technology, 1994. / Typescript. Includes bibliographical references (leaf 217).

Thesis (M.S.)--Rochester Institute of Technology, 1995. / Typescript. Includes bibliographical references (leaves 186-187).

Thesis (M.S.)--Pace University, 2006. / Includes bibliographical references.