By Topic

A precise demand-driven definition-use chaining algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hajnal, A. ; Comput. & Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary ; Forgacs, I.

This paper describes a new demand-driven technique that is able to identify both direct and indirect realizable data-dependencies between statements in the investigated code. Our method also involving control-dependencies and can thus be extended to perform precise forward and backward slicing of computer programs. The interprocedural algorithm presented considers realizable program paths when exploring individual definition-use chains by introducing backtrack information for traditional reaching definitions. Hence, our method is able to reveal deep and accurate information about very large programs on demand that makes it effectively applicable in either regression testing, debugging and program analysis

Published in:

Software Maintenance and Reengineering, 2002. Proceedings. Sixth European Conference on

Date of Conference: