Abstract
The techniques used to implement (non-trivial) interprocedural data flow analyzers can be generally divided into two subsets: the call string approach and the functional approach as presented in [Sharir and Pnueli, 1981]. Both differ in time and space complexity as well as in precision due to properties of the abstract domains and transfer functions. We have developed a data flow analyzer generator PAG which is able to produce interprocedural analyzers for both techniques. We specified two variants of constant propagation working in an ANSI-C compiler; a copy constant propagation that uses distributive transfer function and can be solved precisely, even interprocedurally [Sagiv et al., 1995], and a full constant propagator which includes an interpreter for expressions of the language. We present the practical relevant results applying both analyzers to a fair set of real-world programs and compare the space/time consumption of the analyzers versus their precision.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
