1. Typestate verification: Abstraction techniques and complexity results;Field;Sci. Comput. Programming,2005
2. Affine relationships among variables of a program;Karr;Acta Inform.,1976
3. M. Müller-Olm, H. Seidl, Precise interprocedural analysis through linear algebra, in: POPL '04: Proceedings of the 31st ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages, pp. 330–341.
4. R. Muth, S.K. Debray, On the complexity of flow-sensitive dataflow analyses, in: POPL '00: Proceedings of the 27th ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages, pp. 67–80.
5. W. Landi, B. Ryder, Pointer-induced aliasing: A problem classification, in: POPL '91: Proceedings of the 18th ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages, pp. 93–103.