The TASS Intermediate Representation

The TASS Intermediate Representation is a programming language-neutral abstract representation of a program. It provides support for multiple processes, functions, variables, pointers, message passing, etc.

It is the job of a TASS front-end module to translate from source code in a language such as MiniMP, C, C++, or Fortran to a TASS Intermediate Representation. TASS currently includes a front-end for MiniMP, and front-ends for other languages with support for the Message Passing Interface (MPI) is in progress.

Model

A model is an abstract representation of a program. It has a name, a set of shared variables, and a sequence of processes.

Processes

Processes are numbered 0,1,...,n-1, where n is the number of processes. The number n is fixed when the model is created and can never change. The unique number associated to a process is known as the process's "pid." Each process contains a number of process variables, and a number of functions. One of the functions is designated the "main" function (though that function's name does not have to be "main"). In particular, every process must contain at least one function.

Variables

There are four different scopes to which a variable may belong.

Types

Expressions

Locations

The locations fall into a number of categories, for the most part corresponding to the kinds of statements that can emanate from that location. Some locations only allow one outgoing statement, while others allow several, and others none.

Statements

Each statement has a single source location and a single destination location.

Functions

A function specifies a number of formal parameters, or "formal variables." In addition, it specifies a number of "proper local variables." All of these (formal and proper locals) are referred to as "local variables." The local variables can only be accessed within the function body. The function body itself is a transition system. The function contains a set of locations and a set of statements. These define a directed graph in which the locations are nodes and the statements are edges. A function has a designated "start location," and thus every function must have at least one location.
VSL