Abstract
This paper presents a static analysis that computes quantitative information for recursive heap structures in programs with destructive updates. The algorithm targets tree structures and is able to extract quantitative information about the height and the balancing of such structures. We formulate the algorithm as a dataflow analysis. We use a heap abstraction that captures both shape invariants and quantities of heap structures. Then, we give a precise specification of the transfer functions that describe how each statement updates this abstraction. The algorithm is able to verify the correctness of re-balancing operations after AVL tree insertions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ball, T., Majumdar, R., Millstein, T., Rajamani, S.: Automatic predicate abstraction of C programs. In: Proceedings of the SIGPLAN 2001 Conference on Program Language Design and Implementation, Snowbird, UT (June 2001)
Ball, T., Rajamani, S.: Bebop: A symbolic model checker for boolean programs. In: Proceedings of the 7th International SPIN Workshop on Model Checking of Software, Stanford University, CA (August 2000)
Ball, T., Rajamani, S.: The SLAM project: Debugging system software via static analysis. In: Proceedings of the 29th Annual ACM Symposium on the Principles of Programming Languages, Portland, OR (January 2002)
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 (June 2003)
Dor, N., Rodeh, M., Sagiv, M.: Checking cleanness in linked lists. In: Proceedings of the 7th International Static Analysis Symposium, Santa Barbara, CA (July 2000)
Hickey, J., Nogin, A., Constable, R., Aydemir, B., Barzilay, E., Bryukhov, Y., Eaton, R., Granicz, A., Kopylov, A., Kreitz, C., Krupski, V., Lorigo, L., Schmitt, S., Witty, C., Yu, X.: MetaPRL – a modular logical environment. In: Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (September 2003)
Klarlund, N., Schwartzbach, M.: Graph types. In: Proceedings of the 20th Annual ACM Symposium on the Principles of Programming Languages, Charleston, SC (January 1993)
Kopylov, A.: Type Theoretical Foundations for Data Structures, Classes, and Objects. PhD thesis, Dept. of Computer Science, Cornell Univ., Ithaca, NY (January 2004)
Kuncak, V., Lam, P., Rinard, M.: Role analysis. In: Proceedings of the 29th Annual ACM Symposium on the Principles of Programming Languages, Portland, OR (January 2002)
Lev-ami, T., Reps, T., Sagiv, M., Wilhelm, R.: Putting static analysis to work for verification: A case study. In: 2000 International Symposium on Software Testing and Analysis (August 2000)
Moller, A., Schwartzbach, M.: The pointer assertion logic engine. In: Proceedings of the ACM Conference on Program Language Design and Implementation, Snowbird, UT (June 2001)
Anders Møller. MONA project home page, http://www.brics.dk/MONA
Reps, T., Sagiv, M., Loginov, A.: Finite differencing of logical formulas for static analysis. In: Proceedings of the 12th European Symposium on Programming, Warsaw, Poland (April 2003)
Rinetzky, N., Sagiv, M.: Interprocedural shape analysis for recursive programs. In: Proceedings of the 2001 International Conference on Compiler Construction, Genova, Italy (April 2001)
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 (January 1996)
Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. ACMTransactions on Programming Languages and Systems 20(1), 1–50 (1998)
Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24(3) (May 2002)
Wilhelm, R., Sagiv, M., Reps, T.: Shape analysis. In: Proceedings of the 2000 International Conference on Compiler Construction, Berlin, Germany (April 2000)
Yavuz-Kahveci, T., Bultan, T.: Automated verification of concurrent linked lists with counters. In: Proceedings of the 9th International Static Analysis Symposium, Madrid, Spain (September 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rugina, R. (2004). Quantitative Shape Analysis. In: Giacobazzi, R. (eds) Static Analysis. SAS 2004. Lecture Notes in Computer Science, vol 3148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27864-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-27864-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22791-5
Online ISBN: 978-3-540-27864-1
eBook Packages: Springer Book Archive