Pointer analysis has been a long-standing problem in program analysis with applications in compiler optimization, refactoring and security analysis. Several techniques of pointer analysis have been proposed in the recent literature, most of them don’t consider recursive function calls to ensure termination. To overcome this, majority of the analysis merge the strongest connected components in a points-to graph, thus making the analysis imprecise. To represent an infinite state transition system in a finite state, we use Push Down system, a technique used in model checking to represent inter-procedural control flow. Push Down system has been extensively studied and applied to modeling control flow recursive programs. Earlier formulation for slicing has shown its use in modeling data flow and filtering out inter-procedurally invalid paths. However, this becomes non-trivial to apply if there is an interplay of two different contexts. In this paper, we provide an approach to model PDS with two different contexts and apply it pointer analysis. Herewith, we propose a field-sensitive, call site-sensitive pointer analysis as reachability problem over a pushdown system.