Shape analysis with inductive recursion synthesis

ACM SIGPLAN Notices

Volumn 42, Issue 6, 2007, Pages 256-265

  Guo, Bolei ^a   Vachharajani, Neil ^a   August, David I ^a  

^a Princeton University   (United States)

Author keywords

Artificial intelligence; Inductive recursion synthesis; Loop invariant inference; Separation logic; Shape analysis

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; DATA STRUCTURES; FORMAL LOGIC; SEPARATION;

COMPLEX DATA STRUCTURES; GENERIC ALGORITHM; INDUCTIVE PROGRAM SYNTHESIS; LOOP INVARIANTS; RECURSIONS; SEPARATION LOGIC; SHAPE ANALYSIS; STRUCTURAL SEPARATIONS;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 67650086661     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1273442.1250764     Document Type: Article

References (20)

1. D. R. Chase, M. Wegman, and F. K. Zadeck, "Analysis of pointers and structures," in Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, pp. 296-310, June 1990.
2. N. D. Jones and S. S. Muchnick, "Flow analysis and optimization of Lisp-like structures," in Program Flow Analysis: Theory and Applications (S. S. Muchnick and N. D. Jones, eds.), pp. 102-131, Englewood Cliffs, NJ: Prentice-Hall, 1981.
3. J. Reynolds, "Separation logic: A logic for shared mutable data structures," in Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, July 2002.
4. D. Distefano, P. W. O'Hearn, and H. Yang, "A local shape analysis based on separation logic," in Lecture Notes in Computer Science, vol. 3920, pp. 287-302, Springer-Verlag, 2006.
5. S. Magill, A. Nanevski, E. Clarke, and P. Lee, "Inferring invariants in separation logic for imperative list-processing programs," in Workshop on Semantics, Program Analysis, and Computing Environments for Memory Management (SPACE), January 2006.
6. O. Lee, H. Yang, and K. Yi, "Automatic verification of pointer programs using grammar-based shape analysis," in Prceedings of the 2005 European Symposium on Programming (ESOP), 2005.
7. P. Summers, "A methodology for Lisp program construction from examples," Journal ACM, vol. 24(1), pp. 162-175, 1977.
8. U. Schmid, Inductive synthesis of functional programs. Berlin, Germany: Springer-Verlag, 2003.
9. A. Mø and Schwartzbach, "The pointer assertion logic engine," in Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, pp. 221-231, 2001.
10. A. Gotsman, J. Berdine, and B. Cook, "Interprocedural shape analysis with separated heap abstractions," in Proceedings of the 13th International Static Analysis Symposium (SAS), August 2006.
11. N. Rinetzky, J., Bauer, T. Reps, M. Sagiv, and R. Wilhelm, "A semantics for procedure local heaps and its abstractions," in Proceedings of the 32nd ACM Symposium on Principles of Programming Languages, pp. 296-309, January 2005.
12. B. Guo, M. J. Bridges, S. Triantafyllis, G. Ottoni, E. Raman, and D. I. August, "Practical and accurate low-level pointer analysis," in Proceedings of the 3rd International Symposium on Code Generation and Optimization, March 2005.
13. J. Berdine, C. Calcagno, and P. W. O'Hearn, "Symbolic execution with separation logic," in Lecture Notes in Computer Science, vol. 3780, pp. 52-68, Springer-Verlag, 2005.
14. P. W. O'Hearn, H. Yang, and J. Reynolds, "Separation and information hiding," in Proceedings of the 31st ACM symposium on Principles of Programming Languages, pp. 268-280, January 2004.
15. J. Berdine, C. Calcagno, and P. W. O'Hearn, "A decidable fragment of separation logic," in Lecture Notes in Computer Science, vol. 3328, pp. 97-109, Springer-Verlag, 2004.
16. G. Tan and A. W. Appel, "A compositional logic for control filow," in Lecture Notes in Computer Science, vol. 3855, pp. 80-94, Springer-Verlag, 2006.
17. B. Steensgaard, "Points-to analysis by type inference in programs with structures and unions," in Lecture Notes in Computer Science, 1060, pp. 136-150, Springer-Verlag, 1996.
18. N. Rinetzky, M. Sagiv, and E. Yahav, "Interprocedural shape analysis for cutpoint-free programs," Tech. Rep. 26, Tel Aviv University, November 2004.
19. C. Calcagno, D. Distefano, P. W. O'Hearn, and H. Yang, "Beyong reachability: Shape abstraction in the presence of pointer arithmeetic," in Lecture Notes in Computer Science, vol. 4134, pp. 182-203, Springer-Verlag, 2006.
20. A. Loginov, T. Reps, and M. Sagiv, "Abstraction refinement via inductive learning," in Proceedings of the 17th International Conference on Computer Aided Verification, pp. 519-533, 2005.