This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
An Integrated Compiler/Run-Time System for Global Data Distribution.. - Gregory Howard (2000)(Correct)
Shared memory provides a desirable parallel programming model because communication
is implicit. However, to achieve scalability it is often necessary to execute programs on a
distributed-memory multi... / provides a desirable parallel programming model because communication is br An Integrated Compiler Run-Time System for Global Data
Project Description - The General (2000)(Correct)
utomatically generates whatever coercions are necessary
for marshalling/unmarshalling between layers. Currently, the toolbox
contains mainly classes of primitive FOs such as RPC and multicast communic... / between fragments. FO programming is supported by the FOG br toolbox of predefined FOs. The FOG compiler ensures distributed
Application of Reconfigurable CORDIC Architectures - Mencer, Semeria, Morf, Delosme (2000)(Correct)
Very high performance architectures can be designed for
data intensive and latency tolerant applications by maximizing
the parallelism and pipelining at the algorithm and
bit level. This is achieved b... / ASIC synthesis we use Synopsys Design Compiler to synthesize the circuit br can be exploited. Field-Programmable Gate Arrays FPGAs and
Nonlinear Array Layouts for Hierarchical Memory Systems - Chatterjee, Jain, Lebeck, Mundhra.. (1999)(Correct)
Programming languages that provide multidimensional arrays and
a flat linear model of memory must implement a mapping between
these two domains to order array elements in memory. This layout
function ... / Thottethodi z Abstract Programming languages that provide br in several high-performance compilers. Tiling techniques are also
Principles and a Preliminary Design for ML2000 - Group (1999)(Correct)
We describe the methodology and current features for ML2000, a new-generation design of ML. ML2000 adds
a number of features to Standard ML and Caml, providing better support for extensibility and cod... / and polymorphism are useful for programming in the small and first-order br machine. Moreover types help the compiler writer implementations of
Typed Memory Management in a Calculus of Capabilities - Crary, Walker, Morrisett (1999)(Correct)
An increasing number of systems rely on programming language
technology to ensure safety and security of low-level
code. Unfortunately, these systems typically rely on a complex,
trusted garbage colle... / number of systems rely on programming language technology to ensure br type-safe code. We present a compiler intermediate language called the
Efficient Implementation of Unification-Based Grammars - Wintner, Francez (1999)(Correct)
Contemporary linguistic formalisms such as LFG or HPSG have become so rigorous that it is now
possible to view them as very high level declarative programming languages. Consequently, grammars
for na... / the starting point for many compiler designs for Prolog. The techniques br as very high level declarative programming languages. Consequently
`C and tcc: A Language and Compiler for Dynamic Code Generation - Poletto, Hsieh, Engler, Kaashoek (1999)(Correct)
This paper makes the following contributions:
---It describes the `C language, and motivates the design of the language.
---It describes tcc, with special emphasis on its two runtime systems, one tune... / D. R. . A retargetable C compiler design and implementation. br Dynamic code generation allows programmers to use run-time information in
Preliminary Design of JML: A Behavioral Interface Specification.. - Leavens, Baker, Ruby (1999)(Correct)
JML is a behavioral interface specification language tailored to Java. It also allows
assertions to be intermixed with Java code, as an aid to verification and debugging.
JML is designed to be used by... / for clients written in a specific programming language BISLs are inherently br files To a Java compiler such annotations are comments
Combining Compile-Time and Run-Time Support for Efficient Software.. - Sandhya Dwarkadas (1999)(Correct)
We describe an integrated compile-time and run-time
system for efficient shared memory parallel computing
on distributed memory machines. The combined system
presents the user with a shared memory pro... / the user with a shared memory programming model with its well-known br and automatic data caching. The compiler improves the efficiency of the
Load-Reuse Analysis: Design and Evaluation - Bodik, Gupta, Soffa (1999)(Correct)
Load-reuse analysis finds instructions that repeatedly access the
same memory location. This location can be promoted to a register,
eliminating redundant loads by reusing the results of prior memory
... / Acm Sigplan ' Conference On Programming Language Design And br recent memory accesses. How can compilers benefit from these reuse
Measuring OS Support for Real-time CORBA ORBs - David Levine (1999)(Correct)
This paper compares and evaluates the suitability of realtime
operating systems, VxWorks and LynxOS, and generalpurpose
operating systems with real-time extensions, Windows
NT, Solaris, and Linux, for... / lack of real-time programming features and overall lack br architectures real-time IDL compiler stub skeleton optimizations
Load-Time Adaptation: Efficient and Non-Intrusive Language Extension.. - Duncan, Hölzle (1999)(Correct)
The advantages of virtual machine (VM) execution (dynamically loaded, portable object files
with high-level information) also permit changing the semantics of executables. Load-time adaptation
(LTA) ... / Round Table . Introduction Programming language researchers are br patterns coding conventions compiler modifications and binary code
Mechanized Operational Semantics via (Co)Induction - Simon J. Ambler, Roy L. Crole (1999)(Correct)
We give a fully automated description of a small programming language in the
theorem prover Isabelle-98. The language syntax and semantics are encoded, and
we formally verify a range of semantic prope... / automated description of a small programming language in the theorem prover br techniques and for verifying compiler optimization steps. Contextual
The Region Trap Library: Handling Traps on Application-Defined.. - Brecht, Sandhu (1999)(Correct)
User-level virtual memory (VM) primitives are used in many different application domains including distributed shared memory, persistent objects, garbage collection, and checkpointing. Unfortunately, ... / also impose a more restrictive programming model on the user. In this br software checks inserted by the compiler prior to memory references to
A Theory of Type Qualifiers - Foster, Fähndrich, Aiken (1999)(Correct)
We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qu... / code. Introduction Programmers know strong invariants about br is automatically veri ed by the compiler up to casting Another example
Flexible Type Analysis - Crary, Weirich (1999)(Correct)
Run-time type dispatch enables a variety of advanced
optimization techniques for polymorphic languages, including
tag-free garbage collection, unboxed function
arguments, and flattened data structures... / of previous-stage types as a programming idiom. This language is quite br However modern type-preserving compilers transform types between stages
Warm Fusion in Stratego: A Case Study in Generation of Program.. - Johann, Visser (1999)(Correct)
Stratego is a domain-specific language for the specification of program transformation systems. The design of Stratego is based on the paradigm of rewriting strategies: userdefinable programs in a lan... / role in compilers for functional programming languages br application generation and compiler construction to translate
Warm Fusion in Stratego: A Case Study in the Generation of Program.. - Johann, Visser (1999)(Correct)
Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
1.5.1 Format Checking . . . . . . . . . . . . . . . . . . . . . . . 19
1.5.2 Variable Renaming and Substitution . . . . . . . . . . . . ... / role in compilers for functional programming languages br application generation and compiler construction to translate
ACL - Eliminating Parameter Aliasing with Dynamic Dispatch - Leavens, Antropova (1999)(Correct)
We have designed and prototyped a new approach for eliminating
reference parameter aliases. This approach allows procedure calls
with overlapping call-by-reference parameters, but guarantees that pr... / CR Categories D. . Programming Languages Formal Definitions br language alias-free programs compiler optimizations call-by-value and
Towards Automatic Specialization of Java Programs - Schultz, Lawall, Consel, Muller (1999)(Correct)
Automatic program specialization can derive efficient implementations from
generic components, thus reconciling the often opposing goals of genericity and efficiency.
This technique has proved usefu... / specialization object-oriented programming software components br for C programs and a Java-to-C compiler. Specialization is managed using
A New, Simpler Linear-Time Dominators Algorithm - Buchsbaum, Kaplan, Rogers, Westbrook (1999)(Correct)
this article is organized as follows. Section 2 outlines Lengauer and
Tarjan's approach. Section 3 gives a broad overview of our algorithm and differentiates
it from previous work. Section 4 presents ... / and Subject Descriptors D. . Programming Languages br Languages Processors-compilers E. Data Structures
Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines - Lowenthal, Freeh, Andrews (1999)(Correct)
A coarse-grain parallel program typically has one thread (task) per processor, whereas a fine-grain
program has one thread for each independent unit of work. Although there are several advantages
to f... / parallelism and a shared-memory programming model on both shared- and br either extracted by parallelizing compilers or expressed in parallel
Transparent Adaptive Parallelism on NOWs using OpenMP - Scherer, Lu, Gross, Zwaenepoel (1999)(Correct)
this paper we focus
on a NOW, because there adaptivity is a requirement, not just an added feature.
Recent parallel programming models like HPF [13] or OpenMP [20] shelter the user from having to deal... / added feature. Recent parallel programming models like HPF or OpenMP br DSM system and uses the SUIF compiler toolkit to generate
Rule-Based Query Optimization, Revisited - Lane Warshaw (1999)(Correct)
We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a
general-purpose active-database rule language embedded in C++. Following the deve... / written in the highest level of programming abstraction possible. br OPTand Venus. Venus' optimizing compiler yields code whose performance is
Simple, Efficient Object Encoding using Intersection Types - Crary (1999)(Correct)
I present a type-theoretic encoding of objects that interprets method dispatch by selfapplication
(i.e., method functions are applied to the objects containing them) but still validates
the expected ... / Introduction Object-oriented programming languages usually provide br Second a type-preserving compiler must implement object features in
Irregular Parallel Algorithms in Java - Brian Blount (1999)(Correct)
The nested data-parallel programming model supports the
design and implementation of irregular parallel algorithms. This paper
describes work in progress to incorporate nested data parallelism into
... / The nested data-parallel programming model supports the design and br statements may be nested. A pre-compiler translates the forall
Memory Sharing Predictor: The Key to a Speculative Coherent DSM - An-Chow Lai (1999)(Correct)
Recent research advocates using general message predictors
to learn and predict the coherence activity in distributed
shared memory (DSM). By accurately predicting a
message and timely invoking the ne... / servers. DSMs offer programming compatibility with respect to br application programmer or complex compiler analysis. Transparent techniques
Multithreaded Dependence Graphs for Concurrent Java Programs - Zhao (1999)(Correct)
Understanding program dependencies in a computer program is essential for many software engineering activities including program slicing, testing, debugging, reverse engineering, and maintenance. In t... / Java is a new object-oriented programming language and has achieved br data flows in the program. Many compiler optimizations and program
Run-Time Selection of Block Size in Pipelined Parallel Programs - David Lowenthal (1999)(Correct)
Parallelizing compiler technology has improved in recent years. One area in which
compilers have made progress is in handling DOACROSS loops, where cross-processor data
dependencies can inhibit effici... / In practice parallel programming has proven to be very br Abstract Parallelizing compiler technology has improved in recent
Certifying Compilation and Run-time Code Generation - Hornof, Jim (1999)(Correct)
A certifying compiler takes a source language program and
produces object code, as well as a "certificate" that can be
used to verify that the object code satisfies desirable properties,
such as type ... / recent work has applied advanced programming language techniques to the br Abstract A certifying compiler takes a source language program
Dependent Types in Practical Programming (Extended Abstract) - Xi, Pfenning (1999)(Correct)
Hongwei Xi
Department of Computer Science and Engineering
Oregon Graduate Institute of Science and Technology
hongwei@cse.ogi.edu
Frank Pfenning
Department of Computer Science
Carnegie Mellon Univ... / Dependent Types in Practical Programming Extended Abstract br program error detection and compiler optimization. A major
Safe and Principled Language Interoperation - Trifonov, Shao (1999)(Correct)
Safety of interoperation of program fragments written in different safe
languages may fail when the languages have different systems of computational
effects: an exception raised by an ML function m... / is being used for systems programming. Demands for independence of br source languages allows the compiler to optimize interlanguage calls
A Formal Study of Slicing for Multi-threaded Programs with JVM.. - Hatcliff, Corbett, Dwyer.. (1999)(Correct)
Previous work has shown that program slicing can be a useful step in model-checking software
systems. We are interested in applying these techniques to construct models of multi-threaded Java
programs... / S.S. Muchnick. Advanced Compiler Design and Implementation. Morgan br to take into account common programming idioms of concurrent Java
What is a Recursive Module? - Crary, Harper, Puri (1999)(Correct)
A hierarchical module system is an effective tool for
structuring large programs. Strictly hierarchical module
systems impose an acyclic ordering on import dependencies
among program units. This can i... / units. This can impede modular programming by forcing mutually-dependent br formalism used in the SML NJ compiler and in the TIL ML
Exploiting Domain-Specific Properties: Compiling Parallel Dynamic.. - Prechelt (1999)(Correct)
Domain-specific constraints can be exploited to implement compiler optimizations
that are not otherwise feasible: Compilers for neural network learning algorithms
can achieve near-optimal co-locality ... / with explicit message-passing programming which is very cumbersome but br can be exploited to implement compiler optimizations that are not
Sassy: A Language and Optimizing Compiler for Image Processing on.. - Hammes, Draper, Böhm (1999)(Correct)
This paper presents Sassy, a single-assignment variant of the
C programming language developed in concert with Khoral Inc. and designed
to exploit both coarse-grain and fine-grain parallelism in ima... / variant of the C programming language developed in concert br Sassy A Language and Optimizing Compiler for Image Processing on
BinProlog 7.0 Professional Edition - Advanced BinProlog Programming.. - Tarau (1999)(Correct)
Introduction to BinProlog
BinProlog has been developed by Paul Tarau (http://www.cs.unt.edu/~ tarau) and is based
on his BinWAM abstract machine, a specialization of the WAM for the efficient executi... / Edition Advanced BinProlog Programming and Extensions Guide Paul br is a fast and compact Prolog compiler based on the transformation of
Return Value Placement And Tail Call Optimization In High Level.. - Bigot, Debray (1999)(Correct)
Machine [21], is to pass the ith argument in
register i: if the ith argument happens to be a variable (which typically corresponds
to an output argument), the value passed is a pointer to the location... / J. Logic Programming - Return br the S- Common Lisp compiler uses this approach for numerical
A Comparison of Software Code Reordering and Victim Buffers - Iris Bahar (1999)(Correct)
Instruction cache performance is critical to instruction fetch
efficiency and overall processor performance. The layout of
an executable has a substantial effect on the cache miss rate
during executio... / implementations of modern programming languages Futhermore br Workshop on Interaction between Compilers and Computer Architectures
Testing For Fault Tolerance - Ghosh, Mathur (1999)(Correct)
Software is being used for building applications requiring extreme dependability. In many
cases, systems must have high availability and fault tolerance. With the increasing complexity
of software, te... / The IDL can be mapped to various programming languages like C CJava and br implementation would have an IDL compiler to generate appropriate language
Transplanting in Gardens: Efficient Heterogeneous Task Migration for.. - Roe, Szyperski (1999)(Correct)
Task migration across heterogeneous platforms is one of the
great challenges of distributed computing. While several approaches are
known, very few actual implementations are available. The problem ... / to a style of inverted programming-as often used for writing br to not restrict optimising compilers in their effectiveness
PMC: A Programming Language for Embedded Systems - Mørk, Larsen, Andersen, Sestoft (1999)(Correct)
The process algebra pmc (Processes with Multiple Clocks) extends Milner's ccs with a notion of qualitative time called clocks. The algebra has been used for specifying industrial size case-studies. Ba... / PMC A Programming Language for Embedded Systems br drivers. We have a prototype compiler that compiles PMC to Java byte
A Formalization of the Proof-Carrying Code Architecture in a Linear.. - Plesko, Pfenning (1999)(Correct)
this paper we formalize the PCC safety architecture in a logical framework, which constitutes
an important first step towards an environment for experimentation and formal verification of
properties o... / natural means of describing programming languages and their semantics br be automated by a certifying compiler NL a The annotation process
Operating Systems Support for Programmable Cluster-Based Internet.. - Prashant Pradhan (1999)(Correct)
As network routers evolve towards supporting ever more higher-level networking functions beyond
traditional network-layer and transport-layer protocols, programmability becomes a major design
issue in... / Operating Systems Support for Programmable Cluster-Based Internet br it does not require special compiler support. Although routers based
Integration of SNMP into a CORBA- and Web-based Management Environment - Aschemann, Mohr, Ruppert (1999)(Correct)
The management of networks, distributed systems, and distributed applications
is an important and growing field in computer science. Besides the classical
architectures like SNMP and OSI management,... / stubs and skeletons of a programming language by an IDL compiler. br with a description of our MIB compiler in section and of our gateway
How to Pack Trees - Gil, Itai (1999)(Correct)
In a virtual memory system, the address space is partitioned into pages, and main
memory serves as a cache to the disk. In this setting, we address the following problem:
Given a tree, find an allocat... / An efficient dynamic programming algorithm to find an optimal br of algorithms. from the compiler optimization and numerical
Multi-Language Programming Environments for High Performance Java.. - Getov (1999)(Correct)
Recent developments in processor capabilities, software tools, programming languages
and programming paradigms have brought about new approaches to high performance
computing. A steadfast component of... / Multi-Language Programming Environments for High br such as IBM's High-Performance Compiler for Java HPCJ and IceT's
Resource Constrained Dataflow Retiming Heuristics for VLIW ASIPs - Jacome, de Veciana, Akuran (1999)(Correct)
This paper addresses issues in code generation of time critical loops
for VLIW ASIPs with heterogenous distributed register structures.
We discuss a code generation phasing whereby one first considers... / can be translated to an integer programming problem where the cost br difficult challenges to today's compiler technology At the root
Straightforward Java Persistence Through Checkpointing - Jon Howell (1999)(Correct)
Several techniques have been proposed for adding persistence to the Java language environment.
This paper describes a scheme based on checkpointing the Java Virtual Machine, and
compares the scheme to... / according to the persistence programming model and implementation br changed No. I Is the Java compiler changed No. T Is the
Cache-Conscious Structure Definition - Chilimbi, Davidson, Larus (1999)(Correct)
A program's cache performance can be improved by changing the
organization and layout of its data---even complex, pointer-based
data structures. Previous techniques improved the cache performance
of t... / The Acm Sigplan' Conference On Programming Language Design And br or cold rarely accessed A compiler extracts cold fields from the
Text Classification by Bootstrapping with Keywords, EM and Shrinkage - McCallum, Nigam (1999)(Correct)
When applying text classification to complex
tasks, it is tedious and expensive
to hand-label the large amounts of training
data necessary for good performance.
This paper presents an alternative appr... / NLP processing Compiler Design compiler Garbage br NLP processing Compiler Design compiler Garbage garbage
Mnesia - A Distributed Robust DBMS for Telecommunications Applications - Mattsson, Nilsson, Wikström (1999)(Correct)
The Mnesia DBMS runs in the same adress space as the application owning the
data, yet the application cannot destroy the contents of the data base. This
provides for both fast accesses and efficient f... / based on features in the Erlang programming language in which Mnesia is br whereas the optimizing query compiler and evaluator are regular Erlang
Typed Higher-order Narrowing without Higher-order Strategies - Sergio Antoy (1999)(Correct)
We describe a new approach to higher-order narrowing computations in a class of systems suitable
for functional logic programming. Our approach is based on a translation of these systems
into ordinary... / suitable for functional logic programming. Our approach is based on a br from the ability to type-check compiler output. In functional logic
What can Java Binary Compatibility mean? - Drossopoulou, Eisenbach, Wragg (1999)(Correct)
Java binary compatibility prescribes conditions under
which modiøcation and re-compilation of classes does
not necessitate re-compilation of further classes importing
the modiøed classes. Binary compa... / and linking were introduced into programming languages in the seventies. In br Ada Modula- the compiler checks for type consistency and
S.E.A.L. - A New Approach in Teaching Computing - Ausserhofer (1999)(Correct)
Although the concept of applying computer software
for educational purposes dates back some 30 years,
using Computer Based Learning (CBL) environments
and Web-based Training (WBT) systems for teaching... / out the rapid change of actual programming languages. Traditional courses br various platforms with different compiler types and versions. Results and
Initialization Problems for Java - Börger, Schulte (1999)(Correct)
We exhibit a grey area in the specification
of Java and of its implementation through the Java Virtual
Machine (JVM): the treatment of initialization of
classes and interfaces. We report the result ... / techniques. Key words Programming language -Java -Virtual br and that various current Java compilers violate the initialization
Programming Colonies of Biological Cells - Weiss (1999)(Correct)
This document outlines an approach for demonstrating the feasibility of programming colonies of
biological cells using in vivo digital circuits. Simulation results suggest that in vivo digital circuit... / of Doctor of Philosophy Title Programming Colonies of Biological Cells br circuit microbial circuit compiler genome high-level program
Exploiting Conditional Instructions in Code Generation for Embedded.. - Leupers (1999)(Correct)
This paper presents a new code optimization
technique for a class of embedded processors. Modern
embedded processor architectures show deep instruction
pipelines and highly parallel VLIW-like instruct... / We present a dynamic programming technique for selecting the br code quality of current DSP compilers which still makes
The Stratego Tutorial - Visser (1999)(Correct)
Stratego is a language for the speci cation of transformation rules
and strategies for applying them. Speci cations consist of a collection of modules
that de ne the signature of the object language(s... / . . Sequential Programming . br rules and strategies. The Stratego compiler translates speci -cations to C
Enhancing OpenMP With Features for Locality Control - Chapman, Mehrotra, Zima (1999)(Correct)
OpenMP is a set of directives extending Fortran and C which provide a shared
memory programming interface for shared-address space machines. However,
there are no directives for controlling the locali... / C which provide a shared memory programming interface for shared-address br program's data locality while the compiler generates the actual low-level
Performance and Programming Experience on the Tera MTA - Larry Carter (1999)(Correct)
The Tera MTA (for "Multithreaded Architecture") computer features a radically
new architecture, with hardware support for up to 128 threads per processor, a powerful
instruction set, nearly uniform ac... / Performance and Programming Experience on the Tera MTA br is supported by a state-of-the-art compiler. For scientific codes
Synchronous Programming of Reactive Systems - A Tutorial and.. - Halbwachs (1998)(Correct)
to describe them as sets of concurrent
processes.
Cases (2) and (3) must be distinguished. In the later case, concurrency is
nothing but a description facility; we call it logical concurrency. Genera... / Synchronous Programming of Reactive Systems A br from an initial data e.g.a compiler In synchronous programming we
From System F to Typed Assembly Language - Morrisett, Walker, Crary, Glew (1998)(Correct)
We motivate the design of a statically typed assembly language (TAL) and present a typepreserving
translation from System F to TAL. The TAL we present is based on a conventional
RISC assembly language... / constructors that may be used by programmers or compilers to build new br constructs admit most low-level compiler optimizations. Our translation
A transformation-based optimiser for Haskell - Jones, Santos (1998)(Correct)
Many compilers do some of their work by means of correctness-preserving, and hopefully performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) takes this idea of "compilatio... / This leads to a more modular compiler design in contrast to compilers br appear in Science of Computer Programming . Introduction Using
Applying Patterns to Develop Extensible ORB Middleware - Schmidt (1998)(Correct)
Distributed object computing forms the basis for nextgeneration application middleware. At the heart of distributed object computing are Object Request Brokers (ORBs), which automate many tedious and ... / and error-prone distributed programming tasks. Like many other br Repository Repository Idl Idl Compiler Compiler Dii Dii Orb Orb
Programming Language Semantics in Foundational Type Theory - Crary (1998)(Correct)
There are compelling benefits to using foundational type theory as a framework for programming
language semantics. I give a semantics of an expressive programming calculus in the
foundational type the... / Programming Language Semantics in br intermediate language in the KML compiler In this section I discuss
Implementing Typed Intermediate Languages - Shao, League, Monnier (1998)(Correct)
Recent advances in compiler technology have demonstrated
the benefits of using strongly typed intermediate languages
to compile richly typed source languages (e.g., ML). A typepreserving
compiler can ... / Conference on Functional Programming September Baltimore br Abstract Recent advances in compiler technology have demonstrated the
Measuring and Optimizing CORBA Latency and Scalability Over.. - Gokhale, Schmidt (1998)(Correct)
There is increasing demand to extend object-oriented middleware,
such as OMG CORBA, to support applications with
stringent quality of service (QoS) requirements. However,
conventional CORBA Object Req... / CORBA automates common network programming tasks such as object location br Repository Repository Idl Idl Compiler Compiler Dii Dii Orb Orb
Optimizing a CORBA IIOP Protocol Engine for Minimal Footprint.. - Gokhale, Schmidt (1998)(Correct)
Communication software for hand-held devices must be flexible
and efficient to deliver the necessary Quality of Service
(QoS) to multimedia applications such as real-time audio and
video, video on-dem... / keyword. To workaround the compiler design we defined a helper method br implementation or use ffl Programming language The languages
Should Your Specification Language Be Typed? - Lamport, Paulson (1998)(Correct)
Most specification languages have a type system. Type systems are hard to get
right, and getting them wrong can lead to inconsistencies. Set theory can serve
as the basis for a specification language ... / multiple platforms networking programming technology system modelling br language they let the compiler catch errors that would otherwise
Typed Cross-Module Compilation - Shao (1998)(Correct)
Higher-order modules are very effective in structuring large
programs and defining generic, reusable software components.
Unfortunately, many compilation techniques for the
core languages do not work ... / Introduction Modular programming has proven to be extremely br As a result few optimizing compilers support these module facilities
Automatic Accurate Time-Bound Analysis for High-Level Languages - Liu (1998)(Correct)
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence of partially known in... / algorithms programming languages br systems interactive environments compiler optimizations performance
Bridging the gulf: a common intermediate language for ML and Haskell - Jones, Shields, al. (1998)(Correct)
Compilers for ML and Haskell use intermediate languages
that incorporate deeply-embedded assumptions about order
of evaluation and side effects. We propose an intermediate
language into which one can ... / Introduction Functional programmers are typically split into two br State University Abstract Compilers for ML and Haskell use
Communication overlap in multi-tier parallel algorithms - Baden, Fink (1998)(Correct)
Hierarchically organized multicomputers such as
SMP clusters offer new opportunities and new challenges
for high-performance computation, but realizing
their full potential remains a formidable task.
... / a compiler for the Fortran-P programming language which uses a spare br Sawdey et al. describe a compiler for the Fortran-P programming
Semantic-Based Program Analysis for Logic-Based Languages using XSB - Codish, Demoen (1998)(Correct)
This article describes a simple and efficient way of using a logic programming language with
tabulation for general purpose semantic-based program analysis. The simplicity of the method
is based on a ... / efficient way of using a logic programming language with tabulation for br interpreter induces an abstract compiler which maps input programs to
Reflections on the Design of a Specification Language - Kahrs, Sannella (1998)(Correct)
We reflect on our experiences from work on the design and semantic underpinnings
of Extended ML, a specification language which supports the specification
and formal development of Standard ML program... / language for use with a given programming language. Consequently the br information is unreliable -SML compilers are not forced to stick to the
Using Integer Sets for Data-Parallel Program Analysis and Optimization - Adve, Mellor-Crummey (1998)(Correct)
In this paper, we describe our experience with using an abstract
integer-set framework to develop the Rice dHPF compiler,
a compiler for High Performance Fortran. We present
simple, yet general formul... / a simple portable abstract programming model applicable to a wide br framework to develop the Rice dHPF compiler a compiler for High Performance
Compiler Support for Real-Time Programs - Gerber, Hong (1998)(Correct)
Introduction
One of the primary challenges of building a real-time system lies in balancing its
functional requirements against its temporal requirements. Functional requirements
define valid transla... / an automated methodology to assist programmers in this process. Our approach br Chapter Compiler Support for Real-Time Programs
A Customisable Memory Management Framework for C++ - Attardi, Flagella, Iglio (1998)(Correct)
Automatic garbage collection relieves programmers from the burden of managing memory themselves
and several techniques have been developed that make garbage collection feasible in many situations,
inc... / garbage collection relieves programmers from the burden of managing br support in the language or the compiler. The techniques used in the CMM
alto: A Link-Time Optimizer for the DEC Alpha - Muth, Debray, Watterson (1998)(Correct)
Traditional optimizing compilers are limited in the scope of their optimizations by the fact that only a single
function, or possibly a single module, is available for analysis and optimization. In pa... / in procedurecall intensive programming languages such as Prolog and br Abstract Traditional optimizing compilers are limited in the scope of
Once Upon a Polymorphic Type - Wansbrough, Jones (1998)(Correct)
We present a sound type-based `usage analysis' for a realistic lazy functional language. Accurate information
on the usage of program subexpressions in a lazy functional language permits a compiler to... / feature of typed functional programming languages. Secondly we br lazy functional language permits a compiler to perform a number of useful
A Type-Theoretic Interpretation of Standard ML - Harper, Stone (1998)(Correct)
ion boundaries must be broken at run-time. Consequently, an association between
the abstract stamps and their underlying representations must be maintained.
In this paper we outline an interpretation ... / step in the development of programming languages. Milner's elegant br to implementation. The TIL ML compiler and recent versions of the
Correctness of Monadic State: An Imperative Call-by-Need Calculus - Ariola, Sabry (1998)(Correct)
The extension of Haskell with a built-in state monad combines
mathematical elegance with operational efficiency:
ffl Semantically, at the source language level, constructs
that act on the state are v... / significant advantages to both programmers and compiler writers. br in the optimization phase of the compiler. This discovery motivates the
Automatic Array Alignment in Parallel Matlab Scripts - Milosavljevic, Jabri (1998)(Correct)
We present the ParAL system which compiles Matlab scripts into C programs
with calls to a parallel run-time library. The main feature of the compiler
is the optimisation of array alignment which reduc... / has resulted in many array programming tools and environments. br library. The main feature of the compiler is the optimisation of array
An Overview of the CORBA Portable Object Adapter - Pyarali, Schmidt (1998)(Correct)
An Object Adapter is an integral part of the Common Object
Request Broker Architecture (CORBA). An Object Adapter assists
an Object Request Broker (ORB) in delivering client requests
to server object ... / by automating common network programming tasks such as object location br Repository Repository Idl Idl Compiler Compiler Dii Dii Orb Orb
Wide-Area Implementation of the Message Passing Interface - Foster, Geisler, Gropp, Karonis.. (1998)(Correct)
The Message Passing Interface (MPI) can be used as a portable, high-performance programming
model for wide-area computing systems. The wide-area environment introduces challenging
problems for the MPI... / as a portable high-performance programming model for wide-area computing br for use by library writers and compiler writers in addition to MPI
The SwitchWare Active Network Implementation - Alexander, Hicks, Kakkar, Keromytis, .. (1998)(Correct)
Introduction
This is an overview of work on the SwitchWare active
network project, which began two years ago based
on ideas about how to improve the flexibility of networks
by making the network prog... / of networks by making the network programmable. The original ideas for br and the quality of the OCaml compiler has allowed us to consistently
Model Checking Concurrent Systems with Unbounded Integer Variables.. - Tevfik Bultan (1998)(Correct)
Model checking is a powerful technique for analyzing large, finite-state systems. In an
infinite-state system, however, many basic properties are undecidable. In this paper, we present
a new symbolic ... / useful is more like that a programmer draws on when setting br Fellowship. Presburger Compiler DNF Partitioning Control-Point
The Fox Project: Advanced Language Technology for Extensible Systems - Harper, Lee, Pfenning (1998)(Correct)
It has been amply demonstrated in recent years that careful attention to the
structure of systems software can lead to greater flexibility, reliability, and
ease of implementation, without incurring a... / safety infrastructure and compiler design. As we explained earlier the br is our contention that advanced programming languages-particularly
Retargetable Code Generation based on Structural Processor.. - Leupers, Marwedel (1998)(Correct)
Design automation for embedded systems comprising both hardware and software
components demands for code generators integrated into electronic CAD systems. These code
generators provide the necessar... / through software running on programmable embedded processors such br processors. General-purpose compilers for standard processors are
Compilation, Synthesis, and Simulation of Hardware Description.. - Cheng (1998)(Correct)
Compilation, Synthesis, and Simulation of
Hardware Description Languages
--- The Compositional Models of HDL's
by
Szu-Tsung Cheng
Doctor of Philosophy in
Computer Science
University of California, B... / languages or simulator programming languages to describe the br protocol embedded by a compiler in the design itself. This
On Chromatic Sums and Distributed Resource Allocation - Bar-Noy, Bellare.. (1998)(Correct)
This paper studies an optimization problem that arises in the context of distributed resource
allocation: Given a conflict graph that represents the competition of processors over resources,
we seek a... / been studied in the contexts of compiler design and VLSI routing In a br Problem ACM Trans. Programming Languages and Systems
Reasoning about implicit invocation - Dingel, Garlan, Jha, Notkin (1998)(Correct)
Implicit invocation [SN92, GN91] has become an important
architectural style for large-scale system design and evolution.
This paper addresses the lack of specification and verification
formalisms for... / in broadcast message-based programming environments such as those br A collection of tools such as a compiler a debugger an editor a
Eliminating Barrier Synchronization for Compiler-Parallelized Codes.. - Han, Tseng, Keleher (1998)(Correct)
Software distributed-shared-memory (DSM) systems provide an appealing target for parallelizing
compilers due to their flexibility. Previous studies demonstrate such systems
can provide performance com... / to achieving peak performance when programmed using a message-passing br Barrier Synchronization for Compiler-Parallelized Codes on Software
Design Recovery Through Formal Specification - Lim, Harrison, Bailes, Berglas (1998)(Correct)
The benefits of formal methods in software
development are well recognised and well documented.
Design recovery involves analysing the source code and
recovers the desired design elements based on des... / Specification TS programming of origin-target br that differs from typical compiler architecture in that it admits
Compiling Standard ML to Java Bytecodes - Benton, Kennedy, Russell (1998)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications D... / SIGPLAN Conference on Functional Programming September Baltimore. br for ML. Notable features of the compiler itself include whole-program
Using State Space Exploration and a Natural Deduction Style Message.. - Clarke, Jha, Marrero (1998)(Correct)
As more resources are added to computer networks, and as more vendors look to the World Wide Web as a viable marketplace, the importance of being able to restrict access and to insure some kind of acc... / thesis he proved that certain programming language control structures br as a state machine. While a new compiler now provides this feature for the
Program Specialization via Algorithmic Unfold/Fold Transformations - Pettorossi, Proietti (1998)(Correct)
this paper we will essentially
refer to these techniques as they have been developed in the fields of functional
and logic programming. unknown Program Specialization via Algorithmic Unfold/Fold
Trans... / fields of functional and logic programming. Partial Evaluation and br of its application is automatic compiler generation while unfold fold
A Non-Deterministic Call-by-Need Lambda Calculus - Kutzner, Schmidt-Schauß (1998)(Correct)
In this paper we present a non-deterministic call-by-need
(untyped) lambda calculus nd with a constant choice and a
let-syntax that models sharing. Our main result is that nd
has the nice operationa... / for compiling lazy functional programming languages with I O based on br In order to be able to built a compiler using program transformations
Graph Traverse Software Pipelining - Barrado, Ayguadé, Labarta (1998)(Correct)
Software pipelining is becoming widely used as a loop execution model for microprocessors
supporting a high instruction level parallelism. In this paper we describe a heuristic method for
software pip... / modulo schedulers use integer programming models EiDA Feau RGSL br superscalar architectures the compiler is fully responsable for
The Design and Implementation of a Certifying Compiler - Necula, Lee (1998)(Correct)
This paper presents the design and implementation of a
compiler that translates programs written in a type-safe
subset of the C programming language into highly optimized
DEC Alpha assembly language p... / to the traditional compiler design and hence it should be br in a type-safe subset of the C programming language into highly optimized
Data Transformations for Eliminating Conflict Misses - Rivera, Tseng (1998)(Correct)
Many cache misses in scientific programs are due to conflicts
caused by limited set associativity. We examine two
compile-time data-layout transformations for eliminating conflict
misses, concentratin... / Acm Sigplan Conference On Programming Language Design And br loop nests We believe compiler transformations can be very
Data-Parallel Load Balancing Strategies - Cyril Fonlupt (1998)(Correct)
Programming irregular and dynamic data-parallel algorithms requires to take
data distribution into account. The implementation of a load balancing algorithm is a quite
difficult task for the programme... / December Abstract Programming irregular and dynamic br to a library or a data-parallel compiler run-time. We propose load
Comparative Evaluation of Fine- and Coarse-Grain Approaches for.. - Sandhya Dwarkadas (1998)(Correct)
Symmetric multiprocessors (SMPs) connected with low-latency
networks provide attractive building blocks for software distributed
shared memory systems. Two distinct approaches have
been used: the fine... / To ease the burden of programming such clusters software br to the interaction of current compiler technology with application
Nano-Threads: Programming Model Specification - Labarta (1998)(Correct)
this document is structured as follows. Section 2 presents the user--interface defined
in the project, including both the nano--threads library interface (for C and FORTRAN) and
directives for the FOR... / M .D Nano-Threads Programming Model Specification July br . Autoscheduling Compiler
Execution Characteristics of Object Oriented Programs on the.. - Radhakrishnan, John (1998)(Correct)
It is widely accepted that object-oriented design improves code reusability, facilitates code
maintainability and enables higher levels of abstraction. Although software developers and
the software en... / have embraced object-oriented programming for these benefits there have br in program extensions. The compiler sets up a dispatch entry for the
Variable Length Path Branch Prediction - Stark, al. (1998)(Correct)
ing with credit is permitted. To copy otherwise, to
republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions
from Publications D... / . of the Python objectoriented programming language interpreter python br a mechanism for letting the compiler select the predictor to use for
n-RTL Implementation - April Universitat (1998)(Correct)
NthLib is the concrete n-RTL implementation done in the context of the NANOS project to
support multi-level and fine-grain parallelism in a multiprogrammed environment. This deliverable
presents the d... / . . Outline of the Programming Model . br is used by the parallelizing compiler to generate parallel code from
Costing parallel programs as a function of shapes - Jay (1998)(Correct)
Efficient, portable parallel programming requires cost models to compare
different possible implementations. In turn, these require knowledge of the
shapes of the data structures being used, as well a... / Efficient portable parallel programming requires cost models to compare br in a form that enables the compiler to choose an appropriate
Dynamically Adaptive Parallel Programs - Voss, Eigenmann (1998)(Correct)
Dynamic program optimization is the only recourse for optimizing compilers when machine and
program parameters necessary for applying an optimization technique are unknown until runtime.
With the move... / we apply the dynamically adaptive programming approach to tiling and show br the only recourse for optimizing compilers when machine and program
Building Program Optimizers with Rewriting Strategies - Visser, Benaissa, Tolmach (1998)(Correct)
We describe a language for defining term rewriting strategies, and its application to the production of program optimizers. Valid transformations on program terms can be described by a set of rewrite ... / Conference on Functional Programming ICFP' ACM Baltimore MD br Introduction Compiler components such as parsers
Optimal And Near-Optimal Solutions For Hard Compilation Problems - Kremer (1998)(Correct)
An optimizing compiler typically uses multiple program representations at
different levels of program and performance abstractions in order to be able
to perform transformations that -- at least in th... / complexities of the high-level programming model and of the underlying br U.S.A. ABSTRACT An optimizing compiler typically uses multiple program
An Invoicing Case Study in Z - Bowen (1998)(Correct)
This paper presents an initial attempt at a solution to a challenge set by Prof. Henri Habrias to compare the questions raised by different methods in the formalization of an informal set of requireme... / is a problem experience by many programmers who have learned how to br is normally only defined by the compiler and the underlying computer
Quality and Speed in Linear-Scan Register Allocation - Traub (1998)(Correct)
ing control flow as a linear ordering of the basic blocks makes linear-scan allocators
run efficiently. If the allocation decisions in each basic block were independent from
the decisions in other blo... / S. Muchnick Advanced Compiler Design and Implementation Morgan br Allocation ACM Transactions on Programming Languages and Systems
Comparing Flow and Context Sensitivity on the.. - Philip Stocks (1998)(Correct)
Precision and scalability are two desirable, yet often conflicting,
features of data-flow analyses. This paper reports on a
case study of the modification-side-effects problem for C in
the presence of... / in parallel and sequential programming environments need br effects is crucial for aggressive compiler optimization practical
On the Runtime Complexity of Type-Directed Unboxing - Minamide (1998)(Correct)
Avoiding boxing when representing native objects is essential for the efficient compilation of any programming language. For polymorphic languages this task is difficult, but several schemes have been... / the ecient compilation of any programming language. For polymorphic br introduced in a publicly released compiler We think that this fact
Evaluating Architectures for Multi-threaded CORBA Object Request.. - Douglas Schmidt (1998)(Correct)
This paper will appear in the Communications of the ACM
Special Issue on CORBA edited by Krishnan Seetharaman,
October 1998, Vol. 41, No. 10.
Introduction unknown Evaluating Architectures for Multi-th... / ORB developers and application programmers therefore is to devise br Repository Repository Idl Idl Compiler Compiler Dii Dii Orb Orb
IPERF: A Framework for Automatic Construction of Performance.. - Hsu, Kremer (1998)(Correct)
Performance prediction models at the source
code level are crucial in optimizing compilers, programming
environments, and performance debugging
tools. For each performance prediction task,
minimal-cos... / crucial in optimizing compilers programming environments and performance br level are crucial in optimizing compilers programming environments and
Measuring the Effectiveness of Automatic Parallelization in SUIF - Byoungro So (1998)(Correct)
This paper presents both an experiment and a system for inserting
run-time dependence and privatization testing. The goal of the experiment
is to measure empirically the remaining opportunities for
ex... / nest simultaneously. Parallel Programming Tools. A number of parallel br by state-of-theart parallelizing compiler technology. We perform run-time
Compiling Java to a Typed Lambda-Calculus: A Preliminary Report - Wright, Jagannathan, Ungureanu.. (1998)(Correct)
Introduction
A typical compiler for Java translates source code into machine-independent byte code. The byte code
may be either interpreted by a Java Virtual Machine, or further compiled to native co... / gains acceptance as a mainstream programming language performance rather br z Introduction A typical compiler for Java translates source code
SSCC: A Software Tool Based on Extended Ordered Attribute Grammars - Yang, Liu (1998)(Correct)
Attribute grammars are a formalism for specifying computations on syntax trees. SSCC (a Sufficiently Smart Compiler
Compiler) is a practical attribute-grammar system based on a polynomial-time extens... / the semantics of programming languages since the meaning of br SSCC a Sufficiently Smart Compiler Compiler is a practical
A Structured Synchronization and Communication Model Fitting.. - Melin, Raffin, Rebeuf, Virot (1998)(Correct)
In this paper, we present a parallel programming and execution model based on a logical
ordering of control flows. We show that it is possible to provide a unifying framework consisting
of a synchrono... / this paper we present a parallel programming and execution model based on a br is then transferred to the compiler. It has to efficiently translate
Safe and Efficient Active Network Programming - Scott Thibault (1998)(Correct)
Active networks are aimed at incorporating programmability
into the network to achieve extensibility. One approach
to obtaining extensibility is to download router programs
into network nodes. This pr... / Safe and Efficient Active Network Programming Scott Thibault Charles br automatically generated run-time compiler for PLAN-P produces code which
A Tool for Constructing Safe Extensible C++ Systems - Small (1998)(Correct)
The boundary between application and system is
becoming increasingly permeable. Extensible applications,
such as web browsers, database systems, and
operating systems, demonstrate the value of allowin... / to instability. Object-oriented programming models are a good fit for the br code produced by the Gnu Ccompiler as input and produces
A Dependence-Based Representation for Concurrent Object-Oriented.. - Zhao, Cheng, Ushijima (1998)(Correct)
Software maintenance is a costly process because of the reason that each modification to a program must take into account many complex dependence relationships in the existing software. An understandi... / the concurrent objectoriented programming language CCSection br between the statements. Many compiler optimizations depend on program
Faster Fourier Transforms via Automatic Program Specialization - Lawall (1998)(Correct)
this paper, we investigate whether partial evaluation is a suitable tool
for generating an efficient FFT implementation. One measure of success is how
many expressions are eliminated or simplified by ... / evaluator for the C programming language. Tempo is the only br time and run time focusing on compiler issues that affect the
Modular Compilers Based on Monad Transformers - Harrison, Kamin (1998)(Correct)
The monadic style of language specification has the
advantages of modularity and extensibility: it is simple
to add or change features in an interpreter to reflect
modifications in the source language... / modular compilers for high-level programming languages from reusable br Modular Compilers Based on Monad Transformers
Integer Linear Programming vs. Graph-Based Methods in Code Generation - Kästner, Langenbach (1998)(Correct)
A common characteristic of many embedded applications is that they are aimed at the
high-volume consumer market, which is extremely cost-sensitive. However many of them
impose stringent performance de... / Integer Linear Programming vs. Graph-Based Methods in br demands. High-level language compilers often are unable to generate
How to Migrate Agents - Hohlfeld, Yee (1998)(Correct)
Using our migration extension technique, it is possible to create an agent system in which the programmer is not restricted from using any part of the normally available functionality in their program... / this requires the agent programmer to explicitly write code to br can be provided via a pre-compiler extending a base programming
Principles for Developing and Measuring High-performance Web Servers.. - James Hu (1998)(Correct)
High-performance Web servers are essential to meet the
growing demands of the Internet. Satisfying these demands
requires a thorough understanding of the key factors that affect
Web server performance... / is based on the ACE network programming toolkit which is an br generator used the Sun SC . . Ccompiler suite along with version . .
Join Evaluation Schemata for Constraint Handling Rules (CHR) - Holzbaur, Frühwirth (1998)(Correct)
CHR is a committed-choice language consisting of guarded rules that
rewrite constraints into simpler ones until they are solved. CHR can define
both simplification of and propagation over user-defined... / general-purpose concurrent logic programming languages Sha concurrent br realized as a library containing a compiler runtime system and solvers
Accelerating Multi-Media Processing by Implementing Memoing in.. - Daniel Citron (1998)(Correct)
This paper proposes a technique that enables performing
multi-cycle (multiplication, division, square-root ...) computations
in a single cycle. The technique is based on the
notion of memoing: saving ... / achieve high throughput. New compiler design and run-time scheduling is br instruction itself. Thus if the compiler unrolls a loop our scheme will
Query Deforestation - Grust, Scholl (1998)(Correct)
The construction of a declarative query engine for a DBMS includes the challenge of compiling algebraic queries into efficient execution plans that can be run on top of the persistent storage. This wo... / of fusion rules for an imperative programming language in which plans had to br However given that the query compiler arranges the query plan as a
NP-completeness: A Retrospective - Papadimitriou (1998)(Correct)
For a quarter of a century now, NP-completeness has been
computer science's favorite paradigm, fad, punching bag, buzzword, alibi,
and intellectual export. This paper is a fragmentary commentary on ... / that three other problems linear programming primality and graph br is more than each of the terms compiler database expert neural
OcamlP3l a functional parallel programming system - DANELUTTO, DI COSMO, LEROY, PELAGATTI (1998)(Correct)
Writing parallel programs is not easy, and debugging them is usually a nightmare.
To cope with these difficulties, a structured approach to parallel programs
using skeletons and template based compile... / OcamlP l a functional parallel programming system Marco DANELUTTO br using skeletons and template based compiler techniques has been developed
The Theory of Fexprs is Trivial - Wand (1998)(Correct)
We provide a very simple model of a reflective facility based on the pure -calculus,
and we show that its theory of contextual equivalence is trivial: two terms in the language are
contextually equ... / The thesis of much of programming language semantics is that the br source-to-source optimization in a compiler except possibly for a
A Type System for Object Initialization In the Java Bytecode Language - Freund, Mitchell (1998)(Correct)
In the standard Java implementation, a Java language
program is compiled to Java bytecode. This bytecode
may be sent across the network to another site, where it
is then interpreted by the Java Virtua... / Introduction The Java programming language is a statically-typed br generated by a conventional compiler is accepted. The need for
Kernel-Level Scheduling for the Nano--Threads Programming Model - Eleftherios Polychronopoulos (1998)(Correct)
Multiprocessor systems are increasingly becoming the systems
of choice for low and high-end servers, running such
diverse tasks as number crunching, large-scale simulations,
data base engines and worl... / Scheduling for the Nano-Threads Programming Model Eleftherios D. br consists of an auto-scheduling compiler a multithreading runtime library
An Adaptable Multithreaded Prefetching Technique for Client-Server.. - Nils Knafla (1998)(Correct)
this paper, we examine the way in which prefetching can exploit parallelism.
Prefetching has been studied before in many areas of computing such as
operating systems, microprocessor design, compiler c... / systems microprocessor design compiler construction the world wide br providing a storage manager a programming language E an extension of
RTL Calls Generator - Labarta (1998)(Correct)
In this deliverable we describe the implementation of a back--end pass on Parafrase--2 that
automates the generation of parallel and instrumented code, and a new pass in the front--end
to parse OpenMP... / source-to-source compiler -Design Implementation and br as required by the Nano-Thread Programming Model Pol a Pol b M D
Co-inductive Axiomatization of a Synchronous Language - Nowak, Beauvais, Talpin (1998)(Correct)
Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchronous languages) and automatic ve... / development of domain-specific programming languages e.g. synchronous br declare local signals. The Signal compiler analyses the consistency of the
Constraint Driven Approach To Loop Pipelining And Register Binding - Mesman, Strik, Timmer, van.. (1998)(Correct)
Code generation methods for DSP applications are
hampered by the combination of tight timing constraints
imposed by the performance requirements of DSP
algorithms, and resource constraints imposed by ... / written in a high-level programming language thus requiring the br thus requiring the use of a compiler. In this paper we will address
Integrating Parallelizing Compilation Technology and Processor.. - Jenn-Yuan Tsai (1998)(Correct)
As the number of transistors on a single chip continues to grow, it is important to think beyond the
traditional approaches of compiler optimizations for deeper pipelines and wider instruction issue
u... / By tightly integrating the compiler design with the architectural br of the SIGPLAN ' Conference on Programming Language Design and
Neural Network Training and Simulation Using a Multidimensional.. - Likas, Karras, Lagaris (1998)(Correct)
A new approach is presented to neural network simulation and training that is
based on the use of general purpose optimization software. This approach requires
that the training problem should be form... / that can be combined via user programmable minimization strategies. br Merlin system and the associated compiler has been implemented. The
Automated Symbolic Timing Analysis for Distributed Systems - Stoller, Unnikrishnan (1998)(Correct)
A timing property of a distributed system is an assertion about the time intervals between
events in executions of that system. There are three traditional approaches to determining
timing properties ... / written in a conventional programming language cf. Section . br are specific to a particular compiler operating system CPU network
Handling ELAN Rewrite Programs via an Exchange Format - Borovansky, Moreau, Ringeissen (1998)(Correct)
Designing a programming environment raises difficult implementation problems
since such software is not just one piece of code able to execute programs expressed in
a given programming language, but c... / Cedex Abstract Designing a programming environment raises difficult br interpreter and a fast compiler. Some environments are currently
Visor++: A Visualisation Tool for Concurrent Object-Oriented Programs - Oudshoorn, Widjaja (1998)(Correct)
The use of program visualisation for understanding
and fine-tuning task-parallel object-oriented
programs is desirable. One reason is that such
programs typically involve complex interactions
between ... / Concurrent object-oriented programming is a powerful paradigm in that br language run-time system or the compiler. This paper explores the
Efficient Support of Parallel Sparse Computation for Array Intrinsic.. - Chang, Chuang, Kuen (1998)(Correct)
Fortran 90 provides a rich set of array intrinsic functions. Each of these array intrinsic functions operates on
the elements of multi-dimensional array objects concurrently. They provide a rich sourc... / Hiranandani. Distributed memory compiler design for sparse problems. IEEE br support of data parallel programming. However there is no such
Lightweight Formal Methods For Computer Algebra Systems - Dunstan, Kelsey, Linton, Martin (1998)(Correct)
In this paper we demonstrate the use of formal methods
tools to provide a semantics for the type hierarchy of the
AXIOM computer algebra system, and a methodology for
Aldor program analysis and verifi... / commonly found in the functional programming world such as higher-order br to be extended. The current Aldor compiler is able to produce libraries for
Dynamic Processor Allocation with the Solaris Operating System - Yue (1998)(Correct)
Parallel applications typically do not perform well in a multiprogrammed environment
that uses time-sharing to allocate processor resources to the applications'
parallel threads. Coscheduling related ... / existing solutions. Our programming model and system architecture br system and parallelizing compiler and provides further evidence of
Adaptive Utilization of Communication and Computational Resources in.. - Diwan, Gannon (1998)(Correct)
Development of high-performance distributed applications
can be extremely challenging because of their complex
runtime environment coupled with their requirement of
high-performance. Such applications... / This paper describes EMOP a programming environment for building br interacting components by a stub compiler. Also following on the lines of
Predicated Array Data-Flow Analysis for Run-Time Parallelization - Sungdo Moon (1998)(Correct)
This paper presents a new analysis for parallelizing compilers
called predicated array data-flow analysis, whereby array dataflow
analysis for parallelization and privatization is extended to associat... / be equivalent to integer linear programming where linear subscript br a new analysis for parallelizing compilers called predicated array
Poly-dimensional Array Programming - Jay (1998)(Correct)
FISh is the first language to support a poly-dimensional,
data polymorphic type constructor for regular arrays. Now a fully-typed
program may take a vector, matrix or higher-dimensional regular arra... / Poly-dimensional Array Programming C.B. Jay School of br and shape functions. Then the compiler evaluates the shape functions
Constructing Distributed Groupware Systems - Barrett, Tangney, Cahill (1998)(Correct)
this paper. We are now exploring the construction of more complex systems with
Wilde.
RELATED WORK
We are aware of research in the field of software composition which is broadly similar to our approac... / so simplifying the design and programming tasks. This support should be br system than would a standard Ccompiler since the former allows for the
A Core Language for Rewriting - Visser, Benaissa (1998)(Correct)
System S is a calculus providing the basic abstractions of term rewriting: matching
and building terms, term traversal, combining computations and handling failure.
The calculus forms a core language ... / for non-deterministic sequential programming. System S This work br System S expression System S compiler C program term transformed
High Performance Distributed Object Communication for the CMS.. - Johannes Gutleber (1998)(Correct)
In this paper we present a pattern for minimal object oriented communication middleware.
The motivation comes from the strong requirements of high performance data acquisition
systems, like for the CM... / As the use of object oriented programming becomes more common in the high br and subjects through an IDL compiler has not been implemented yet
Dynamic Programming as Frame for Efficient Parsing - Ferro, Souto, al. (1998)(Correct)
The last few years have seen a renewal of interest in the
consideration of dynamic programming in compiler technology.
This is due to the compactness of the representations,
which are turning this par... / Dynamic Programming as Frame for Efficient Parsing br of dynamic programming in compiler technology. This is due to the
Safe-for-Space Threads in Standard ML - Edoardo Biagioni (1998)(Correct)
Threads can easily be implemented using first-class continuations,
but the straightforward approaches for doing so lead to space leaks,
especially in a language with exceptions like Standard ML. We sh... / is concerned about space safety. Programming with threads is common in br be optimized away by a good compiler but the space leak involving
Sub-machine-code Genetic Programming - Poli, Langdon (1998)(Correct)
CPUs are often seen as sequential, however they have a high degree of internal
parallelism, typically operating on 32 or 64 bits simultaneously. This paper
explores the idea of exploiting this interna... / Sub-machine-code Genetic Programming Riccardo Poli and William B. br Fukunaga et al. a genome compiler has been proposed which
Compiling Lazy Functional Programs to Java Bytecode - Meehan, Joy (1998)(Correct)
this
paper). It is a simple, weakly-typed, pure lazy functional language with no pattern-matching or
user-de ned types.
After parsing, the Ginger compiler transforms the source tree into a set of su... / that the reader is familiar with programming in Java and has some br designed as the target for Java compilers but there is not reason why it
A Functional Reactive Animation of a Lift using Fran - Thompson (1998)(Correct)
This paper uses the Functional Reactive Animation system, Fran, to
give a simulation of a simple two floor lift (or elevator). We introduce
those aspects of Fran relevant to the simulation, thus makin... / the Haskell PH functional programming language on Windows platforms. br using the Glasgow Haskell Compiler Gla The main architect of
Primitives of Sequential and Parallel Computation - Forsell, Leppänen, Penttonen (1998)(Correct)
This paper addresses the question: 'Are there some primitive concepts that can be
used to explain various aspects of computers and computations?'. We claim that many
concepts and design principles can... / the computation. The sequential programming can also be criticized of br found in the problem from the compiler since parallelism is a resource
Hitch hiker's Guide to ESQIMO - Computational model for analogy.. - Valencia (1998)(Correct)
ESQIMO is a computational model for analogy solving based on a topological formalism
of representation. The source and the target analogs are represented as
simplexes and the analogy solving is model... / in the Mathematica programming language and the version br with the Caml Light system compiler and linker version . . For
A Lightweight Architecture for Program Execution Monitoring - Clinton Jeffery (1998)(Correct)
The Alamo monitor architecture reduces the difficulty
of developing dynamic analysis tools, such as specialpurpose
profilers, bug-detectors, and program visualizers.
1 Introduction
Dynamic analysis ... / A monitor framework for the Icon programming language presented one br running Solaris and the GNU C compiler. Most of the framework employs
CuPit-2: Portable and Efficient High-Level Parallel Programming of.. - Hopp, Prechelt (1998)(Correct)
CuPit-2 is a special-purpose programming language designed for expressing dynamic neural
network learning algorithms. It provides most of the flexibility of general-purpose languages
such as C or C
+... / Efficient High-Level Parallel Programming of Neural Networks Holger br parallel programming portability compiler constructive algorithms
An Architectural Framework for Domain-Oriented Software Generators - Sant'Anna (1998)(Correct)
Software generators are important tools in the deployment of a software product-line but, most of the time they are
built without an architectural framework that can help on planning and evaluating th... / conforms to some basic rules of programming style for increased br Reverse engineering tools compilers for distributed systems
Data Parallelism In Java - Philippsen (1998)(Correct)
Java supports threads and remote method invocation, but it does
not support either data parallel or distributed programming. This paper discusses
Java's shortcomings with respect to data parallel pr... / data parallel or distributed programming. This paper discusses Java's br with current just-in-time compilers runs merely a factor of slower
Fast Module Mapping and Placement for Datapaths in FPGAs - Callahan, Chong, DeHon, Wawrzynek (1998)(Correct)
By tailoring a compiler tree-parsing tool for datapath module
mapping, we produce good quality results for datapath synthesis
in very fast run time. Rather than flattening the design
to gates, we pres... / HANSON D. A Retargetable C Compiler Design and Implementation. br with a linear-time dynamic programming algorithm. In a novel extension
Gardens: An Integrated Programming Language and System for Parallel.. - Roe, Szyperski (1998)(Correct)
Gardens is an integrated programming language and system
supporting parallel computation across networks of workstations. It addresses
a combination of goals: it (i) maximises performance and (ii)
i... / Gardens An Integrated Programming Language and System for br efficiency relies heavily on compiler optimisations. Adaptation
System Services for Distributed Application Configuration - Bellissard, Boyer, Riveill, Vion-Dury (1998)(Correct)
The reuse of existing software components for the
engineering of complex distributed applications is today a
key issue in industrial development projects. Encapsulation
and interconnection of heteroge... / be implemented using different programming languages the emphasis has br a synchronous call. The OCL compiler handles such properties and
On the Unification of Substitutions in Type Inference - McAdam (1998)(Correct)
Traditional type inference and type checking algorithms work well with
correctly typed programs, but their results when given programs containing type
errors can be unpredictable. This leads to a pr... / This is a particular problem with programming languages with Hindley-Milner br The type system is implemented in compilers and used for several purposes.