WARF: P97131US

  • Available Under Copyright

Implementation of System Dependence Graphs


Thomas Reps

OVERVIEWThis software program consists of a collection of C modules (C-type definitions and associated code) for implementing:
  • System dependent graphs -- a data structure representing the dependencies that hold among program elements (see link below)
  • Algorithms for program slicing and chopping
  • Other miscellaneous processing, such as diagnostics and test programs
  • A specification for a browsing tool for viewing slices, chops, etc.
  • Enables detection of dependencies among program elements, which focuses the user’s attention on portions of a program relevant to a particular computation
  • Useful for creating program “projections” (reduced or simplified programs)
  • Slicing and chopping operations are carried out on system dependence graphs, rather than computed by iterative calculations
  • Slicing and chopping operations are “precise up to valid paths” – that is, only dependencies that reflect matched call/return patterns are reported
For More Information About the Inventors
Contact Information
For current licensing status, please contact Emily Bauer at or 608-960-9842.
The WARF Advantage

Since its founding in 1925 as the patenting and licensing organization for the University of Wisconsin-Madison, WARF has been working with business and industry to transform university research into products that benefit society. WARF intellectual property managers and licensing staff members are leaders in the field of university-based technology transfer. They are familiar with the intricacies of patenting, have worked with researchers in relevant disciplines, understand industries and markets, and have negotiated innovative licensing strategies to meet the individual needs of business clients.