Discussion

1. Discussion 06/07/2013

2. Agenda • Working example • Fitness Redesigns • Visualization

3. Working Example • Sort dataset in database • Use data pulled from amazon.com or similar service • amazon.com requires developer sign-up • Next step could be to introduce search methods • Populate array to be operated upon

4. Working Example (merge sort) Source program <amazon> Target module <sort> • Preconditions • Buffer of integer data • Buffer not empty • Postconditions • Buffer of integer data • Buffer not empty • Low index • High index • Low index < High index • Lowindex < i < highindex : buffer[i] <= buffer[i+1] • Preconditions • Buffer of integer data • Buffer not empty • Low index • High index • Low index < High index • Postconditions • Buffer of integer data • Buffer not empty • Lowindex < i < highindex : buffer[i] <= buffer[i+1]

5. Working Example (merge sort) Source program <amazon> Target module <sort> • Preconditions • Buffer of integer data • Buffer not empty • Postconditions • Buffer of integer data • Buffer not empty • Low index • High index • Low index < High index • Lowindex < i < highindex : buffer[i] <= buffer[i+1] • Preconditions • Buffer of integer data • Buffer not empty • Low index • High index • Low index < High index • Postconditions • Buffer of integer data • Buffer not empty • Lowindex < i < highindex : buffer[i] <= buffer[i+1]

6. Fitness Redesigns • Currently only tracking fitness post-traversal • All terminals accounted for • Checking order of terminals wrt. target preconditions • Limiting depth of tree for readability

7. Visualization • Difficult to quickly parse output s-expression • Library introduced (SFSEXP: Small Fast S-Expression Library) • http://sexpr.sourceforge.net/ • Automatically generates .DOT file for reading with Graphviz / Omnigraffle