Article

A semantics for procedure local heaps and its abstractions

Authors:

Reinhard WilhelmAuthors Info & Claims

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 296 - 309

https://doi.org/10.1145/1040305.1040330

Published: 12 January 2005 Publication History

Abstract

The goal of this work is to develop compile-time algorithms for automatically verifying properties of imperative programs that manipulate dynamically allocated storage. The paper presents an analysis method that uses a characterization of a procedure's behavior in which parts of the heap not relevant to the procedure are ignored. The paper has two main parts: The first part introduces a non-standard concrete semantics, LSL, in which called procedures are only passed parts of the heap. In this semantics, objects are treated specially when they separate the "local heap" that can be mutated by a procedure from the rest of the heap, which---from the viewpoint of that procedure---is non-accessible and immutable. The second part concerns abstract interpretation of LSL and develops a new static-analysis algorithm using canonical abstraction.

References

[1]

M. Bozga, R. Iosif, and Y. Laknech. Storeless semantics and alias logic. In Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, pages 55--65. ACM Press, 2003.]]

Digital Library

[2]

S. Chong and R. Rugina. Static analysis of accessed regions in recursive data structures. In SAS, 2003.]]

Digital Library

[3]

E. F. Codd. A relational model of data for large shared data banks. Communications of the ACM, 13(6):377--387, 1970.]]

Digital Library

[4]

P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., pages 269--282, New York, NY, 1979. ACM Press.]]

Digital Library

[5]

A. Deutsch. Operational Models of Programming Languages and Representations of Relations on Regular Languages with Application to the Static Determination of Dynamic Aliasing Properties of Data. PhD thesis, LIX, Ecole Polytechnique, F-91128, Palaiseau, France, 1992.]]

[6]

A. Deutsch. A storeless model for aliasing and its abstractions using finite representations of right-regular equivalence relations. In IEEE International Conference on Computer Languages, pages 2--13, Washington, DC, 1992. IEEE Press.]]

[7]

A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 230--241, New York, NY, 1994. ACM Press.]]

Digital Library

[8]

S. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In Symposium on Principles of Programming Languages, pages 14--26, 2001.]]

Digital Library

[9]

B. Jeannet, A. Loginov, T. Reps, and M. Sagiv. A relational approach to interprocedural shape analysis. In Static Analysis Symposium, 2004.]]

[10]

H.B.M. Jonkers. Abstract storage structures. In de~Bakker and van Vllet, editors, Algorithmic Languages, pages 321--343. IFIP, North Holland, 1981.]]

[11]

G. Kahn. Natural semantics. In 4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87, pages 22--39. Springer-Verlag, 1987.]]

Digital Library

[12]

W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural aliasing. In Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, pages 235--248. ACM Press, 1992.]]

Digital Library

[13]

T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In Proc. of the Int. Symp. on Software Testing and Analysis, pages 26--38, 2000.]]

Digital Library

[14]

F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer, 1999.]]

Digital Library

[15]

J. Reynolds. Separation logic: a logic for shared mutable data structures. In Logic in Computer Science, pages 55--74, 2002.]]

Digital Library

[16]

N. Rinetzky. Interprocedural shape analysis. Master's thesis, Technion Israel Institute of Technology, Haifa, Israel, 2001.]]

[17]

N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. Tech. Rep. 1, AVACS, September 2004. Available at "http://www.math.tau.ac.il/~maon".]]

[18]

N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. In Int. Conf. on Comp. Construct., pages 133--149, 2001.]]

Digital Library

[19]

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

Digital Library

[20]

A. Venet. Automatic analysis of pointer aliasing for untyped programs. Science of Computer Programming, 35(2):223--248, 1999.]]

Digital Library

Cited By

Kim SVenet AThakur A(2019)Deterministic parallel fixpoint computationProceedings of the ACM on Programming Languages10.1145/33710824:POPL(1-33)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371082
Malik VHruska MSchrammel PVojnar T(2018)Template-Based Verification of Heap-Manipulating Programs2018 Formal Methods in Computer Aided Design (FMCAD)10.23919/FMCAD.2018.8603009(1-9)Online publication date: Oct-2018
https://doi.org/10.23919/FMCAD.2018.8603009
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
Show More Cited By

Index Terms

A semantics for procedure local heaps and its abstractions
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
      1. Semantics
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
    2. Program semantics
      1. Operational semantics

Recommendations

A semantics for procedure local heaps and its abstractions
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

The goal of this work is to develop compile-time algorithms for automatically verifying properties of imperative programs that manipulate dynamically allocated storage. The paper presents an analysis method that uses a characterization of a procedure's ...
A relational approach to interprocedural shape analysis

This article addresses the verification of properties of imperative programs with recursive procedure calls, heap-allocated storage, and destructive updating of pointer-valued fields, that is, interprocedural shape analysis. The article makes three ...
Parametric shape analysis via 3-valued logic

Shape analysis concerns the problem of determining "shape invariants" for programs that perform destructive updating on dynamically allocated storage. This article presents a parametric framework for shape analysis that can be instantiated in different ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2005

402 pages

ISBN:158113830X

DOI:10.1145/1040305

General Chair:
Jens Palsberg
University of California, Los Angeles, CA
,
Program Chair:
Martín Abadi
University of California, Santa Cruz, CA

ACM SIGPLAN Notices Volume 40, Issue 1
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
January 2005
391 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1047659
Issue’s Table of Contents

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 January 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

POPL05

Sponsor:

POPL05: The 32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2005

January 12 - 14, 2005

California, Long Beach, USA

Acceptance Rates

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

89
Total Citations
View Citations
596
Total Downloads

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

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kim SVenet AThakur A(2019)Deterministic parallel fixpoint computationProceedings of the ACM on Programming Languages10.1145/33710824:POPL(1-33)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371082
Malik VHruska MSchrammel PVojnar T(2018)Template-Based Verification of Heap-Manipulating Programs2018 Formal Methods in Computer Aided Design (FMCAD)10.23919/FMCAD.2018.8603009(1-9)Online publication date: Oct-2018
https://doi.org/10.23919/FMCAD.2018.8603009
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
Krainz JPhilippsen M(2017)Diff Graphs for a fast Incremental Pointer AnalysisProceedings of the 12th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems10.1145/3098572.3098578(1-10)Online publication date: 19-Jun-2017
https://dl.acm.org/doi/10.1145/3098572.3098578
Kulkarni SMangal RZhang XNaik M(2016)Accelerating program analyses by cross-program trainingACM SIGPLAN Notices10.1145/3022671.298402351:10(359-377)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/3022671.2984023
Kulkarni SMangal RZhang XNaik MVisser ESmaragdakis Y(2016)Accelerating program analyses by cross-program trainingProceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2983990.2984023(359-377)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2983990.2984023
Kanvar VKhedker U(2016)Heap Abstractions for Static AnalysisACM Computing Surveys10.1145/293109849:2(1-47)Online publication date: 30-Jun-2016
https://dl.acm.org/doi/10.1145/2931098
Asăvoae Ide Boer FBonsangue MLucanu DRot J(2015)Model checking recursive programs interacting via the heapScience of Computer Programming10.1016/j.scico.2014.09.009100:C(61-83)Online publication date: 15-Mar-2015
https://dl.acm.org/doi/10.1016/j.scico.2014.09.009
Zhang XMangal RNaik MYang H(2014)Hybrid top-down and bottom-up interprocedural analysisACM SIGPLAN Notices10.1145/2666356.259432849:6(249-258)Online publication date: 9-Jun-2014
https://dl.acm.org/doi/10.1145/2666356.2594328
Zanardini DGenaim S(2014)Inference of Field-Sensitive Reachability and CyclicityACM Transactions on Computational Logic10.1145/262947815:4(1-41)Online publication date: 12-Sep-2014
https://dl.acm.org/doi/10.1145/2629478
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents