Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- The right algorithm at the right time: comparing data flow analysis algorithms for finite state verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Client-Driven Pointer AnalysisLecture Notes in Computer Science, 2003
- Implementation techniques for efficient data-flow analysis of large programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Flow-sensitive type qualifiersPublished by Association for Computing Machinery (ACM) ,2002
- Which pointer analysis should I use?Published by Association for Computing Machinery (ACM) ,2000
- An annotation language for optimizing software librariesPublished by Association for Computing Machinery (ACM) ,1999
- Assessing the Effects of Flow-Sensitivity on Pointer Alias AnalysesLecture Notes in Computer Science, 1998
- Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effectsPublished by Association for Computing Machinery (ACM) ,1993
- Automatic construction of sparse data flow evaluation graphsPublished by Association for Computing Machinery (ACM) ,1991
- Node listings for reducible flow graphsPublished by Association for Computing Machinery (ACM) ,1975