A monadic slicing algorithm for a program with pointers

作者：Zhang Ying Zhou^*; Wu Zhong Qiang; Qian Ju; Zhang Wei Feng; Xu Bao Wen

来源：Chinese Journal of Computers, 2010, 33(3): 473-482.

DOI：10.3724/SP.J.1016.2010.00473

• Compositionality
• Current analysis
• Dataflow
• Pointer programs
• Program decomposition
• Program slicing
• Slicing algorithms
• Slicing methods

Program slicing is a family of program decomposition techniques. By introducing point-to analysis to the previous monadic slicing, the authors present and implement an approach of monadic slicing for a program with pointers. This approach obtains the point-to information through the data-flow iteration. Being different from the traditional methods, the point-to information and slicing are computed in the same phase in the method, by combining the forward monad slicing with data-flow iteration. Instead of recording point-to information for every statement, it is only needed to record the information for current analysis statements. So the method saves space without losing the precision. In addition, the approach also reserve the excellent properties of compositionality and language-flexibility from the original monadic slicing method.

• 出版日期2010
• 单位南京邮电大学