作者: Eugene J. Rollins , Daniel Jackson
DOI:
关键词: Slicing 、 Algorithm 、 Single node 、 Program slicing 、 Graph 、 Modular design 、 Theoretical computer science 、 Computer science
摘要: A new method for extracting partial representations of a program is described. Given two sets variable instances, source and sink, graph constructed showing the statements that cause definitions to affect uses sink. This criterion can express wider range queries than various forms slice criteria, which it subsumes as special cases. On standard (backward slicing from use or definition) produces better reults existing algorithms. The modular. By treating all abstractly def-use relations, present procedure call simple statement, so appears in single node whose role may be understood without looking beyond context call.