Abstract: The main issues of inclusionbased pointer analysis are the limitation of inclusion constraints language limitation and the simplification of constraint graph. Aiming the above shortcoming, this paper proposes a pointer analysis algorithm based on inclusion constraint language. Firstly, the language of inclusion constraints is extended such that it is no longer confined to several basic forms, and the rules of constraint propagation are given. Then, a constraint graph is constructed at a time, in which there are not the complex edges and the whole process of analysis is changed into static from dynamic. Finally, an algorithm is given to analyze the simplified constraint graph such that the pointer's information is obtained. Experiment results show that the new algorithm can accurately analyze any level of dereferenced pointsto information of a pointer.