Graph based verification of software and identification of defects by binary search on graph

摘要: In this paper a technique is proposed to simplify testing of software using dependency graphs. Dependency graphs help highlight dependencies in the and isolate pieces code that would run independent each other. By doing graph based tests, we could ensure full path coverage. Also, if defects are found, different parts through use partitioning techniques. A binary search for defect over then source defect. Graph partition into 2 halves or dependent with input output clearly mapped. test on half one other half. Each identified part further be tested same till identified.