Modular static program analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2304, Issue , 2002, Pages 159-179

  Cousot, Patrick ^a   Cousot, Radhia ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS; STATIC ANALYSIS;

ABSTRACT INTERPRETATIONS; GLOBAL ANALYSIS; LOCAL ANALYSIS; SEPARATE ANALYSIS; STATIC PROGRAM ANALYSIS;

SEPARATION;

EID: 84959062828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45937-5_13     Document Type: Conference Paper

References (73)

1. G. Amato and F. Spoto. Abstract compilation for sharing analysis. In H. Kuchen and K. Ueda (eds), Proc. FLOPS 2001 Conf., LNCS 2024, 311-325. Springer, 2001.
2. th POPL, 25-37, San Diego, 1998. ACM Press.
3. B. Blanchet. Escape analysis for object-oriented languages: Application to Java. In Proc. ACM SIGPLAN Conf. OOPSLA '99. ACM SIGPLAN Not. 34(10), 1999.
4. th Int. Conf. CC '96, LNCS 1060, 192-207. Springer, 1996.
5. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In D. Bjørner, M. Broy, and I.V. Pottosin (eds), Proc. FMPA, LNCS 735, 128-141. Springer, 1993.
6. th POPL, 133-146, San Antonio, 1999. ACM Press.
7. R. Chatterjee, B.G. Ryder, and W. Landi. Relevant context inference. Tech. rep. DCS-TR-360, Rutgers University, 1999. ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-360.ps.Z.
8. th POPL, 451-464, Charleston, 1993. ACM Press.
9. st Int. Symp. SAS '94, LNCS 864, 281-296. Springer, 1994.
10. P. Colette and C.B. Jones. Enhancing the tractability of rely/guarantee specifications in the development of interfering operations. In G. Plotkin, C. Stirling, and M. Tofte (eds), Proof, Language and Interaction, ch. 10, 277-307. MIT Press, 2000.
11. P. Cousot. Méthodes itératives de construction et d’approximation de points fixes d’opérateurs monotones sur un treillis, analyse sémantique de programmes. Thèse d’État ès sciences mathématiques, Université scientifique et médicale de Grenoble, 21 Mar. 1978.
12. P. Cousot. Semantic foundations of program analysis. In S.S. Muchnick and N.D. Jones (eds), Program Flow Analysis: Theory and Applications, ch. 10, 303-342. Prentice-Hall, 1981.
13. P. Cousot. Methods and logics for proving programs. In J. van Leeuwen (ed), Formal Models and Semantics, vol. B of Handbook of Theoretical Computer Science, ch. 15, 843-993. Elsevier, 1990.
14. th POPL, 316-331, Paris, 1997. ACM Press.
15. P. Cousot. The calculational design of a generic abstract interpreter. In M. Broy and R. Steinbrüggen (eds), Calculational System Design, vol. 173, 421-505. NATO Science Series, Series F: Computer and Systems Sciences. IOS Press, 1999.
16. P. Cousot. Abstract interpretation based formal methods and future challenges, invited paper. In R. Wilhelm (ed), "Informatics - 10 Years Back, 10 Years Ahead", LNCS 2000, 138-156. Springer, 2000.
17. th POPL, 238-252, Los Angeles, 1977. ACM Press.
18. P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: mathematical foundations. In ACM Symposium on Artificial Intelligence & Programming Languages, ACM SIGPLAN Not. 12(8):1-12, 1977.
19. P. Cousot and R. Cousot. Static determination of dynamic properties of generalized type unions. In ACM Symposium on Language Design for Reliable Software, ACM SIGPLAN Not. 12(3):77-94, 1977.
20. P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In E.J. Neuhold (ed), IFIP Conf. on Formal Description of Programming Concepts, St-Andrews, CA, 237-277. North-Holland, 1977.
21. th POPL, 269-282, San Antonio, 1979. ACM Press.
22. P. Cousot and R. Cousot. Relational abstract interpretation of higher-order functional programs. Actes JTASPEFL '91, Bordeaux, FR. BIGRE, 74:33-36, 1991.
23. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. J. Logic Programming, 13(2-3):103-179, 1992. (The editor of J. Logic Programming has mistakenly published the unreadable galley proof. For a correct version of this paper, see http://www.di.ens.fr/~cousot.).
24. P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic and Comp., 2(4):511-547, Aug. 1992.
25. P. Cousot and R. Cousot. Galois connection based abstract interpretations for strictness analysis, invited paper. In D. Bjørner, M. Broy, and I.V. Pottosin (eds), Proc. FMPA, LNCS 735, 98-127. Springer, 1993.
26. th Int. Conf. CAV '95, LNCS 939, 293-308. Springer, 1995.
27. th FPCA, 170-181, La Jolla, 1995. ACM Press.
28. P. Cousot and R. Cousot. Introduction to abstract interpretation. Course notes for the "NATO Int. Summer School 1998 on Calculational System Design", Mark-toberdorff, 1998.
29. P. Cousot and R. Cousot. Abstract interpretation based program testing, invited paper. In Proc. SSGRR 2000 Computer & eBusiness International Conference, Compact disk paper 248 and electronic proceedings http://www.ssgrr.it/en/ssgrr2000/proceedings.htm, 2000. Scuola Superiore
30. th POPL, 178-190, Portland, 2002. ACM Press.
31. th POPL, 84-97, Tucson, 1978. ACM Press.
32. th Int. Symp. SAS '01, LNCS 2126, 259-277. Springer, 2001.
33. th Euro. Conf. ECOOP '95, LNCS 952, 77-101. Springer, 1995.
34. S.K. Debray and D.S. Warren. Automatic mode inference for logic programs. J. Logic Programming, 5(3):207-229, 1988.
35. M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proc. ACM SIGPLAN '93 Conf. PLDI. ACM SIGPLAN Not. 28(6), 242-256, 1994. ACM Press.
36. th Int. Symp. SAS '2000, LNCS 1824. Springer, 2000. Presentation available at URL http://www.cs.rice.edu:80/~matthias/Presentations/SAS.ppt.
37. th Int. Symp. SAS '2000, LNCS 1824, 135-154. Springer, 2000.
38. C. Flanagan and M. Felleisen. Componential set-based analysis. TOPLAS, 21(2):370-416, Feb. 1999.
39. th POPL, 193-205, London, Jan. 2001. ACM Press.
40. R.W. Floyd. Assigning meaning to programs. In J.T. Schwartz (ed), Proc. Symposium in Applied Mathematics, vol. 19, 19-32. AMS, 1967.
41. th POPL, 121-133, San Diego, Jan. 1998. ACM Press.
42. R. Giacobazzi. Abductive analysis of modular logic programs. In M. Bruynooghe (ed), Proc. Int. Symp. ILPS '1994, Ithaca, 377-391. MIT Press, 1994.
43. th Int. Symp. SAS '01, LNCS 2126, 356-373. Springer, 2001.
44. th Int. Coll. ICALP '97, LNCS 1256, 771-781. Springer, 1997.
45. R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. J. ACM, 47(2):361-416, 2000.
46. ème cycle d’informatique, Université scientifique et médicale de Grenoble, Grenoble, 12 Mar. 1979.
47. C. Hankin and D. Le Métayer. Lazy type inference and program analysis. Sci. Comput. Programming, 25(2-3):219-249, 1995.
48. st Int. ICSE Workshop on Testing Distributed Component-Based Systems. Los Angeles, 1999.
49. M.J. Harrold and M.L. Soffa. Efficient computation of interprocedural definitionuse chains. TOPLAS, 16(2):175-204, Mar. 1994.
50. M. Hind, M. Burke, P. Carini, and J.-D. Choi. Interprocedural pointer alias analysis. TOPLAS, 21(4):848-894, Jul. 1999.
51. th Int. Symp. SAS '98, LNCS 1503, 57-81. Springer, 1998.
52. S. Horwitz. Precise flow-insensitive may-alias analysis is NP-hard. TOPLAS, 19(1):1-6, Jan. 1997.
53. th POPL, 329-341, San Diego, Jan. 1998. ACM Press.
54. N. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Int. Series in Computer Science. Prentice-Hall, June 1993.
55. th POPL, 17-32, Portland, Jan. 2002. ACM Press.
56. W.A. Landi. Undecidability of static analysis. ACM Lett. Prog. Lang. Syst., 1(4):323-337, Dec. 1992.
57. O. Lee and K. Yi. A proof method for the correctness of modularized kCFAs. Technical Memorandum ROPAS-2000-9, Research On Program Analysis System, Korea Advanced Institute of Science and Technology, Nov. 2000. http://ropas.kaist.ac.kr/~cookcu/paper/tr2000b.ps.gz.
58. D. Liang and M.J. Harrold. Efficient points-to analysis for whole-program analysis. In O. Nierstrasz and M. Lemoine (eds), Software Engineering - ESEC/FSE’99, 7th European Software Engineering Conference, LNCS 1687, 199-215, 1999.
59. th Int. Symp. SAS '01, LNCS 2126, 279-298. Springer, 2001.
60. F. Malésieux, O. Ridoux, and P. Boizumault. Abstract compilation of Lambda-Prolog. In J. Jaffar (ed), JICSLP '98, Manchester, 130-144. MIT Press, 1992.
61. nd Symp. PADO '2001, LNCS 2053, 155-172. Springer, 2001.
62. L. Mauborgne. Abstract interpretation using typed decision graphs. Sci. Comput. Programming, 31(1):91-112, May 1998.
63. nd Symp. PADO '2001, LNCS 2053, 155-172. Springer, 2001.
64. G. Ramalingam. The undecidability of aliasing. TOPLAS, 16(5):1467-1471, Sep. 1994.
65. F. Randimbivololona, J. Souyris, and A. Deutsch. Improving avionics software verification cost-effectiveness: Abstract interpretation based technology contribution. In Proceedings DASIA 2000-DAtaSystems In Aerospace, Montreal. ESA Publications, May 2000.
66. A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. In Proc. ACM SIGPLAN '00 Conf. PLDI. ACM SIGPLAN Not. 35(5), 47-56, Vancouver, June 2000.
67. th Int. Conf. CC '2001, LNCS 2027, 20-36. Springer, 2001.
68. A. Rountev, B.G. Ryder, and W. Landi. Data-flow analysis of program fragments. In O. Nierstrasz and M. Lemoine (eds), Software Engineering - ESEC/FSE’99, 7th European Software Engineering Conference, LNCS 1687, 235-252. Springer, 1999.
69. B.G. Ryder, W. Landi, P.A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural side effect analysis with pointer aliasing. TOPLAS, 2002. To appear.
70. O. Shivers. The semantics of scheme control-flow analysis. In P. Hudak and N.D. Jones (eds), Proc. PEPM '91, ACM SIGPLAN Not. 26(9), 190-198. ACM Press, Sep. 1991.
71. Y.M. Tang and P. Jouvelot. Separate abstract interpretation for control-flow analysis. In M. Hagiya and J.C. Mitchell (eds), Proc. Int. Conf. TACS’95, LNCS 789, 224-243. Springer, 1994.
72. A. Venet. Automatic analysis of pointer aliasing for untyped programs. Sci. Comput. Programming, Special Issue on SAS’96, 35(1):223-248, Sep. 1999.
73. th ESOP '2001, LNCS 2028, 335-351. Springer, 2001.