Open Access. Powered by Scholars. Published by Universities.®

Programming Languages and Compilers Commons™

Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

Air Force Institute of Technology

Articles 1 - 9 of 9

Full-Text Articles in Programming Languages and Compilers

Combinational Circuit Obfuscation Through Power Signature Manipulation, Hyunchul Ko Jun 2011

Combinational Circuit Obfuscation Through Power Signature Manipulation, Hyunchul Ko

Theses and Dissertations

Today's military systems are composed of hardware and software systems, many of which are critical technologies, and must be protected to ensure our adversaries cannot gain any information from a various analysis attacks. Side Channel Analysis (SCA) attacks allow an attacker to gain the significant information from the measured signatures leaked by side-channels such as power consumption, and electro-magnetic emission. In this research the focus on detecting, characterizing, and manipulating the power signature by designing a power signature estimation and manipulation method. This research has determined that the proposed method capable of characterizing and altering the type of power signature …

Go to article

A Comparative Analysis Of Ascii And Xml Logging Systems, Eric C. Hanington Sep 2010

A Comparative Analysis Of Ascii And Xml Logging Systems, Eric C. Hanington

Theses and Dissertations

This research compares XML and ASCII based event logging systems in terms of their storage and processing efficiency. XML has been an emerging technology, even for security. Therefore, it is researched as a logging system with the mitigation of its verbosity. Each system consists of source content, the network transmission, database storage, and querying which are all studied as individual parts. The ASCII logging system consists of the text file as source, FTP as transport, and a relational database system for storage and querying. The XML system has the XML files and XML files in binary form using Efficient XML …

Go to article

A Visual Meta-Language For Generic Modeling, Hakan Canli Mar 2002

A Visual Meta-Language For Generic Modeling, Hakan Canli

Theses and Dissertations

This research examines the usefulness of a visual meta-language (VLGM Visual Language for Generic Modeling) developed for the specification of components and relations in a modeling domain. The language is designed to allow software tools to interpret specifications and automatically provide modeling environments. VLGM makes use of the object-orientated software engineering methodology. It defines four types of special classes and three types of relations between them. Data types and primitive types are allocated with several attributes to provide restrictions and enable consistency checks over models. As part of this research a software tool was designed. The tool provides a workspace …

Go to article

Cobol Reengineering Using The Parameter Based Object Identification (Pboi) Methodology, Sonia De Jesus Rodrigues Jun 1999

Cobol Reengineering Using The Parameter Based Object Identification (Pboi) Methodology, Sonia De Jesus Rodrigues

Theses and Dissertations

This research focuses on how to reengineer Cobol legacy systems into object oriented systems using Sward's Parameter Based Object Identification (PBOI) methodology. The method is based on relating categories of imperative subprograms to classes written in object oriented language based on how parameters are handled and shared among them. The input language of PBOI is a canonical form called the generic imperative model (GIM), which is an abstract syntax tree (AST) representation of a simple imperative programming language. The output is another AST, the generic object model (GOM), a generic object oriented language. Conventional languages must be translated into the …

Go to article

Transforming Cobol Legacy Software To A Generic Imperative Model, Dina L. Moraes Mar 1999

Transforming Cobol Legacy Software To A Generic Imperative Model, Dina L. Moraes

Theses and Dissertations

Legacy COBOL code presents challenges for organizations wishing to increase their effectiveness and improve their efficiency. The systems that utilize this code are vital to enterprise operations, yet maintenance of code is expensive. This research presents an alternative that overcomes some of the problems of legacy COBOL code through the use of software reengineering techniques. This research develops a transformation system to convert COBOL code into a generic imperative model, recapturing the initial design and deciphering the requirements implemented by the legacy code, thereby making possible the documentation of legacy systems, design restructuring, and the re-design of a new, enhanced …

Go to article

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Z Perspective, Kathleen M. Wabiszewski Dec 1994

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Z Perspective, Kathleen M. Wabiszewski

Theses and Dissertations

This research established a foundation for formalizing the evolution of based object models to theories, part of a dual approach for formally extending object-oriented analysis models using the Z and LARCH languages. For the initial phase, a comprehensive, consistent, and correct Z language parser was implemented within the SOFTWARE REFINERY™ Programming Environment. The Z parser produced abstract syntax trees (ASTs) of objects, thereby forming the basis for analyzing the similarities and differences between the based and LARCH-based object representations. The second phase used the analysis of the two languages to identify fundamental core constructs that consisted of similar syntactic and …

Go to article

Designing And Implementing An Ada Language Binding Specification For Odmg-93, Stephen R. Lindsay Dec 1994

Designing And Implementing An Ada Language Binding Specification For Odmg-93, Stephen R. Lindsay

Theses and Dissertations

Object-oriented database management systems (ODBMSs) represent the latest advancement in database technology, combining the reusability and maintainability of the object-oriented programming paradigm with the ability to efficiently store and retrieve a wide range of data types as well as code to manipulate stored data. Unfortunately, programmers developing software in the Ada programming language do not have the ability to interface to object databases without significant customized code development. One important reason for this has been the absence of a standard defining the constructs accessing ODBMS functionality. This thesis documents the creation of an Ada language binding to the ODMG-93 standard …

Go to article

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Larch Perspective, Catherine J. Lin Dec 1994

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Larch Perspective, Catherine J. Lin

Theses and Dissertations

This research describes the feasibility of developing object-oriented LARCH specifications, part of a dual approach for formally extending object-oriented analysis models using LARCH and Z. The first phase consisted of two steps establishing a set of transformation heuristics for algebraically representing object models and implementing a robust LARCH parser. The LARCH parser produced abstract syntax trees ASTs of objects forming the basis for analyzing the similarities and differences between Z-based and LARCH-based object representations. The second phase used the analysis of LARCH and Z to identify fundamental core constructs in the languages and abstract syntax trees. These core constructs consisted …

Go to article

Solving The Ranking And Selection Indifference-Zone Formulation For Normal Distributions Using Computer Software, Catherine A. Poston Dec 1993

Solving The Ranking And Selection Indifference-Zone Formulation For Normal Distributions Using Computer Software, Catherine A. Poston

Theses and Dissertations

Ranking and selection procedures are statistical methods used to compare and choose the best among a group of similar statistically distributed populations. The two predominant approaches to solving ranking and selection problems are Guptas subset selection formulation and Bechhofers indifference- zone formulation. For the indifference-zone formulation where the populations have equal sample sizes, Barr and Rizvi developed an integral expression of the probability of correct selection PCS. Given appropriate parameters, the integral expression can be solved to determine the common sample size required to attain a desired PCS. Tables with selected solutions to the integral expression are available for a …

Go to article