Modular monadic slicing in the presence of pointers

Authors:
Zhongqiang Wu;Yingzhou Zhang;Baowen Xu
Affiliations:
Dep. of Computer Science and Engineering, Southeast Univ., Nanjing, China;College of Computer, Nanjing Univ. of Posts and Telecommunications, Nanjing, China;Dep. of Computer Science and Engineering, Southeast Univ., Nanjing, China
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Year:
2006

Citing 8
Cited 0

Dependence analysis for pointer variables

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Comprehending monads

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers

LCPC '94 Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing
Forward Dynamic Object-Oriented Program Slicing

ASSET '99 Proceedings of the 1999 IEEE Symposium on Application - Specific Systems and Software Engineering and Technology
Modular Monadic Program Slicing

COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program slicing is a family of program decomposition techniques. For traditional slicing methods lack modularity and flexibility, we have proposed a new formal method for program slicing—modular monadic slicing. This paper presents an approach to extend the modular monadic slicing for handling pointers. With the inspiration of forward program slicing, our approach obtains the point-to information through the data-flow iteration. By combining the forward monad slicing with data-flow iteration, our method computes the point-to information and slices the program in the same phase. So our approach has the same precision as traditional data-flow iteration methods, but needs less space. In addition, our approach also inherits the properties of language independence and reusability from the original monadic slicing method.