- 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.
Search results
Showing 1 to 10 of 87 (0.066 seconds)| 1 |
Type laundering as a software design pattern for creating hardware abstraction layers in C++McCollum, Cliff Michael. 10 April 2008 (has links)
No description available.
|
| 2 |
Development of a C-based simulation toolkit supporting discrete, continuous, and combined simulation /Khan, Fazal U., January 1991 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1991. / Vita. Abstract. Includes bibliographical references (leaves 101-103). Also available via the Internet.
|
| 3 |
CHIMP the C/C++ hybrid imperative meta-programmer /Kenyon, John L. January 2008 (has links)
Thesis (M.S.)--University of Nevada, Reno, 2008. / "May, 2008"--Prelim. Includes bibliographical references (leaves 60-61). Online version available on the World Wide Web.
|
| 4 |
HPSIMC: AHPL SIMULATOR IMPLEMENTED IN C LANGUAGE (PARSER, SOFTWARE)Yu, Henry, 1961- January 1986 (has links)
No description available.
|
| 5 |
Distributed C++ : design and implementation /Mansey, Pradeep P. January 1989 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1989. / Includes bibliographical references (leaves 50-55).
|
| 6 |
Investigation of a C++ refactoring tool /Brubaker, Ryan. January 2008 (has links)
Thesis (M.S.E.)--University of Wisconsin -- La Crosse, 2008. / Includes bibliographical references (p. 43).
|
| 7 |
A C++ class library capable of handling matrix, polynomial, transfer function, state space, and frequency response data typesThomas, Edward John. January 1995 (has links)
Thesis (M.S.)--Ohio University, March, 1995. / Title from PDF t.p.
|
| 8 |
E a persistent systems implementation language /Richardson, Joel E. January 1989 (has links)
Thesis (Ph. D.)--University of Wisconsin-Madison, 1989. / Cover title. "August 1989." Includes bibliographical references.
|
| 9 |
Grobner bases with symbolic C++.Kruger, Pieter Jozef 02 June 2008 (has links)
Steeb, W.H., Prof.
|
| 10 |
Formal memory models for verifying C systems codeTuch, 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.
|
Page generated in 0.0696 seconds