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.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Dow, Benjamin Scott

Publisher

• Worcester Polytechnic Institute

Identifier

• 01E007M

Advisor

• Fisler, Kathryn

Year

• 2001

Date created

• 2001-01-01

Resource type

• Major Qualifying Project

Major

• Computer Science

Rights statement

• In Copyright