A type system for resource protocol verification and its correctness proof

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2004, Pages 135-146

  Popeea, Corneliu ^a   Chin, Wei Ngan ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Correctness Proof; Dependent Type System; Path sensitive Analysis; Protocol Verification; Resource Specification

Indexed keywords

COMPUTER PROGRAM LISTINGS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; SEMANTICS; SOFTWARE ENGINEERING;

CORRECTNESS PROOF; DEPENDENT TYPE SYSTEM; PATH-SENSITIVE ANALYSIS; PROTOCOL VERIFICATION; RESOURCE SPECIFICATION;

NETWORK PROTOCOLS;

EID: 11244252818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014007.1014021     Document Type: Conference Paper

References (28)

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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
18. Atsushi Igarashi and Naoki Kobayashi. Resource usage analysis. In Proceedings of the ACM Symposium on the Principles of Programming Languages (POPL), January 2002.
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.
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.
23. W. Pugh. The Omega Test: A fast practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102-114, 1992.
24. F. Smith, D. Walker, and G. Morrisett. Alias Types. In Proceedings of the 9th European Symposium on Programming, Berlin, Germany, March 2000.
25. H. Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, 1998.
26. H. Xi. Imperative Programming with Dependent Types. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS), Santa Barbara, June 2000.
27. H. Xi. Dependent Types for Program Termination Verification. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS), Boston, June 2001.
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.