Part 1: Directed random testing algorithm

Formalize DART algorithm presented at the second lecture using the introduced terminology, i.e., program transitions, computations, paths, etc.

10am, November 11th, 2007.

Use latex and email.

• Slides on program representation and pointers to DART.

Part 2: From abstract syntax trees to program transitions

We implement a compiler from abstract syntax trees (ASTs) into the program representation by transition relations. We will be using abstract syntax trees created by the CIL infrastructure. Our implementation language is Caml.

For the first part of the translation, we convert ASTs into the transitions represented in the dot format. The set of transition defines a graph where nodes a labeled by control locations, and edges are labeled by transition relations.

• Login to a MPI workstation.
• Copy and unpack the initial implementation located at ~rybal/c-frontend-proj1-Nov-09-2007-00-35.tgz. Online copy is available.
• Study the provided AST to DOT implementation.
• Study the provided initial part of the translation between AST and transitions in dot format.
• Complete the translation between AST and transitions in dot format, i.e., implement the conversion of branching statements, loops, and gotos.
• Pack and make accessible your solution as ~/yourlastname-proj1.tgz before the due date.

6pm, November 14th, 2007

• Online copy of the initial implementation.
• Program representation.
• Caml manual.
• CIL manual.