Verifying safety policies with size properties and alias controls

Proceedings - International Conference on Software Engineering

Volumn 2005, Issue , 2005, Pages 186-195

  Chin, Wei Ngan ^a   Khoo, Siau Cheng ^a   Qin, Shengchao ^b   Popeea, Corneliu ^a   Nguyen, Huu Hai ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b DURHAM UNIVERSITY   (United Kingdom)

^c SINGAPORE MIT ALLIANCE   (Singapore)

Author keywords

Alias control; Dependent types; Object based programs; Safety verification; Size properties

Indexed keywords

ALIAS CONTROL; SAFETY POLICIES; SAFETY VERIFICATION; SIZE PROPERTIES;

OBJECT ORIENTED PROGRAMMING; PUBLIC POLICY; RELATIONAL DATABASE SYSTEMS; SECURITY OF DATA; TRACKING (POSITION);

SOFTWARE ENGINEERING;

EID: 33244466036     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2005.1553561     Document Type: Conference Paper

References (39)

1. J. Aldrich, V. Kostadinov, and C. Chambers. Alias Annotation for Program Understanding. In ACM OOPSLA, Seattle, Washington, November 2002.
2. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic Predicate Abstraction of C Programs. In ACM PLDI, June 2001.
3. F. Benoy and A. King. Inferring argument size relationships with CLP(R). In Logic Programming Synthesis and Transformation, Springer-Verlag, August 1997.
4. G. Bollella, B. Brosgol, P. Dibble, S. Furr, J. Gosling, D. Hardin, and M. Turnbull. The Real-Time Specification for Java. Addison-Wesley, 2000.
5. C. Boyapati, R. Lee, and M. Rinard. Ownership types for safe programming: Preventing data races and deadlocks. In ACM OOPSLA, Seattle, Washington, November 2002.
6. C. Boyapati and M. Rinard. A parameterized type system for race-free Java programs. In ACM OOPSLA, Tampa Bay, Florida, October 2001.
7. J. Boyland, J. Noble, and W. Retert. Capabilities for Sharing: A Generalization of Uniqueness and Read-Only. In ECOOP, Budapest, Hungary, June 2001.
8. S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular Verification of Software Components in C. In Proceedings of the International Conference on Software Engineering (ICSE'03), pages 385-395, 2003.
9. E. C. Chan, J. Boyland, and W. L. Scherlis. Promises: Limited Specifications for Analysis and Manipulation. In Proceedings of the International Conference on Software Engineering (ICSE'98), Kyoto, Japan, April 1998.
10. W.N. Chin and S.C. Khoo. Calculating sized types. In ACM SIGPLAN PEPM, pages 62-72, Boston, Massachusetts, United States, January 2000.
11. W.N. Chin, S.C. Khoo, S.C. Qin, C. Popeea, and H.H. Nguyen. Verifying Safety Policies with Size Properties and Alias Controls. Technical report, SoC, Natl Univ. of Singapore, August 2004. avail, at http://www.comp.nus.edu.sg/ ~qinsc/papers/safety.ps.gz.
12. J. C. Corbett, M. B. Dwyer, J. Hatcliff, S. Laubach, C. S. Pasareanu, Robby, and H. Zheng. Bandera: extracting finite-state models from Java source code. In Proceedings of the International Conference on Software Engineering (ICSE'00), pages 439-448, Limerick, Ireland, June 2000.
13. R. DeLine and M. Fahndrich. Typestates for Objects. In ECOOP, Oslo, Norway, June 2004.
14. M. Fahndrich and R. DeLine. Adoption and Focus: Practical linear types for imperative programming. In ACM PLDI, June 2002.
15. C. Flanagan, K.R.M. Leino, M. Lillibridge, G. Nelson, J.B. Saxe, and R. Stata. Extended Static Checking for Java. In ACM PLDI, Berlin, Germany, June 2002.
16. J.S. Foster, T. Terauchi, and A. Aiken. Flow-Sensitive Type Qualifiers. In ACM PLDI, Berlin, Germany, June 2002.
17. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
18. B. Grobauer. Cost Recurrences for DML Programs. In Proceedings of the International Conference on Functional Programming (ICFP '01), pages 253-277, Florence, Italy, September 2001.
19. C. Grothoff, J. Palsberg, and J. Vitek. Encapsulating Objects with Confined Types. In ACM OOPSLA, October 2001.
20. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In ACM POPL, pages 58-70, Portland, Oregon, January 2002.
21. M. Hofmann and S. Jost. Static Prediction of Heap Space Usage for First Order Functional Programs. In ACM POPL, New Orleans, Louisiana, January 2003.
22. J. Hughes and L. Pareto. Recursion and Dynamic Data-Structures in Bounded Space: Towards Embedded ML Programming. In Proceedings of the International Conference on Functional Programming (ICFP '99), September 1999.
23. J. Hughes, L. Pareto, and A. Sabry. Proving the Correctness of Reactive Systems Using Sized Types. In ACM POPL, pages 410-423. ACM Press, January 1996.
24. N. Kobayashi. Quasi-linear types. In ACM POPL, pages 29-42. ACM Press, 1999.
25. V. Kuncak, P. Lam, and M. Rinard. Role analysis. In ACM POPL, Portland, Oregon, January 2002.
26. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In ACM POPL, pages 81-92. ACM Press, 2001.
27. N. Minsky. Towards alias-free pointers. In ECOOP, July 1996.
28. A. Moeller and M. I. Schwartzbach. The Pointer Assertion Logic Engine. In ACM PLDI, June 2001.
29. M. Odersky, V. Cremet, C. Röckl, and M. Zenger. A Nominal Theory of Objects with Dependent Types. In ECOOP, Springer LNCS, July 2003.
30. B. C. Pierce. Intersection types and bounded polymorphism. Mathematical Structures in Computer Science, 7(2):129-193, 1997.
31. C. Popeea and W.N. Chin. A Type System for Resource Protocol Verification and its Correctness Proof. In ACM SIGPLAN PEPM, Verona, Italy, August 2004.
32. W. Pugh. The Omega Test: A fast practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102-114, 1992.
33. M. Sagiv, T. Reps, and R. Wilhelm. Parametric Shape Analysis via 3-valued Logic. In ACM POPL, January 1999.
34. K. Sohn and A. Van Gelder. Termination detection in logic programs using argument sizes (extended abstract). In Proceedings of the 10th ACM Symposium on Principles of Database Systems, pages 216-226, 1991.
35. P. Wadler. Linear types can change the world! In M. Broy and C. Jones, editors, Programming Concepts and Methods. North Holland, Amsterdam, April 1990.
36. H. Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, 1998.
37. H. Xi. Imperative Programming with Dependent Types. In Proceedings of 15th Symposium on Logic in Computer Science (LICS '00), Santa Barbara, June 2000.
38. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In ACM PLDI, pages 249-257. ACM Press, June 1998.
39. D.N. Xu, C. Popeea, S.C. Khoo, and W.N. Chin. Scalable and Precise Inference for Array Checks Elimination. Technical report, SoC, Natl Univ. of Singapore, November 2004. avail. at http://www.comp.nus.edu.sg/~chinwn/publ. html.