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

Charles C. Weems - One of the best experts on this subject based on the ideXlab platform.

  • Towards universal Code Generator generation
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Timothy Richards, Edward K. Walters, Trek Palmer, Eliot J B Moss, Charles C. Weems
    Abstract:

    One of the most difficult tasks a compiler writer faces is the construction of the Code Generator. The Code Generator is that part of the compiler that translates compiler intermediate representation (IR) into instructions for a target machine. Unfortunately, implementing a Code Generator "by hand" is a difficult, time consuming, and error prone task. The details of both the IR and target instruction set must be carefully considered in order to generate correct and efficient Code. This, in turn, requires an expert in both the compiler internals as well as the target machine. Even an expert, however, can produce a Code Generator that is difficult to verify and debug. In this paper we present a universal approach for automating the construction of correct Code Generators. In particular, we show that both the compiler IR and target instruction set semantics can be described by a machine description language and leveraged by a heuristic search procedure to derive Code Generator patterns. We then utilize formal methods to determine if the IR and target sequence pairs that make up these patterns are semantically equivalent.

  • IPDPS - Towards universal Code Generator generation
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Timothy Richards, Edward K. Walters, Trek Palmer, J.e.b. Moss, Charles C. Weems
    Abstract:

    One of the most difficult tasks a compiler writer faces is the construction of the Code Generator. The Code Generator is that part of the compiler that translates compiler intermediate representation (IR) into instructions for a target machine. Unfortunately, implementing a Code Generator "by hand" is a difficult, time consuming, and error prone task. The details of both the IR and target instruction set must be carefully considered in order to generate correct and efficient Code. This, in turn, requires an expert in both the compiler internals as well as the target machine. Even an expert, however, can produce a Code Generator that is difficult to verify and debug. In this paper we present a universal approach for automating the construction of correct Code Generators. In particular, we show that both the compiler IR and target instruction set semantics can be described by a machine description language and leveraged by a heuristic search procedure to derive Code Generator patterns. We then utilize formal methods to determine if the IR and target sequence pairs that make up these patterns are semantically equivalent.

Timothy Richards - One of the best experts on this subject based on the ideXlab platform.

  • Towards universal Code Generator generation
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Timothy Richards, Edward K. Walters, Trek Palmer, Eliot J B Moss, Charles C. Weems
    Abstract:

    One of the most difficult tasks a compiler writer faces is the construction of the Code Generator. The Code Generator is that part of the compiler that translates compiler intermediate representation (IR) into instructions for a target machine. Unfortunately, implementing a Code Generator "by hand" is a difficult, time consuming, and error prone task. The details of both the IR and target instruction set must be carefully considered in order to generate correct and efficient Code. This, in turn, requires an expert in both the compiler internals as well as the target machine. Even an expert, however, can produce a Code Generator that is difficult to verify and debug. In this paper we present a universal approach for automating the construction of correct Code Generators. In particular, we show that both the compiler IR and target instruction set semantics can be described by a machine description language and leveraged by a heuristic search procedure to derive Code Generator patterns. We then utilize formal methods to determine if the IR and target sequence pairs that make up these patterns are semantically equivalent.

  • IPDPS - Towards universal Code Generator generation
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Timothy Richards, Edward K. Walters, Trek Palmer, J.e.b. Moss, Charles C. Weems
    Abstract:

    One of the most difficult tasks a compiler writer faces is the construction of the Code Generator. The Code Generator is that part of the compiler that translates compiler intermediate representation (IR) into instructions for a target machine. Unfortunately, implementing a Code Generator "by hand" is a difficult, time consuming, and error prone task. The details of both the IR and target instruction set must be carefully considered in order to generate correct and efficient Code. This, in turn, requires an expert in both the compiler internals as well as the target machine. Even an expert, however, can produce a Code Generator that is difficult to verify and debug. In this paper we present a universal approach for automating the construction of correct Code Generators. In particular, we show that both the compiler IR and target instruction set semantics can be described by a machine description language and leveraged by a heuristic search procedure to derive Code Generator patterns. We then utilize formal methods to determine if the IR and target sequence pairs that make up these patterns are semantically equivalent.

Ko Kwang-man - One of the best experts on this subject based on the ideXlab platform.

  • Retargetable Code Generator for Java byteCode
    Proceedings Fourth International Conference Exhibition on High Performance Computing in the Asia-Pacific Region, 2000
    Co-Authors: Jung Sung-ok, Lee Sung-joo, Ko Kwang-man
    Abstract:

    The massive growth of the Internet and the World Wide Web has lead to research into programming languages for the development of applications in heterogeneous, network-wide distributed environments. Java is an object-oriented language for such an environment and the Java programming language environment provides a portable, interpreted, high-performance, simple programming language. ByteCode is an intermediate Code for the Java language and it enables the development of applications on multiple platforms in heterogeneous, distributed networks, but it takes a lot of time to execute byteCode because an interpretation method is used. We design and implement a retargetable Code generation system, which can be systematically reconfigured to generate Code for a variety of distinct target computers. Using the system, we realize the Code Generator which translates the byteCode being produced by the Java compiler into native target Code. We use the ACK system to do the work easily.

Jens Teubner - One of the best experts on this subject based on the ideXlab platform.

  • a sql 1999 Code Generator for the pathfinder xquery compiler
    International Conference on Management of Data, 2007
    Co-Authors: Torsten Grust, Manuel Mayr, Jan Rittinger, Sherif Sakr, Jens Teubner
    Abstract:

    The Pathfinder XQuery compiler has been enhanced by a new Code Generator that can target any SQL:1999-compliant relational database system(RDBMS). This Code Generator marks an important next step towards truly relational XQuery processing, a branch of database technology that aims to turn RDBMSs into highly efficient XML and XQuery processors without the need to invade the relational database kernel. Pathfinder, a retargetable front-end compiler, translates input XQuery expressions into DAG-shaped relational algebra plans. The Code Generator then turns these plans into sequences of either SQL:1999 statements or view definitions which jointly implement the (sometimes intricate) XQuery semantics. In a sense, this demonstration thus lets relational algebra and SQL swap their traditional roles in database query processing. The result is a Code Generator that (1) supports an almost complete dialect of XQuery, (2) can target any RDBMS with a SQL:1999 language interface, and (3) exhibits quite promising performance characteristics when run against high-volume XML data as well as complex XQuery expressions.

  • SIGMOD Conference - A SQL: 1999 Code Generator for the pathfinder xquery compiler
    Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07, 2007
    Co-Authors: Torsten Grust, Manuel Mayr, Jan Rittinger, Sherif Sakr, Jens Teubner
    Abstract:

    The Pathfinder XQuery compiler has been enhanced by a new Code Generator that can target any SQL:1999-compliant relational database system(RDBMS). This Code Generator marks an important next step towards truly relational XQuery processing, a branch of database technology that aims to turn RDBMSs into highly efficient XML and XQuery processors without the need to invade the relational database kernel. Pathfinder, a retargetable front-end compiler, translates input XQuery expressions into DAG-shaped relational algebra plans. The Code Generator then turns these plans into sequences of either SQL:1999 statements or view definitions which jointly implement the (sometimes intricate) XQuery semantics. In a sense, this demonstration thus lets relational algebra and SQL swap their traditional roles in database query processing. The result is a Code Generator that (1) supports an almost complete dialect of XQuery, (2) can target any RDBMS with a SQL:1999 language interface, and (3) exhibits quite promising performance characteristics when run against high-volume XML data as well as complex XQuery expressions.

Edward K. Walters - One of the best experts on this subject based on the ideXlab platform.

  • Towards universal Code Generator generation
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Timothy Richards, Edward K. Walters, Trek Palmer, Eliot J B Moss, Charles C. Weems
    Abstract:

    One of the most difficult tasks a compiler writer faces is the construction of the Code Generator. The Code Generator is that part of the compiler that translates compiler intermediate representation (IR) into instructions for a target machine. Unfortunately, implementing a Code Generator "by hand" is a difficult, time consuming, and error prone task. The details of both the IR and target instruction set must be carefully considered in order to generate correct and efficient Code. This, in turn, requires an expert in both the compiler internals as well as the target machine. Even an expert, however, can produce a Code Generator that is difficult to verify and debug. In this paper we present a universal approach for automating the construction of correct Code Generators. In particular, we show that both the compiler IR and target instruction set semantics can be described by a machine description language and leveraged by a heuristic search procedure to derive Code Generator patterns. We then utilize formal methods to determine if the IR and target sequence pairs that make up these patterns are semantically equivalent.

  • IPDPS - Towards universal Code Generator generation
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Timothy Richards, Edward K. Walters, Trek Palmer, J.e.b. Moss, Charles C. Weems
    Abstract:

    One of the most difficult tasks a compiler writer faces is the construction of the Code Generator. The Code Generator is that part of the compiler that translates compiler intermediate representation (IR) into instructions for a target machine. Unfortunately, implementing a Code Generator "by hand" is a difficult, time consuming, and error prone task. The details of both the IR and target instruction set must be carefully considered in order to generate correct and efficient Code. This, in turn, requires an expert in both the compiler internals as well as the target machine. Even an expert, however, can produce a Code Generator that is difficult to verify and debug. In this paper we present a universal approach for automating the construction of correct Code Generators. In particular, we show that both the compiler IR and target instruction set semantics can be described by a machine description language and leveraged by a heuristic search procedure to derive Code Generator patterns. We then utilize formal methods to determine if the IR and target sequence pairs that make up these patterns are semantically equivalent.