MPI Graph exploration for test generation

[martinruefenacht]

Instead of writing a generator for each general test we can come up with we want to replace that through an automated generation as well.

• We have the call dependency graph of MPI through the Standard (needs & leads)
• We have the data flow dependency through the function arguments

By using these two we can explore the graph using a breath first search traversal.

1. Start at the nodes which no "needs"
2. If node has no "leads", complete, we are at an independent function
3. Otherwise apply BFS.

How do we mesh this with the data dependency?

[martinruefenacht]

This will discover the disjoint sub graphs of MPI_Get_version, etc... And the init-finalize path.

All these minimal paths would be "seeds" to mutate a path from. Any path through the function call graph of MPI is valid according to the Standard. The valid/invalid test case is constructed from the path and the property-based exploration.

[martinruefenacht]

How does the error handling fit into all of this?

[martinruefenacht]

This is involved in the #34 and #33.

[martinruefenacht]

Updated the graph above to show which graph was used to create the edge.

[martinruefenacht]

Initial results, reads the standard, using only needs/leads at the moment. Can jump to any function, no "mutation" done seems viable though. Need the type system understanding and mechanisms to be adjusted.