ABSTRACT
A general class of program analyses area combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems expressible naturally in a single constraint formalism, including such diverse applications as interprocedural dataflow analysis, precise type-based flow analysis, and pushdown model checking.
- A. Aiken, M. Fähndrich, J. Foster, and Z. Su. A toolkit for constructing type- and constraint-based program analyses. In Proc. of the Second International Workshop on Types in Compilation, 1998. Google Scholar
Digital Library
- A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The complexity of set constraints. In Proc. of the 7th Workshop on Computer Science Logic, pages 1--17. Springer-Verlag, 1994. Google Scholar
Digital Library
- R. Alur and P. Madhusudan. Visibly pushdown languages. In Proc. of the Symp. on Theory of Computing, pages 202--211, 2004. Google Scholar
Digital Library
- H. Chen, D. Dean, and D. Wagner. Model checking one million lines of C code. In Proc. of the 11th Annual Network and Distributed System Security Symp., pages 171--185, Feb4-6, 2004.Google Scholar
- H. Chen and D. Wagner. MOPS: An infrastructure for examining security properties of software. In Proc. of the 9th ACM Conf. on Computer and Communications Security, pages 235--244, 2002. Google Scholar
Digital Library
- M. Fähndrich and A. Aiken. Program analysis using mixed term and set constraints. In Proc. of the 4th International Symp. on Static Analysis, pages 114--126. Springer-Verlag, 1997. Google Scholar
Digital Library
- M. Fähndrich, J. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proc. of the Conf. on Programming Language Design and Implementation, pages 85--96, June 1998. Google Scholar
Digital Library
- M. Fähndrich, J. Rehof, and M. Das. From polymorphic subtyping to cfl reachability: Context-sensitive flow analysis using instantiation constraints. Technical Report MSR-TR-99-84, Microsoft Research, 1999.Google Scholar
- J. Foster, M. Fähndrich, and A. Aiken. Polymorphic versus Monomorphic Flow-insensitive Points-to Analysis for C. In Proc. of the Static Analysis Symposium, pages 175--198, June 2000. Google Scholar
Digital Library
- N. Heintze. Set Based Program Analysis. PhD dissertation, Carnegie Mellon University, Department of Computer Science, Oct. 1992. Google Scholar
Digital Library
- N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of c code in a second. In Proc. of the Conf. on Programming Language Design and Implementation, pages 254--263, 2001. Google Scholar
Digital Library
- S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In Proc. of the Symp. on Foundations of Software Engineering, pages 104--115. ACM Press, 1995. Google Scholar
Digital Library
- T. Jensen, D. L. Metayer, and T. Thorn. Verification of control flow based security properties. In Proc. of the 1999 IEEE Symp. on security and Privacy, 1999.Google Scholar
Cross Ref
- J. Kodumal. Banshee: A toolkit for constructing constraint-based analyses. http://banshee.sourceforge.net, 2005.Google Scholar
- J. Kodumal and A. Aiken. The set constraint/CFL reachability connection in practice. In Proc. of the Conf. on Programming Language Design and Implementation, pages 207--218, 2004. Google Scholar
Digital Library
- J. Kodumal and A. Aiken. Banshee: A scalable constraint-based analysis toolkit. In Proc. of the 12th International Static Analysis Symposium, pages 218--234, Sept. 2005. Google Scholar
Digital Library
- O. Lhoták and L. Hendren. Jedd: A BDD-based relational extension of Java. In Proc. of the Conf. on Programming Language Design and Implementation, 2004. Google Scholar
Digital Library
- Y. A. Liu, T. Rothamel, F. Yu, S. D. Stoller, and N. Hu. Parametric regular path queries. In Proc. of the Conf. on Programming Language Design and Implementation, 2004. Google Scholar
Digital Library
- A. Milanova and B. Ryder. Annotated inclusion constraints for precise flow analysis. In IEEE International Conf. on Software Maintenance, Sept. 2005. Google Scholar
Digital Library
- J. Palsberg. Efficient inference of object types. Information and Computation, (123):198--209, 1995. Google Scholar
Digital Library
- J. Rehof and M. Fähndrich. Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In Proc. of the Symp. on Principles of Programming Languages, pages 54--66, Jan. 2001. Google Scholar
Digital Library
- T. Reps. Undecidability of context-sensitive data-dependence analysis. In ACM Trans. Prorgram. Lang. Syst., volume 22, pages 162--186, 2000. Google Scholar
Digital Library
- T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of the Symp. on Principles of Programming Languages, pages 49--61, Jan. 1995. Google Scholar
Digital Library
- T. Reps, S. Schwoon, and S. Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. In Proc. 10th Int. Static Analysis Symp., pages 189--213, 2003. Google Scholar
Digital Library
- A. Rountev, A. Milanova, and B. Ryder. Points-to analysis for Java using annotated constraints. In Proc. of the Conf. on Object-Oriented Programming, Systems, Languages, and Applications, pages 43--55, 2001. Google Scholar
Digital Library
- M. Sridharan, D. Gopan, L. Shan, and R. Bodik. Demand-driven points-to analysis for Java. In Proc. of the Conf. on Object-Oriented Programs, Systems, Languages, and Applications, 2005. Google Scholar
Digital Library
- Z. Su, M. Fähndrich, and A. Aiken. Projection merging: Reducing redundancies in inclusion constraint graphs. In Proc. of the Symp. on Principles of Programming Languages, pages 81--95, 2000. Google Scholar
Digital Library
- J. Whaley and M. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proc. of the Conf. on Programming Language Design and Implementation, June 2004. Google Scholar
Digital Library
Index Terms
Regularly annotated set constraints
Recommendations
Regularly annotated set constraints
Proceedings of the 2007 PLDI conferenceA general class of program analyses area combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems ...
Set constraints with projections
Set constraints form a constraint system where variables range over the domain of sets of trees. They give a natural formalism for many problems in program analysis. Syntactically, set constraints are conjunctions of inclusions between expressions built ...
Context-sensitive data-dependence analysis via linear conjunctive language reachability
POPL '17Many program analysis problems can be formulated as graph reachability problems. In the literature, context-free language (CFL) reachability has been the most popular formulation and can be computed in subcubic time. The context-sensitive data-...







Comments