Machine Language Code

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 13803 Experts worldwide ranked by ideXlab platform

Lars Clausen - One of the best experts on this subject based on the ideXlab platform.

  • GCSE - Lightweight and Generative Components I: Source-Level Components
    Lecture Notes in Computer Science, 2000
    Co-Authors: Samuel N. Kamin, Miranda Callahan, Lars Clausen
    Abstract:

    Current definitions of "software component" are based on abstract data types -- collections of functions together with local data. This paper addresses two ways in which this definition is inadequate: it fails to allow for lightweight components -- those for which a function call is too ineffcient or semantically inappropriate -- and it fails to allow for generative components -- those in which the component embodies a method of constructing Code rather than actual Code. We argue that both can be solved by proper use of existing Language technologies, by using a higher-order meta-Language to compositionally manipulate values of type Code, syntactic fragments of some object Language. By defining' a client as a function from a component to Code, components can be defined at a very general level without much notational overhead. In this paper, we illustrate this idea entirely at the source-Code level, taking Code to be string. Operating at this level is particularly simple, and is useful when the source Code is not proprietary. In a companion paper, we define Code as a set of values containing Machine-Language Code (as well as some additional structure), allowing components to be delivered in binary form.

Samuel N. Kamin - One of the best experts on this subject based on the ideXlab platform.

  • GCSE - Lightweight and Generative Components I: Source-Level Components
    Lecture Notes in Computer Science, 2000
    Co-Authors: Samuel N. Kamin, Miranda Callahan, Lars Clausen
    Abstract:

    Current definitions of "software component" are based on abstract data types -- collections of functions together with local data. This paper addresses two ways in which this definition is inadequate: it fails to allow for lightweight components -- those for which a function call is too ineffcient or semantically inappropriate -- and it fails to allow for generative components -- those in which the component embodies a method of constructing Code rather than actual Code. We argue that both can be solved by proper use of existing Language technologies, by using a higher-order meta-Language to compositionally manipulate values of type Code, syntactic fragments of some object Language. By defining' a client as a function from a component to Code, components can be defined at a very general level without much notational overhead. In this paper, we illustrate this idea entirely at the source-Code level, taking Code to be string. Operating at this level is particularly simple, and is useful when the source Code is not proprietary. In a companion paper, we define Code as a set of values containing Machine-Language Code (as well as some additional structure), allowing components to be delivered in binary form.

Miranda Callahan - One of the best experts on this subject based on the ideXlab platform.

  • GCSE - Lightweight and Generative Components I: Source-Level Components
    Lecture Notes in Computer Science, 2000
    Co-Authors: Samuel N. Kamin, Miranda Callahan, Lars Clausen
    Abstract:

    Current definitions of "software component" are based on abstract data types -- collections of functions together with local data. This paper addresses two ways in which this definition is inadequate: it fails to allow for lightweight components -- those for which a function call is too ineffcient or semantically inappropriate -- and it fails to allow for generative components -- those in which the component embodies a method of constructing Code rather than actual Code. We argue that both can be solved by proper use of existing Language technologies, by using a higher-order meta-Language to compositionally manipulate values of type Code, syntactic fragments of some object Language. By defining' a client as a function from a component to Code, components can be defined at a very general level without much notational overhead. In this paper, we illustrate this idea entirely at the source-Code level, taking Code to be string. Operating at this level is particularly simple, and is useful when the source Code is not proprietary. In a companion paper, we define Code as a set of values containing Machine-Language Code (as well as some additional structure), allowing components to be delivered in binary form.

Charles E. Stroud - One of the best experts on this subject based on the ideXlab platform.

  • PSIM: A processor SIMulator for basic computer architecture and operation education
    Proceedings of the IEEE SoutheastCon 2010 (SoutheastCon), 2010
    Co-Authors: Michael A. Lusco, Charles E. Stroud
    Abstract:

    A Processor SIMulator (PSIM) for a basic stored program computer architecture is described which graphically displays the architecture while showing the detailed operation on a per clock cycle basis. The instruction set consists of twenty-five instructions that can be combined to execute many complex capabilities including conditional branching. The current version of PSIM includes an assembler for compiling assembly Language programs to Machine Language Code, the ability to display values in various formats including decimal and hexadecimal, and the ability to display and write to a file the contents of the program memory at any point in the simulation.1

Raymond A. Lorie - One of the best experts on this subject based on the ideXlab platform.

  • Preserving digital information an alternative to full emulation
    Zeitschrift Fur Bibliothekswesen Und Bibliographie, 2001
    Co-Authors: Raymond A. Lorie
    Abstract:

    The preservation of digital data for the long term presents variety of challenges from technical to social and organizational. The technical challenge is to ensure that the information, generated today, can survive long term changes in storage media, devices and data formats. This paper presents a novel approach to the problem. It distinguishes between archiving data files and archiving programs (so that their behavior may be reenacted in the future). For data files, a program P is archived, together with the data. P is able to deCode the information and return an »understandable« view of the data to the caller. For archiving a program, the proposal consists of saving the original executable object Code together with a program P which emulates the functionality of the original computer. In both cases, P is specified as Machine Language Code for a Universal Virtual Computer that is general, yet basic enough as to remain relevant in the future.

  • System R: an architectural overview
    Ibm Systems Journal, 1999
    Co-Authors: M. W. Blasgen, Raymond A. Lorie, Morton M. Astrahan, Donald D. Chamberlin, Jim Gray, W. F. King, Bruce G. Lindsay, J. W. Mehl, T. G. Price, G. R. Putzolu
    Abstract:

    We have described the architecture of System R, including the Relational Data System and the Research Storage System. The RDS supports a flexible spectrum of binding times, ranging from precompilation of “canned transactions” to on-line execution of ad hoc queries. The advantages of this approach may be summarized as follows: 1. For repetitive transactions, all the work of parsing, name binding, and access path selection is done once at precompilation time and need not be repeated. 2. Ad hoc queries are compiled on line into small Machine-Language routines that execute more efficiently than an interpreter. 3. Users are given a single Language, SQL, for use in ad hoc queries as well as in writing PL/I and COBOL transaction programs. 4. The SQL parser, access path selection routines, and Machine Language Code generator are used in common between query processing and precompilation of transaction programs. 5. When an index used by a transaction program is dropped, a new access path is automatically selected for the transaction without user intervention.