9/17/2002

1. Coloring code for decomposition.

A. Writing .acc files

Status: Writing code to put a line for every output in the code. Once completed, needs to be tested and compared to atacs output.

B. Initial state of state graph. How to handle during coloring?

Current implementation:

Find start state.

Color state 0 or 1 based on Boolean evaluation of node under consideration.

Color all edges leaving state with same color as state (0 or 1).

New implementation:

Find start state.

Color state with a soft 0 or 1 on Boolean evaluation of node under consideration.

Color all edges leaving state with same soft color as state.

Propagate hard colors first (from other edges).

Propagate the soft colors as far as they will go. Let the soft colors be overridden. When all is done, convert remaining soft colors to hard colors.

Status: Needs to be coded and tested.

C. Add code to free up memory.

Status: Need to do.

2. Get up to speed on incorporating timing into hazard checking code.

Status:

First pass pseudo code for timing algorithm in process. Modifying linked list structure in decomposition code. Adding time calculation routines.

3. Acquire and install Vmware for my laptop.

Status:

Vmware downloaded. Need to configure and install Linux 7.3 Can SRC money pay for this?

Answer: May not need this.