We show how an ALPHA program can be naively implemented by viewing it as a set of monolithic arrays and their filing functions, implemented using applicative ...

It was designed to be used for the specification and synthesis of regular array architectures [8]. In the proposed design methodology, regular algorithms are.

This paper addresses the problem of validating an initial specification by demonstrating a translation methodology which compiles ALPHA into the imperative ...

We show how an ALPHA program can be naively implemented by viewing it as a set of monolithic arrays and their filing functions, implemented using applicative ...

In recognition of the fundamental relation between regular arrays and systems of affine recurrence equations, the Alpha language was developed as the basis ...

In recognition of the fundamental relation between regular arrays and systems of affine recurrence equations, the ALPHA language was developed as the basis ...

In this paper, we analyze systems of linear recurrence equations, a generalization of uniform recurrence equations. The first part of the paper describes a ...

The naive execution of affine recurrence equations. Wilde D., Rajopadhye S. Expand. Publication type: Proceedings Article. —. DOI: 10.1109/ASAP.1995.522900.

Systems of affine recurrence equations (SAREs) over polyhedral domains are widely used to model computation-intensive algorithms and to derive parallel code ...

The C{code may then be compiled and executed to test the speci cation. We show how an Alpha program can be naively implemented by viewing it as a set of ...