By Topic

Computing executable slices for concurrent logic programs

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
$33 $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

3 Author(s)
J. Zhao ; Dept. of Comput. Sci. & Eng., Fukuoka Inst. of Technol., Japan ; J. Cheng ; K. Ushijima

Program slicing has many applications in software engineering activities. However, until recently, no slicing algorithm has been presented that can compute executable slices for concurrent logic programs. We present a dependence-graph based approach to computing executable slices for concurrent logic programs. The dependence-based representation used in the paper is called the Argument Dependence Net which can be used to explicitly represent various types of program dependences in a concurrent logic program. Based on the ADN, we can compute static executable slices for concurrent logic programs at argument level

Published in:

Quality Software, 2001. Proceedings.Second Asia-Pacific Conference on

Date of Conference: