Article

Free access

Proving assertions about programs that manipulate data structures

Authors:

Derek C. Oppen,

Stephen A. CookAuthors Info & Claims

STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computing

Pages 107 - 116

https://doi.org/10.1145/800116.803758

Published: 05 May 1975 Publication History

PDF eReader

Abstract

In this paper we wish to consider the problem of proving assertions about programs that construct and alter data structures. Our method will be to define a suitable assertion language L for data structures, to define a simple programming language L' for constructing and altering data structures, to give axioms and rules of inference (in the style of [Hoare 1969]) which specify the effect of program segments on data structures (described by formulas in L) and finally to prove that these axioms are correct (relative to a formal definition of the semantics of L') and, in a reasonable sense, complete. Thus our intention is to provide a complete theoretical framework for describing arbitrary data structures and proving assertions about programs that manipulate them.

References

[1]

Burstall, R.M. Some Techniques for Proving Correctness of Programs which Alter Data Structures. Machine Intelligence 7, 1972.

Google Scholar

[2]

Cook, S.A. Axiomatic and Interpretive Semantics for an Algol Fragment. Technical Report No. 79, Dept. of Computer Science, University of Toronto, February 1975.

Google Scholar

[3]

Cook, S.A. and Oppen, D.C. An Assertion Language for Data Structures. Proceedings of the Second ACM Symposium on Principles of Programming Languages, January 1975.

Digital Library

Google Scholar

[4]

Hoare, C.A.R. An Axiomatic Basis for Computer Programming. Communications of the ACM, October 1969, pp. 576-583.

Digital Library

Google Scholar

[5]

Hoare, C.A.R. and Lauer, P.E. Consistent and Complementary Formal Theories of the Semantics of Programming Languages. Acta Informatica 3, 1974, pp. 135-153.

Digital Library

Google Scholar

[6]

Igarashi, S., London, R. and Luckham, D. Automatic Program Verification I: A Logical Basis and its Implementation. AI Memo AIM-200, Stanford University, May 1973.

Digital Library

Google Scholar

[7]

Kowaltowski, T. Correctness of Programs Manipulating Data Structures. Memorandum No. ERL-M404, Electronics Research Laboratory, University of California, Berkeley, September 1973.

Google Scholar

[8]

Lauer, P. Consistent Formal Theories of the Semantics of Programming Languages. Techincal Report TR 25.121, IBM Vienna, November 1971.

Google Scholar

[9]

Laventhal, M.S. Verification of Programs Operating on Structured Data. M.Sc. Thesis, M.I.T., February 1974.

Google Scholar

[10]

Morris, J.H. Verification Oriented Language Design. Technical Report 7, Dept. of Computer Science, University of California, Berkeley, December 1972.

Google Scholar

[11]

Oppen, D.C. On Logic and Program Verification. Ph.D. Thesis, University of Toronto, to appear 1975.

Digital Library

Google Scholar

[12]

Rosenberg, A.L. Data Graphs and Addressing Schemes. Journal of Computer and System Sciences, June 1971, pp. 193-238.

Digital Library

Google Scholar

[13]

Standish, T.A. Data Structures: An Axiomatic Approach. Automatic Programming Memo 3, Bolt, Beranek and Newman Inc., August 1973.

Google Scholar

Cited By

View all

Ishtiaq SO'Hearn P(2011)BI as an assertion language for mutable data structuresACM SIGPLAN Notices10.1145/1988042.198805046:4(84-96)Online publication date: 20-May-2011
https://dl.acm.org/doi/10.1145/1988042.1988050
Conway CBarrett C(2010)Verifying low-level implementations of high-level datatypesProceedings of the 22nd international conference on Computer Aided Verification10.1007/978-3-642-14295-6_28(306-320)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-14295-6_28
Ray SRay S(2010)Connecting Different Proof StylesScalable Techniques for Formal Verification10.1007/978-1-4419-5998-0_6(81-92)Online publication date: 19-Apr-2010
https://doi.org/10.1007/978-1-4419-5998-0_6
Show More Cited By

Index Terms

Recommendations

Exploiting PSL standard assertions in a theorem-proving-based verification environment
GLSVLSI '05: Proceedings of the 15th ACM Great Lakes symposium on VLSI

Assertion-based design is becoming more widely used in industry. However, little has been done to take advantage of existing design assertions in the theorem-proving verification environments. In this paper, we present our work on development of the ...
Finding Invariant assertions for proving programs
Proceedings of the international conference on Reliable software

We attempt to extract from any program loop its “Most General Invariant” in order to either prove its correctness, including termination, or disprove it and propose corrections.
Proving assertions about parallel programs

A simple but general parallel programming language is considered. The semantics of programs is defined in a concise and natural way using relations. ''Verification conditions'' derived from the semantic definitions enable Floyd's method of proving ...

Comments

Information & Contributors

Information

Published In

STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computing

May 1975

265 pages

ISBN:9781450374194

DOI:10.1145/800116

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 May 1975

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

STOC '75 Paper Acceptance Rate 31 of 87 submissions, 36%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
120
Total Downloads

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

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ishtiaq SO'Hearn P(2011)BI as an assertion language for mutable data structuresACM SIGPLAN Notices10.1145/1988042.198805046:4(84-96)Online publication date: 20-May-2011
https://dl.acm.org/doi/10.1145/1988042.1988050
Conway CBarrett C(2010)Verifying low-level implementations of high-level datatypesProceedings of the 22nd international conference on Computer Aided Verification10.1007/978-3-642-14295-6_28(306-320)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-14295-6_28
Ray SRay S(2010)Connecting Different Proof StylesScalable Techniques for Formal Verification10.1007/978-1-4419-5998-0_6(81-92)Online publication date: 19-Apr-2010
https://doi.org/10.1007/978-1-4419-5998-0_6
Ray SHunt WMatthews JMoore J(2008)A Mechanical Analysis of Program Verification StrategiesJournal of Automated Reasoning10.1007/s10817-008-9098-140:4(245-269)Online publication date: 1-May-2008
https://dl.acm.org/doi/10.1007/s10817-008-9098-1
Tiuryn J(2005)A simple programming language with data types: semantics and verificationLogics of Programs10.1007/3-540-15648-8_29(387-405)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-15648-8_29
Calcagno CO'Hearn PBornat R(2003)Program logic and equivalence in the presence of garbage collectionTheoretical Computer Science10.1016/S0304-3975(02)00868-X298:3(557-581)Online publication date: 11-Apr-2003
https://dl.acm.org/doi/10.1016/S0304-3975%2802%2900868-X
Ishtiaq SO'Hearn P(2001)BI as an assertion language for mutable data structuresACM SIGPLAN Notices10.1145/373243.37571936:3(14-26)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.1145/373243.375719
Ishtiaq SO'Hearn PHankin CSchmidt D(2001)BI as an assertion language for mutable data structuresProceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/360204.375719(14-26)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.1145/360204.375719
Calcagno CO’Hearn P(2001)On Garbage and Program LogicFoundations of Software Science and Computation Structures10.1007/3-540-45315-6_9(137-151)Online publication date: 23-Mar-2001
https://doi.org/10.1007/3-540-45315-6_9
Calcagno CIshtiaq SO'Hearn PGabbrielli M(2000)Semantic analysis of pointer aliasing, allocation and disposal in Hoare logicProceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/351268.351291(190-201)Online publication date: 1-Sep-2000
https://dl.acm.org/doi/10.1145/351268.351291
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Exploiting PSL standard assertions in a theorem-proving-based verification environment

Finding Invariant assertions for proving programs

Proving assertions about parallel programs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Exploiting PSL standard assertions in a theorem-proving-based verification environment

Finding Invariant assertions for proving programs

Proving assertions about parallel programs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations