Recap of Project 2 Requirements

1
Recap of Project 2 Requirements

• CPRE 416-Software Evolution and Maintenance

2
Background

• In the last four classes, we discussed
• General concept of matching pair defects with
  varying degrees of semantic depth
• One specific example matching pairs of memory
  allocation and deallocation calls
• Project II based on memory calls
• three sets of requirements and the submission
  formats.
• This presentation recaps the three requirements.

3
Requirement-I

• Create a table of getbuf calls and another table
  of freebuf calls.
• Each table should be sorted use the name of
  function, where the call occurs, as the primary
  key and the line number within that function as
  the secondary key.
• Each call should have a unique ID based on the
  sorting.

4
Requirement-II

• Create a table that shows for each getbuf the
  corresponding freebuf calls.
• The table should be sorted using the getbuf Id as
  the primary key.
• Choose three non-trivial (as defined in the
  class) cases of matching pair and articulate your
  matching logic clearly and precisely.

5
Requirement - III

• Create a table which lists only the matching
  pairs not connected by any control paths
  involves two execution threads.
• Note that the two threads must communicate
  through a shared data structure or message
  passing Identify the shared structure through
  which the pointer to the memory is shared.
• Select one matching pair and articulate your
  matching logic clearly and precisely.

6
Final Note

• This is a recap of class discussions and not a
  substitute for all the points discussed in the
  class.
• For example, we discussed matching strategies
  which are not covered here.
• You are expected to attend class and make sure
  you follow all the points discussed in the class.