Dissertations / Theses: 'C (Computer program language)'

1

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

2

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

3

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

4

Jones, Linwood D. "Run-time comparison C++ vs. Java." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1125142.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

5

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

6

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

7

Chan, Robin Isaac Man-Hang. "An Estelle-C compiler for automatic protocol implementation." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26184.

Full text

Abstract:

Over the past few years, much experience has been gained in semi-automatic protocol implementation using an existing Estelle-C compiler developed at the University of British Columbia. However, with the continual evolution of the Estelle language, that compiler is now obsolete. The present study found substantial syntactic and semantic differences between the Estelle language as implemented by the existing compiler and that specified in the latest ISO document to warrant the construction of a new Estelle-C compiler. The result is a new compiler which translates Estelle as defined in the second version of the ISO Draft Proposal 9074 into the programming language C. The new Estelle-C compiler addresses issues such as dynamic reconfiguration of modules and maintenance of priority relationships among nested modules. A run-time environment capable of supporting the new Estelle features is also presented. The implementation strategy used in the new Estelle-C compiler is illustrated by using the alternating bit protocol found in the ISO Draft Proposal 9074 document.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

Shear, Raymond F. "Implementation of a Modula 2 subset compiler supporting a "C" language interface using commonly available UNIX tools /." Online version of thesis, 1989. http://hdl.handle.net/1850/10505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Li, Bin. "An interface between single assignment C and vector pascal." Connect to e-thesis, 2007. http://theses.gla.ac.uk/107/.

Full text

Abstract:

Thesis (Ph.D.) - University of Glasgow, 2007.
Ph.D. thesis submitted to the Department of Computing Science, Faculty of Information and Mathematical Sciences, University of Glasgow, 2007. Includes bibliographical references. Print version also available.

APA, Harvard, Vancouver, ISO, and other styles

11

Yang, Yueli. "ASN.1-C compiler for automatic protocol implementation." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/28359.

Full text

Abstract:

One of the basic requirements of communication protocols in a heterogeneous computer network is a standard external data-transfer representation. Abstract Syntax Notation One (ASN.1) has been widely used in international standard specifications. Its transfer-syntax of Basic Encoding Rules (BER) is applied as the standard external data representation. This thesis presents an efficient BER implementation, called the ED library. The ED library includes a number of encoding and decoding routines that may be used as primitive functions to compose encoders and decoders for arbitrarily complicated ASN.1 data-types. The Performance of the ED library is measured and discussed. Based on the ED library, an ASN.1-C compiler, called CASN1, is designed and implemented to release communication software programmers from the arduous work of translating protocol-defined data-types and constructing their encoders and decoders. Given an ASN.1 protocol specification, CASN1 automatically translates the input ASN.1 modules into C and generates the BER encoders and decoders for the protocol denned data-types. This thesis discusses the design principles, user interface, internal structures, and the implementation and of CASN1. Example applications are given. Both the ED library and CASN1 are implemented in C on UNIX 4.2 BSD using the YACC and LEX tools.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

12

Hammerquist, James D. (James Daniel). "A C Navigational System." Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc500702/.

Full text

Abstract:

The C Navigational System (CNS) is a proposed programming environment for the C programming language. The introduction covers the major influences of programming environments and the components of a programming environment. The system is designed to support the design, coding and maintenance phases of software development. CNS provides multiple views to both the source and documentation for a programming project. User-defined and system-defined links allow the source and documentation to be hierarchically searched. CNS also creates a history list and function interface for each function in a module. The final chapter compares CNS and several other programming environments (Microscope, Rn, Cedar, PECAN, and Marvel).

APA, Harvard, Vancouver, ISO, and other styles

13

Khan, Fazal U. "Development of a C-based simulation toolkit supporting discrete, continuous, and combined simulation." Thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-02132009-170834/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

15

Brubaker, Ryan. "Investigation of a C++ refactoring tool /." Connect to title online, 2008. http://minds.wisconsin.edu/handle/1793/34220.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Akritidis, Periklis. "Practical memory safety for C." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Kuo, Yung-Li. "Developing a rule-based expert system with C programming language." Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/552943.

Full text

Abstract:

Expert system techniques are now being incorporated successfully in commercial computer software packages. This thesis introduces the techniques of developing a rule-based expert system in a general-purpose programming language -- C. The topics of this thesis include significance of expert system shells and approaches used, structure of the knowledge base, loading of the knowledge base, manipulation of the probabilities of rule attributes, and implementation of the inference engine. The inference engine uses the information that users supply to find an object that matches. Today C language is one of the most popular programming languages in use and C compilers consistently produce extremely fast and efficient executable programs. Thisthesisdemonstrates that C language is an appropriate computer language for a rule-based expert system.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

19

Cuddihy, Paul. "Compiling GEN-X knowledge bases into "C" /." Online version of thesis, 1991. http://hdl.handle.net/1850/10792.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Mansey, Pradeep P. "Distributed C++ : design and implementation /." Online version of thesis, 1989. http://hdl.handle.net/1850/10498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Parker, Rembert N. "An introduction to computer programming for complete beginners using HTML, JavaScript, and C#." CardinalScholar 1.0, 2008. http://liblink.bsu.edu/uhtbin/catkey/1465970.

Full text

Abstract:

Low student success rates in introductory computer programming classes result in low student retention rates in computer science programs. For some sections of the course a traditional approach began using C# in the .Net development environment immediately. An experimental course redesign for one section was prepared that began with a study of HTML and JavaScript and focused on having students build web pages for several weeks; after that the experimental course used C# and the .Net development environment, covering all the material that was covered in the traditional sections. Students were more successful in the experimental section, with a higher percentage of the students passing the course and a higher percentage of the students continuing on to take at least one additional computer science course.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

22

Mehldau, Gerhard 1959. "A RULE-BASED PROGRAMMING LANGUAGE AND ITS APPLICATION TO IMAGE RECOGNITION." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/276360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Tuch, Harvey Computer Science &amp Engineering Faculty of Engineering UNSW. "Formal memory models for verifying C systems code." Publisher:University of New South Wales. Computer Science & Engineering, 2008. http://handle.unsw.edu.au/1959.4/41233.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

24

Peachock, Patrick R. "Investigating Eye Movements in Natural Language and C++ Source Code." Youngstown State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1432836692.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Mehta, Hemant. "Computer controlled deep level transient spectroscopy system." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9936.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

27

Kaza, Avinash. "Preparation of acoustic emission data for neural network analysis using AWK and C programs." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://etd.wvu.edu/etd/controller.jsp?moduleName=documentdata&jsp%5FetdId=3896.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 2005.
Title from document title page. Document formatted into pages; contains xiv, 189 p. : ill. (some col.). Vita. Includes abstract. Includes bibliographical references (p. 157-160).

APA, Harvard, Vancouver, ISO, and other styles

28

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

29

Wilson, Jeffrey K. "A C-based simulation framework for automated guided vehicle systems." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-02132009-172242/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Ampadu, Ebenezer. "Implementation of some finite difference methods for the pricing of derivatives using C++ programming." Link to electronic thesis, 2007. http://www.wpi.edu/Pubs/ETD/Available/etd-051807-164436/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Gandhi, Rajiv. "Communication infratructure for a distributed actor system /." This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-03302010-020449/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Cox, David Richard. "RITSim : distributed SystemC simulation /." Link to online version, 2005. https://ritdml.rit.edu/dspace/handle/1850/1014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Gupta, Davender Nath. "Expressing imaging algorithms using a C++ based image algebra programming environment /." Online version of thesis, 1990. http://hdl.handle.net/1850/11370.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Girimaji, Sanjay. "Data-parallel programming with multiple inheritance on the connection machine." FIU Digital Commons, 1990. https://digitalcommons.fiu.edu/etd/3940.

Full text

Abstract:

The demand for computers is oriented toward faster computers and newer computers are being built with more than one CPU. These computers require sophisticated software to program them. One such approach to program the multiple CPU machines is through the use of object-oriented programming techniques. An example of such an approach is the use of C* on the Connection Machine. Though C* supports many of the object-oriented concepts, it does not support the concept of software reuse through inheritance. This thesis introduces a new language called C*±+ , an extension of C* language to support inheritance. We also discuss the issues invloved in the implementation of multiple inheritance in programming languages. This thesis describes the differences between C** and C* . It also discusses the various issues involved in the design and implementation of the translator from C** to C* . It also illustrates the advantages of programming in C*++ through an example. Since C*++ is designed to support software reuse which allows the users to create quality software in shorter time, it is anticipated that C*+ will have widespread use in programming the Connection Machine.

APA, Harvard, Vancouver, ISO, and other styles

35

McNamara, Brian. "Multiparadigm programming novel devices for implementing functional and logic programming constructs in C++ /." Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-07122004-121450/unrestricted/mcnamara%5Fbrian%5Fm%5F200407%5Fphd.pdf.

Full text

Abstract:

Thesis (Ph. D.)--College of Computing, Georgia Institute of Technology, 2005. Directed by Yannis Smaragdakis.
Spencer Rugaber, Committee Member ; Olin Shivers, Committee Member ; Mary Jean Harrold, Committee Member ; Yannis Smaragdakis, Committee Chair ; Philip Wadler, Committee Member. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

36

Bettermann, Stephan. "Implementing a fault-tolerant C-Linda in OS/2." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1998. https://ro.ecu.edu.au/theses/1006.

Full text

Abstract:

The parallel paradigm is accepted by computer scientists as playing a role of increasing importance in their discipline area. To enable operation in the parallel paradigm, Linda may be used to extend existing and well understood programming languages such as C, Eiffel, Prolog, and Lisp. Linda is not a complete programming language in its own right, but rather a coordination language which is injected into a host programming language thereby creating a parallel dialect of that host language. The behaviour of every component, whether hardware or software, may be defined by a service specification. Thus, a failure may be defined as occurring when a component behaves in a manner not consistent with its service specification. The ability of a system to tolerate failures of any of its components is called fault-tolerance. The probability of failure occurring is higher in parallel systems and distributed systems than in single-processor systems due to increased hardware and software complexity. Furthermore, as many computations on such systems are long lived, the ability to tolerate failures is particularly important. Personal Computers represent an abundant computing resource. Connecting multiple Personal Computers via a Local Area Network, a common practice in medium to large scale organisations, results in a computing resource which is typically idle, but which is readily useable in the parallel paradigm. By exploiting this idle resource a fault-tolerant Linda may be implemented. Such a Linda implementation achieves low-cost fault-tolerance by distributing and replicating a tuple space in a ring arrangement over the Local Area Network. This thesis describes the development of a fault-tolerant Linda injected into the ANSI C programming language running on a Local Area Network of Personal Computers, each one running under OS/2. The Local Area Network is accessed using NetBIOS, as provided by OS/2's Communication Manager.

APA, Harvard, Vancouver, ISO, and other styles

37

Lee, Wei. "Bibliographic system for microcomputer environments." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9931.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Sibanda, Phathisile. "Connection management applications for high-speed audio networking." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1006532.

Full text

Abstract:

Traditionally, connection management applications (referred to as patchbays) for high-speed audio networking, are predominantly developed using third-generation languages such as C, C# and C++. Due to the rapid increase in distributed audio/video network usage in the world today, connection management applications that control signal routing over these networks have also evolved in complexity to accommodate more functionality. As the result, high-speed audio networking application developers require a tool that will enable them to develop complex connection management applications easily and within the shortest possible time. In addition, this tool should provide them with the reliability and flexibility required to develop applications controlling signal routing in networks carrying real-time data. High-speed audio networks are used for various purposes that include audio/video production and broadcasting. This investigation evaluates the possibility of using Adobe Flash Professional 8, using ActionScript 2.0, for developing connection management applications. Three patchbays, namely the Broadcast patchbay, the Project studio patchbay, and the Hospitality/Convention Centre patchbay were developed and tested for connection management in three sound installation networks, namely the Broadcast network, the Project studio network, and the Hospitality/Convention Centre network. Findings indicate that complex connection management applications can effectively be implemented using the Adobe Flash IDE and ActionScript 2.0.

APA, Harvard, Vancouver, ISO, and other styles

39

Li, Shen Carmen C. Duren Russell Walker. "Evaluating Impulse C and multiple parallelism partitions for a low-cost reconfigurable computing system." Waco, Tex. : Baylor University, 2008. http://hdl.handle.net/2104/5280.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Xiong, Bo. "A trace-driven simulation study of cache memories." Virtual Press, 1989. http://liblink.bsu.edu/uhtbin/catkey/562779.

Full text

Abstract:

The purpose of this study is to explore the relationship between hit ratio of cache memory and design parameters. Cache memories are widely used in the design of computer system architectures to match relatively slow memories against fast CPUs. Caches hold the active segments of a program which are currently in use. Since instructions and data in cache memories can be referenced much faster than the time required to access main memory, cache memories permit the execution rate of the machine to be substantially increased. In order to function effectively, cache memories must be carefully designed and implemented. In this study, a trace-driven simulation study of direct mapped, associative mapped and set-associative mapped cache memories is made. In the simulation, cache fetch algorithm, placement policy, cache size and various parameters related to cache design and the resulting effect on system performance is investigated. The cache memories are simulated using the C language and the simulation results are analyzed for the design and implementation of cache memories.
Department of Physics and Astronomy

APA, Harvard, Vancouver, ISO, and other styles

41

Sexton, John A. "Detecting errors in software using a parameter checker : an analysis /." Online version of thesis, 1989. http://hdl.handle.net/1850/10585.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Long, Wendy. "CATY : an ASN. 1-C++ translator in support of distributed object-oriented applications /." Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-10242009-020105/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Goeke, James A. "Design of a hardware efficient key generation algorithm with a VHDL implementation /." Online version of thesis, 1993. http://hdl.handle.net/1850/11664.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Hessaraki, Alireza. "CCC86, a generic 8086 C-language cross compiler plus communication package." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/544004.

Full text

Abstract:

The Cross Compiler is an excellent and valuable program development tool. It provides to the user a low level compiled language that allows character (byte), integer (8086 word) and pointer (8086 one word address) manipulation. It also allows recursion, has modern flow and a rich set of operators.The Communication Program which include file transfer utility allows the student to download or upload their C program to a PC. It allows use of the Modem. The file transferring can be done using XON/XOFF or XMODEM. It also supports INS 8250 UART chip, plus 16450 high speed device found in hardware such as IBM AT Serial/Parallel Adapter.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

45

Crunk, Anthony Wayne. "A portable C random number generator." Thesis, Virginia Tech, 1985. http://hdl.handle.net/10919/45720.

Full text

Abstract:

Proliferation of computers with varying word sizes has led to increases in software use where random number generation is required. Several techniques have been developed. Criteria of randomness, portability, period, reproducibility, variety, speed, and storage are used to evaluate developed generation methods. The Tausworthe method is the only method to meet the portability requirement, and is chosen to be implemented. A C language implementation is proposed as a possible implementation and test results are presented to confirm the acceptability of the proposed code.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

46

Myers, Karl J. "A system for the generation of tonal music based on transformations /." Online version of thesis, 1988. http://hdl.handle.net/1850/10293.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Merritt, John W. "Distributed file systems in an authentication system." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Hamilton, Ian J. "A graphic representation scheme and a tool for natural language documentation of C++ programs." Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7721.

Full text

Abstract:

A graphic representation scheme to represent C++ programs is presented as a set of related templates. The templates represent the three types of objects in a C++ program and their inheritance properties. A survey of existing C++ tools is presented followed by a brief introduction to the DoC++ (Documentation for C++) tool. The concepts in the C++ language underlying the DoC++ tool are discussed. The two parts of DoC++ are explained in detail. The Organized Representation for C++ (ORC++) tool provides templates for overviews and detailed views of C++ programs. The Natural language for C++ (NlC++) tool supports ORC++ by providing natural language to complement the ORC++ documentation. The implementation of the DoC++ system is discussed. Conclusions and suggestions for further research are made. Examples of the DoC++ output are included.

APA, Harvard, Vancouver, ISO, and other styles

49

Khera, Rajesh. "The design of C++ class hierarchy to model ASN. 1 data types /." Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-10242009-020045/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

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

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

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