This project compares the performance of two different algorithms for symbolic cycle detection in very large graphs, in particular graphs represented as Binary Decision Diagrams. The purpose is to determine if one of the two algorithms performs better on graphs with certain characteristics, therby allowing verification engineers to choose an algorithm that will be more efficient on each problem. This will allow verification systems, or systems to analyze the validity of a given design, to run more quickly and efficiently.
Worcester Polytechnic Institute
Major Qualifying Project
Access to this report is limited to members of the WPI community. Please contact a project advisor or their department to request access
Restricted-WPI community only