9/17/2002

1. Coloring code for decomposition.

A. 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.

B. Adding state-to-state checking during coloring check.

Status: Completed and tested.

C. Writing .acc files

Status: Needs further testing. Then, created .acc files need to be tested vs. atacs results.

D. Add code to free up memory.

Status: Need to do.

E. Question: Are edge->state and state->edge information important after coloring or is just state->state information important?

Answer: Just state to state information.

F. Question: Should I hard-code in min/max delays for inverters and NAND2 gates, or make an entry in the node class list?

Answer: Just put in global variable for now. Later, this information will be part of the library.

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. Revise PowerPoint presentation for SRC. Due 9/12/2002.

Status: Done.

4. Make poster presentation for SRC. Due 9/20/2002.

Status:

What are the attendees looking for? Same slides as I use for presentation?

Answer: Yes, basically.

5. 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.