Article

Maintaining doubly-linked list invariants in shape analysis with local reasoning

Authors:

Sigmund Cherem,

Radu RuginaAuthors Info & Claims

VMCAI'07: Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation

Pages 234 - 250

Published: 14 January 2007 Publication History

Abstract

This paper presents a novel shape analysis algorithm with local reasoning that is designed to analyze heap structures with structural invariants, such as doubly-linked lists. The algorithm abstracts and analyzes one single heap cell at a time. In order to maintain the structural invariants, the analysis uses a local heap abstraction that models the sub-heap consisting of one cell and its immediate neighbors. The proposed algorithm can successfully analyze standard doubly-linked list manipulations.

References

[1]

Wilhelm, R., Sagiv, M., Reps, T.: Shape analysis. In: Proceedings of the 2000 International Conference on Compiler Construction, Berlin, Germany (2000).

Digital Library

[2]

Lev-ami, T., Reps, T., Sagiv, M., Wilhelm, R.: Putting static analysis to work for verification: A case study. In: Proceedings of the 2000 International Symposium on Software Testing and Analysis. (2000).

Digital Library

[3]

Ghiya, R., Hendren, L., Zhu, Y.: Detecting parallelism in C programs with recursive data structures. In: Proceedings of the 1998 International Conference on Compiler Construction, Lisbon, Portugal (1998).

Digital Library

[4]

Hackett, B., Rugina, R.: Region-based shape analysis with tracked locations. In: Proceedings of the 32th Annual ACM Symposium on the Principles of Programming Languages, Long Beach, CA (2005).

Digital Library

[5]

Cherem, S., Rugina, R.: Compile-time deallocation of individual objects. In: Proceedings of the International Symposium on Memory Management, Ottawa, Canada (2006).

Digital Library

[6]

Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems 20(1) (1998) 1-50.

Digital Library

[7]

Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24(3) (2002).

Digital Library

[8]

Rinetzky, N., Sagiv, M., Yahav, E.: Interprocedural shape analysis for cutpoint-free programs. In: Proceedings of the 12th International Static Analysis Symposium, London, UK (2005).

Digital Library

[9]

Distefano, D., O'Hearn, P., Yang, H.: A local shape analysis based on separation logic. In: Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Vienna, Austria (2006).

Digital Library

[10]

Gotsman, A., Berdine, J., Cook, B.: Interprocedural shape analysis with separated heap abstractions. In: The 13th International Static Analysis Symposium, Seoul, Korea (2006).

Digital Library

[11]

Cherem, S., Rugina, R.: Maintaining structural invariants in shape analysis with local reasoning. TR CS TR2006-2048, Cornell University (2006).

[12]

Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Proceedings of the 7th International Static Analysis Symposium, Santa Barbara, CA (2000).

Digital Library

[13]

Jones, N., Muchnick, S.: Flow analysis and optimization of Lisp-like structures. In: Conference Record of the 6th Annual ACM Symposium on the Principles of Programming Languages, San Antonio, TX (1979).

Digital Library

[14]

Chase, D., Wegman, M., Zadek, F.: Analysis of pointers and structures. In: Proceedings of the SIGPLAN '91 Conference on Program Language Design and Implementation, White Plains, NY (1990).

Digital Library

[15]

Hendren, L., Nicolau, A.: Parallelizing programs with recursive data structures. IEEE Transactions on Parallel and Distributed Systems 1(1) (1990) 35-47.

Digital Library

[16]

Hendren, L., Hummel, J., Nicolau, A.: A general data dependence test for dynamic, pointer-based data structures. In: Proceedings of the SIGPLAN '94 Conference on Program Language Design and Implementation, Orlando, FL (1994).

Digital Library

[17]

Deutsch, A.: Interprocedural may-alias analysis for pointers: Beyond k-limiting. In: Proceedings of the SIGPLAN '94 Conference on Program Language Design and Implementation, Orlando, FL (1994).

Digital Library

[18]

Ghiya, R., Hendren, L.: Is is a tree, a DAG or a cyclic graph? A shape analysis for heap-directed pointers in C. In: Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, St. Petersburg Beach, FL (1996).

Digital Library

[19]

Chong, S., Rugina, R.: Static analysis of accessed regions in recursive data structures. In: Proceedings of the 10th International Static Analysis Symposium, San Diego, CA (2003).

Digital Library

[20]

Rugina, R.: Quantitative shape analysis. In: Proceedings of the 11th International Static Analysis Symposium, Verona, Italy (2004).

[21]

Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. In: Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, St. Petersburg Beach, FL (1996).

Digital Library

[22]

Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: Proceedings of the 26th Annual ACM Symposium on the Principles of Programming Languages, San Antonio, TX (1999).

Digital Library

[23]

Rinetzky, N., Sagiv, M.: Interprocedural shape analysis for recursive programs. In: Proceedings of the 2001 International Conference on Compiler Construction, Genova, Italy (2001).

Digital Library

[24]

Moller, A., Schwartzbach, M.: The pointer assertion logic engine. In: Proceedings of the SIGPLAN '01 Conference on Program Language Design and Implementation, Snowbird, UT (2001).

Digital Library

[25]

McPeak, S., Necula, G.: Data structure specification via local equality axioms. In: Proceedings of the 2005 Conference on Computer-Aided Verification, Seattle, WA (2005).

Digital Library

[26]

Lahiri, S., Qadeer, S.: Verifying properties of well-founded linked lists. In: Proceedings of the 33th Annual ACM Symposium on the Principles of Programming Languages, Charleston, SC (2006).

Digital Library

[27]

Ball, T., Majumdar, R., Millstein, T., Rajamani, S.: Automatic predicate abstraction of C programs. In: Proceedings of the SIGPLAN '01 Conference on Program Language Design and Implementation, Snowbird, UT (2001).

Digital Library

[28]

Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis by predicate abstraction. In Cousot, R., ed.: VMCAI. Volume 3385 of Lecture Notes in Computer Science., Springer (2005) 164-180.

Digital Library

[29]

Dams, D., Namjoshi, K.S.: Shape analysis through predicate abstraction and model checking. In Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S., eds.: VMCAI. Volume 2575 of Lecture Notes in Computer Science., Springer (2003) 310-324.

Digital Library

[30]

Bingham, J.D., Rakamaric, Z.: A logic and decision procedure for predicate abstraction of heap-manipulating programs. In Emerson, E.A., Namjoshi, K.S., eds.: VMCAI. Volume 3855 of Lecture Notes in Computer Science., Springer (2006) 207-221.

Digital Library

[31]

Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, Copenhagen, Denmark (2002).

Digital Library

[32]

Ishtiaq, S., O'Hearn, P.: BI as an assertion language for mutable data structures. In: Proceedings of the 28th Annual ACM Symposium on the Principles of Programming Languages, London, UK (2001).

Digital Library

Cited By

Karkare AHaddad HWainwright RChbeir R(2018)TwASProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167330(1857-1864)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167330
Backes PReineke J(2015)Analysis of Infinite-State Graph Transformation Systems by Cluster AbstractionProceedings of the 16th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 893110.1007/978-3-662-46081-8_8(135-152)Online publication date: 12-Jan-2015
https://dl.acm.org/doi/10.1007/978-3-662-46081-8_8
Dasgupta SKarkare AOssowski SLecca P(2012)Precise shape analysis using field sensitivityProceedings of the 27th Annual ACM Symposium on Applied Computing10.1145/2245276.2231982(1300-1307)Online publication date: 26-Mar-2012
https://dl.acm.org/doi/10.1145/2245276.2231982
Show More Cited By

Maintaining doubly-linked list invariants in shape analysis with local reasoning
1. Theory of computation
  1. Semantics and reasoning

Recommendations

O(1)-time unsorting by prefix-reversals in a boustrophedon linked list
FUN'10: Proceedings of the 5th international conference on Fun with algorithms

Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A boustrophedon linked list is a doubly-linked list, except that each node ...
Doubly Linked List
Shape ellipticity from Hu moment invariants

In this paper we derive an explicit formula which uses the first two Hu moment invariants to compute a shape ellipticity measure, i.e. to evaluate how much a planar shape differs from an ellipse. The ellipticity measure computed by this formula is ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

VMCAI'07: Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation

January 2007

395 pages

ISBN:9783540697350

Editors:
Byron Cook
Microsoft Research, Cambridge, United Kingdom
,
Andreas Podelski
University of Freiburg, Freiburg, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 14 January 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Karkare AHaddad HWainwright RChbeir R(2018)TwASProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167330(1857-1864)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167330
Backes PReineke J(2015)Analysis of Infinite-State Graph Transformation Systems by Cluster AbstractionProceedings of the 16th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 893110.1007/978-3-662-46081-8_8(135-152)Online publication date: 12-Jan-2015
https://dl.acm.org/doi/10.1007/978-3-662-46081-8_8
Dasgupta SKarkare AOssowski SLecca P(2012)Precise shape analysis using field sensitivityProceedings of the 27th Annual ACM Symposium on Applied Computing10.1145/2245276.2231982(1300-1307)Online publication date: 26-Mar-2012
https://dl.acm.org/doi/10.1145/2245276.2231982
Qi XMyers A(2009)Masked types for sound object initializationACM SIGPLAN Notices10.1145/1594834.148089044:1(53-65)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1594834.1480890
Qi XMyers AShao ZPierce B(2009)Masked types for sound object initializationProceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1480881.1480890(53-65)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1480881.1480890
Chang BRival X(2008)Relational inductive shape analysisACM SIGPLAN Notices10.1145/1328897.132846943:1(247-260)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328897.1328469
Chang BRival XNecula GWadler P(2008)Relational inductive shape analysisProceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1328438.1328469(247-260)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328438.1328469
Chang BRival XNecula G(2007)Shape analysis with structural invariant checkersProceedings of the 14th international conference on Static Analysis10.5555/2391451.2391477(384-401)Online publication date: 22-Aug-2007
https://dl.acm.org/doi/10.5555/2391451.2391477

View Options

View options

Figures

Tables

Media

View Table of Conten