On inter-procedural analysis of programs with lists and data

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2011, Pages 578-589

  Bouajjani, Ahmed ^a   Drǎgoi, Cezara ^a   Enea, Constantin ^a   Sighireanu, Mihaela ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

assertion synthesis; dynamic data structures; interprocedural analysis

Indexed keywords

FORMAL LOGIC;

ABSTRACT DOMAINS; ASSERTION SYNTHESIS; AUTOMATIC SYNTHESIS; DYNAMIC DATA STRUCTURE; FIRST-ORDER FORMULAS; INFINITE DOMAINS; INTERPROCEDURAL ANALYSIS; MULTI-SETS; SEQUENTIAL PROGRAMS; SINGLY-LINKED LIST;

INTEGER PROGRAMMING;

EID: 79959878355     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993566     Document Type: Conference Paper

References (29)

1. D. Beyer, T.A. Henzinger, R. Majumdar, and A. Rybalchenko. Invariant synthesis for combined theories. In VMCAI, volume 4349 of LNCS, pages 378-394. Springer, 2007.
2. A. Bouajjani, C. Drǎgoi, C. Enea, A. Rezine, and M. Sighireanu. Invariant synthesis for programs manipulating lists with unbounded data. In CAV, volume 6174 of LNCS, pages 72-88. Springer, 2010.
3. C. Calcagno, D. Distefano, P.W. O'Hearn, and H. Yang. Compositional shape analysis by means of bi-abduction. In POPL, pages 289-300. ACM, 2009.
4. CEA. Frama-C Platform. htp://frama-c.com.
5. Celia plugin. http://www.liafa.jussieu.fr/celia.
6. B.-Y.E. Chang and X. Rival. Relational inductive shape analysis. In POPL, pages 247-260. ACM, 2008.
7. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238-252. ACM, 1977.
8. P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In IFIP Conf. on Formal Description of Programming Concepts, pages 237-277. North-Holland Publishing Company, 1977.
9. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL, pages 269-282. ACM, 1979.
10. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511-547, 1992.
11. A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In POPL, pages 157-168. ACM, 1990.
12. S. Gulwani, T. Lev-Ami, and S. Sagiv. A combination framework for tracking partition sizes. In POPL, pages 239-251. ACM, 2009.
13. S. Gulwani, B. McCloskey, and A. Tiwari. Lifting abstract interpreters to quantified logical domains. In POPL, pages 235-246. ACM, 2008.
14. A. Gupta, R. Majumdar, and A. Rybalchenko. From tests to proofs. In TACAS, volume 5505 of LNCS, pages 262-276. Springer, 2009.
15. N. Halbwachs and M. Péron. Discovering properties about arrays in simple programs. In PLDI, pages 339-348. ACM, 2008.
16. B. Jeannet. Fixpoint. http://gforge.inria.fr/.
17. B. Jeannet and A. Miné. Apron: A library of numerical abstract domains for static analysis. In CAV, volume 5643 of LNCS, pages 661-667. Springer, 2009.
18. R. Jhala and K.L. McMillan. Array abstractions from proofs. In CAV, volume 4590 of LNCS, pages 193-206. Springer, 2007.
19. R. Manevich, E. Yahav, G. Ramalingam, and S. Sagiv. Predicate abstraction and canonical abstraction for singly-linked lists. In VMCAI, volume 3385 of LNCS, pages 181-198. Springer, 2005.
20. B. McCloskey, T.W. Reps, and S. Sagiv. Statically inferring complex heap, array, and numeric invariants. In SAS, volume 6337 of LNCS, pages 71-99. Springer, 2010.
21. V. Perrelle and N. Halbwachs. An analysis of permutations in arrays. In VMCAI, volume 5944 of LNCS, pages 279-294, 2010.
22. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55-74. IEEE Computer Society, 2002.
23. N. Rinetzky, J. Bauer, T.W. Reps, S. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. In POPL, pages 296-309. ACM, 2005.
24. N. Rinetzky, S. Sagiv, and E. Yahav. Interprocedural shape analysis for cutpoint-free programs. In SAS, volume 3672 of LNCS, pages 284-302. Springer, 2005.
25. X. Rival and B.-Y.E. Chang. Calling context abstraction with shapes. In POPL, pages 173-186. ACM, 2011.
26. X. Rival and L. Mauborgne. The trace partitioning abstract domain. ACM Transactions on Programming Languages and Systems, 29, 2007.
27. S. Sagiv, T.W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3):217-298, 2002.
28. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, pages 189-234. New York University, 1981.
29. V. Vafeiadis. Shape-value abstraction for verifying linearizability. In VMCAI, volume 5403 of LNCS, pages 335-348. Springer, 2009.