DocumentCode :
2633735
Title :
Facilitating unreachable code diagnosis and debugging
Author :
Chou, Hong-Zu ; Chang, Kai-Hui ; Kuo, Sy-Yen
Author_Institution :
Electr. Eng. Dept., Nat. Taiwan Univ., Taipei, Taiwan
fYear :
2011
fDate :
25-28 Jan. 2011
Firstpage :
485
Lastpage :
490
Abstract :
Code coverage is a popular method to find design bugs and verification loopholes. However, once a piece of code is determined to be unreachable, diagnosing the cause of the problem can be challenging: since the code is unreachable, no counterexample can be returned for debugging. Therefore, engineers need to analyze the legality of nonexistent execution paths, which can be difficult. To address such a problem, we analyzed the cause of unreachability in several industrial designs and proposed a diagnosis technique that can explain the cause of unreachability. In addition, our method provides suggestions on how to solve the un-reachability problem, which can further facilitate debugging. Our experimental results show that this technique can greatly reduce an engineer´s effort in analyzing unreachable code.
Keywords :
formal verification; program debugging; program diagnostics; reachability analysis; code coverage; code debugging; design bugs; diagnosis technique; industrial designs; nonexistent execution paths; unreachability; unreachable code diagnosis; verification loopholes; Algorithm design and analysis; Analytical models; Computer bugs; Debugging; Hardware; Reachability analysis; Registers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference (ASP-DAC), 2011 16th Asia and South Pacific
Conference_Location :
Yokohama
ISSN :
2153-6961
Print_ISBN :
978-1-4244-7515-5
Type :
conf
DOI :
10.1109/ASPDAC.2011.5722238
Filename :
5722238
Link To Document :
بازگشت