This paper presents an innovative technique to efficiently develop hardware and software code generators. The specification model is first converted into its equivalent data structure. Target programs result from a set of transformation rules applied ...

We propose a framework called HydLa for simple modeling and reliable simulation of hybrid systems which involve discrete and continuous changes over time. HydLa employs interval constraints as a central principle to express uncertainties ...

Bioinformatics is a challenging area for computer science, since the underlying computational formalisms span database systems, numerical methods, geometric modeling and visualization, imaging and image analysis, combinatorial algorithms, data analysis ...

FPOPT, a globally optimizing compiler for FP, was built to study the efficiency of compiling a functional programming language by translating it into an intermediate language and then optimizing that intermediate language. This paper describes the FPOPT ...

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a finite set of patterns. ...

It has frequently been remarked that it is easier recognize “high level” languages than to define the concept. For the purposes of this debate, however, I think that we agree that a language is high level to the extent ...

As one of the promising efforts to minimize the surging microprocessor power consumption, adaptive computing environments (ACEs), where microarchitectural resources can be dynamically tuned to match a program's run-time requirement and characteristics, ...

The evolution of computer languages is compared with the evolution of natural languages. This suggests that APL might one day evolve to, or be replaced by, a non-declining form having only one basic syntax and only one class of object—as LISP has ...

To meet ever-increasing demands for higher performance and lower power consumption, many high-end digital signal processors (DSPs) commonly employ non-orthogonal architecture. This architecture typically is characterized by irregular data paths, heterogeneous ...

Although some specific mutual exclusion problems have been studied extensively, automatic solutions to synchronize general mutual exclusion problems with arbitrary mutual exclusion constraints have not been fully explored. This paper discusses an Ada ...

This article presents a few guidelines and examples for testing Pascal compilers designed by students in introductory courses. A standard Pascal subset with little alteration is used, and the possible sources of errors are divided into eight categories. ...

I/O subsystem configurations are dictated by the storage and I/O requirements of the specific applications that use the disk hardware. Treating the latter requirement as a given, however, draws a boundary at the channel interface that is not well-suited ...

Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a crucial role in compiler optimization. The problem ...

A large application program was simultaneously coded in both C++ and Lisp. This note compares the two implementations. The conclusion is that programming in the two languages takes roughly the same amount of time and effort, but C++ seems better for ...

The ambient logic has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. To understand the extensionality and the intensionality of the ...

We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitoring is useful not only for testing, but also under actual deployment. The specification ...