Article

A type system for resource protocol verification and its correctness proof

Authors:

Corneliu Popeea,

Wei-Ngan ChinAuthors Info & Claims

PEPM '04: Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Pages 135 - 146

https://doi.org/10.1145/1014007.1014021

Published: 24 August 2004 Publication History

Abstract

We present a new method, based on a form of dependent typing, to verify the correct usage of resources in a program. Our approach allows complex resources to be specified, whose properties are captured by annotated types and conditions on invariance and final states. The protocol itself is specified through a set of pre-defined methods, whose pre-condition and post-condition together, enforce the correct temporal usage of each resource type. We design a simple language together with a type system that shows how resource protocol verification can be achieved. We formalise an operational semantics for the language and provide a correctness proof which confirms that well-typed programs conform to the specified protocol of each resource type.

References

[1]

Martín Abadi and Bruno Blanchet. Computer-Assisted Verification of a Protocol for Certified Email. In Radhia Cousot, editor, Proceedings of the International Static Analysis Symposium (SAS), volume 2694 of Lecture Notes on Computer Science, pages 316--335, San Diego, California, June 2003. Springer Verlag.]]

Digital Library

[2]

J. Aldrich, V. Kostadinov, and C. Chambers. Alias Annotation for Program Understanding. In Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA), Seattle, Washington, November 2002.]]

Digital Library

[3]

Hugh Anderson and Siau-Cheng Khoo. Affine-based size-change termination. In Proceedings of the Asian Symposium on Programming Languages and Systems (APLAS), June 2003.]]

[4]

Thomas Ball and Sriram K. Rajamani. The SLAM project: debugging system software via static analysis. In Proceedings of the ACM Symposium on the Principles of Programming Languages (POPL), pages 1--3. ACM Press, 2002.]]

Digital Library

[5]

E. C. Chan, J. Boyland, and W. L. Scherlis. Promises: Limited Specifications for Analysis and Manipulation. In Proceedings of the IEEE International Conference on Software Engineering (ICSE), pages 167--176, Kyoto, Japan, April 1998.]]

Digital Library

[6]

W.N. Chin and S.C. Khoo. Calculating sized types. In Proceedings of the ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), pages 62--72, Boston, Massachusetts, United States, January 2000.]]

Digital Library

[7]

W.N. Chin, S.C. Khoo, and S.C. Qin. A Sized Type System for Objects with Alias Controls. Technical report, SoC, Natl Univ. of Singapore, January 2004. avail. at http://www.comp.nus.edu.sg/~qinsc/papers/sizedtype.ps.gz.]]

[8]

W.N. Chin, S.C. Khoo, and Dana N. Xu. Deriving pre-conditions for array bound check elimination. In Programs as Data Objects II, pages 2--24, Aarhus, Denmark, May 2001. Springer Verlag.]]

Digital Library

[9]

Thomas Colcombet and Pascal Fradet. Enforcing trace properties by program transformation. In Proceedings of the ACM Symposium on the Principles of Programming Languages (POPL), January 2000.]]

Digital Library

[10]

Manuvir Das, Sorin Lerner, and Mark Seigle. ESP: path-sensitive program verification in polynomial time. In Proceedings of the ACM Symposium on Programming Language Design and Implementation (PLDI), June 2002.]]

Digital Library

[11]

Robert DeLine and Manuel Fahndrich. Enforcing high-level protocols in low-level software. In Proceedings of the ACM Symposium on Programming Language Design and Implementation (PLDI), June 2001.]]

Digital Library

[12]

Amy P. Felty, Douglas J. Howe, and Frank A. Stomp. Protocol verification in Nuprl. In Tenth International Conference on Computer Aided Verification, pages 428--439. Springer-Verlag Lecture Notes in Computer Science, 1998.]]

Digital Library

[13]

Jeffrey S. Foster, Tachio Terauchi, and Alex Aiken. Flow-sensitive type qualifiers. In Proceedings of the ACM Symposium on Programming Language Design and Implementation (PLDI), June 2002.]]

Digital Library

[14]

Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Gregoire Sutre. Software verification with Blast. In Proceedings of the Tenth International Workshop on Model Checking of Software (SPIN), pages 235--239. Lecture Notes in Computer Science 2648, Springer-Verlag, 2003.]]

Digital Library

[15]

Martin Hofmann. The strength of non-size increasing computation. In Proceedings of the ACM Symposium on the Principles of Programming Languages (POPL), pages 260--269. ACM Press, 2002.]]

Digital Library

[16]

J. Hughes and L. Pareto. Recursion and Dynamic Data-Structures in Bounded Space: Towards Embedded ML Programming. In Proceedings of the ACM Conference on Functional Programming (ICFP), September 1999.]]

Digital Library

[17]

J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Proceedings of the ACM Symposium on the Principles of Programming Languages (POPL), pages 410--423. ACM Press, January 1996.]]

Digital Library

[18]

Atsushi Igarashi and Naoki Kobayashi. Resource usage analysis. In Proceedings of the ACM Symposium on the Principles of Programming Languages (POPL), January 2002.]]

Digital Library

[19]

Naoki Kobayashi. Time regions and effects for resource usage analysis. Technical report, Tokyo Inst. of technology, 2003.]]

[20]

Yitzhak Mandelbaum, David Walker, and Robert Harper. An effective theory of type refinements. In Proceedings of the ACM Conference on Functional Programming (ICFP), Uppsala, Sweden, 2003.]]

Digital Library

[21]

Kim Marriott, Peter Stuckey, and Martin Sulzmann. Resource usage verification. In Proceedings of the Asian Symposium on Programming Languages and Systems (APLAS), Beijing, China, November 2003.]]

[22]

Benjamin C. Pierce. Types and Programming Languages. MIT Press, 2002.]]

Digital Library

[23]

W. Pugh. The Omega Test: A fast practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102--114, 1992.]]

Digital Library

[24]

F. Smith, D. Walker, and G. Morrisett. Alias Types. In Proceedings of the 9th European Symposium on Programming, Berlin, Germany, March 2000.]]

Digital Library

[25]

H. Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, 1998.]]

Digital Library

[26]

H. Xi. Imperative Programming with Dependent Types. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS), Santa Barbara, June 2000.]]

Digital Library

[27]

H. Xi. Dependent Types for Program Termination Verification. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS), Boston, June 2001.]]

Digital Library

[28]

H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In Proceedings of the ACM Symposium on Programming Language Design and Implementation (PLDI), pages 249--257. ACM Press, June 1998.]]

Digital Library

Cited By

Brady EHammond K(2019)Correct-by-Construction Concurrency: Using Dependent Types to Verify Implementations of Effectful Resource Usage ProtocolsFundamenta Informaticae10.5555/1883634.1883636102:2(145-176)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/1883634.1883636
Hovland D(2009)A Type System for Usage of Software ComponentsTypes for Proofs and Programs10.1007/978-3-642-02444-3_12(186-202)Online publication date: 2009
https://doi.org/10.1007/978-3-642-02444-3_12
Chin WKhoo SQin SPopeea CNguyen HRoman GGriswold WNuseibeh B(2005)Verifying safety policies with size properties and alias controlsProceedings of the 27th international conference on Software engineering10.1145/1062455.1062500(186-195)Online publication date: 15-May-2005
https://dl.acm.org/doi/10.1145/1062455.1062500
Show More Cited By

Index Terms

A type system for resource protocol verification and its correctness proof
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Abstract data types
  2. Software organization and properties
    1. Software functional properties
      1. Correctness
2. Theory of computation
  1. Logic
    1. Proof theory
  2. Semantics and reasoning
    1. Program reasoning
      1. Pre- and post-conditions
      2. Program analysis
    2. Program semantics

Recommendations

Verification of ISO ACSE protocol specified in Estelle

The techniques for verifying protocols specified in Estelle have so far focused on translating the specifications into another form, such as finite state machines or Petri nets, for which tools of verification have already been implemented. All the ...
BLESS Behavior Correctness Proof as Convincing Verification Artifact

Safety-critical cyber-physical systems require evidence they are indeed safe. In practice, such evidence is results of system tests. Unfortunately, tests can only demonstrate the presence of software errors, not their absence, and can practically cover a ...
Fighting livelock in the GNU i-protocol: a case study in explicit-state model checking

The i-protocol, an optimized sliding-window protocol for GNU uucp, first came to our attention in 1995 when we used the Concurrency Factory's local model checker to detect, locate, and correct a non-trivial livelock in version 1.04 of the protocol. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PEPM '04: Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

August 2004

212 pages

ISBN:1581138350

DOI:10.1145/1014007

Program Chairs:
Nevin Heintze
Agere Systems, NJ
,
Peter Sestoft
KVL and ITU, Copenhagen, Denmark

Copyright © 2004 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: 24 August 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PEPM04

Sponsor:

PEPM04: Partial Evaluation and Program Manipulation 2004

August 24 - 25, 2004

Verona, Italy

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
264
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Brady EHammond K(2019)Correct-by-Construction Concurrency: Using Dependent Types to Verify Implementations of Effectful Resource Usage ProtocolsFundamenta Informaticae10.5555/1883634.1883636102:2(145-176)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/1883634.1883636
Hovland D(2009)A Type System for Usage of Software ComponentsTypes for Proofs and Programs10.1007/978-3-642-02444-3_12(186-202)Online publication date: 2009
https://doi.org/10.1007/978-3-642-02444-3_12
Chin WKhoo SQin SPopeea CNguyen HRoman GGriswold WNuseibeh B(2005)Verifying safety policies with size properties and alias controlsProceedings of the 27th international conference on Software engineering10.1145/1062455.1062500(186-195)Online publication date: 15-May-2005
https://dl.acm.org/doi/10.1145/1062455.1062500
Wei-Ngan Chin Siau-Cheng Khoo Shengchao Qin Popeea CHuu Hai Nguyen (2005)Verifying safety policies with size properties and alias controlsProceedings. 27th International Conference on Software Engineering, 2005. ICSE 2005.10.1109/ICSE.2005.1553561(186-195)Online publication date: 2005
https://doi.org/10.1109/ICSE.2005.1553561

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.

Figures

Tables

Media

View Table of Conten