Resource usage protocols for iterators

Journal of Object Technology

Volumn 8, Issue 4, 2009, Pages 55-83

  Haack, Christian ^a   Hurlin, Clément ^b,c  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b INRIA   (France)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349384802     PISSN: None     EISSN: 16601769     Source Type: Journal    
DOI: 10.5381/jot.2009.8.4.a3     Document Type: Article

References (32)

1. K. Bierhoff and J. Aldrich. Modular typestate verification of aliased objects. In ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 301-320, 2007.
2. J. Berdine, C. Calcagno, and P. W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In F. S. de Boer, M. M. Bonsangue, S. Graf, and W.-P. de Roever, editors, Formal Methods for Components and Objects, volume 4111 of Lecture Notes in Computer Science, pages 115-137. Springer-Verlag, 2005.
3. J. Berdine, C. Calcagno, and P. W. O'Hearn. Symbolic execution with separation logic. In K. Yi, editor, Asian Programming Languages and Systems Symposium, volume 3780 of Lecture Notes in Computer Science, pages 52- 68. Springer-Verlag, 2005.
4. M. Barnett, R. DeLine, M. Fähndrich, K. R. M. Leino, and W. Schulte. Verification of object-oriented programs with invariants. Journal of Object Technology, 3(6):27-56, 2004.
5. K. Bierhoff. Iterator specification with typestates. In Specification and Verification of Component-Based Systems, pages 79-82, 2006.
6. R. Bornat, P. W. O'Hearn, C. Calcagno, and M. Parkinson. Permission accounting in separation logic. In J. Palsberg and M. Abadi, editors, Principles of Programming Languages, pages 259-270. ACM Press, 2005.
7. J. Boyland. Checking interference with fractional permissions. In R. Cousot, editor, Static Analysis Symposium, volume 2694 of Lecture Notes in Computer Science, pages 55-72. Springer-Verlag, 2003.
8. J. Boyland. Semantics of fractional permissions with nesting. Technical report, University of Wisconsin at Milwaukee, December 2007.
9. J. Boyland and W. Retert. Connecting effects and uniqueness with adoption. In Principles of Programming Languages, pages 283-295, 2005.
10. J. Boyland, W. Retert, and Y. Zhao. Iterators can be independent "from" their collections. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming, 2007.
11. W. Chin, C. David, H. Nguyen, and S. Qin. Enhancing modular OO verification with separation logic. In G. C. Necula and P. Wadler, editors, Principles of Programming Languages, pages 87-99. ACM Press, 2008.
12. R. DeLine and M. Fähndrich. Enforcing high-level protocols in low-level software. In Programming Languages Design and Implementation, pages 59-69, 2001.
13. R. DeLine and M. Fähndrich. Typestates for objects. In European Conference on Object-Oriented Programming, pages 465-490, 2004.
14. D. DiStefano and M. Parkinson. jStar: Towards practical verification for Java. In ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, volume 43, pages 213-226. ACM Press, 2008.
15. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
16. J.-Y. Girard. Linear logic: Its syntax and semantics. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic (Proc. of the Workshop on Linear Logic, Cornell University, June 1993), number 222. Cambridge University Press, 1995.
17. C. Haack and C. Hurlin. Separation logic contracts for a Java-like language with fork/join. In J. Meseguer and G. Rosu, editors, Algebraic Methodology and Software Technology, volume 5140 of Lecture Notes in Computer Science, pages 199-215. Springer-Verlag, July 2008.
18. C. Haack and C. Hurlin. Separation logic contracts for a Java-like language with fork/join. Technical Report 6430, INRIA, January 2008.
19. C. Haack, M. Huisman, and C. Hurlin. Reasoning about Java's reentrant locks. In G. Ramalingam, editor, Asian Programming Languages and Systems Symposium, volume 5356 of Lecture Notes in Computer Science, pages 171-187. Springer-Verlag, December 2008.
20. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In Principles of Programming Languages, pages 14-26, 2001.
21. B. Jacobs and F. Piessens. The VeriFast program verifier. Technical Report CW-520, Katholieke Universiteit Leuven, 2008.
22. L. Jia and D. Walker. ILC: A foundation for automated reasoning about pointer programs. In European Symposium on Programming, pages 131- 145, 2006.
23. G. Krishnaswami. Reasoning about iterators with separation logic. In Specification and Verification of Component-Based Systems, pages 83-86, 2006.
24. H. H. Nguyen, C. David, S. Qin, and W. Chin. Automated verification of shape and size properties via separation logic. In Verification, Model Checking and Abstract Interpretation, pages 251-266, 2007.
25. P. W. O'Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, 1999.
26. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In Principles of Programming Languages, pages 268-280. ACM Press, January 2004.
27. M. Parkinson. Local reasoning for Java. Technical Report UCAM-CL-TR- 654, University of Cambridge, 2005.
28. M. Parkinson and G. Bierman. Separation logic and abstraction. In J. Palsberg and M. Abadi, editors, Principles of Programming Languages, pages 247-258. ACM Press, 2005.
29. M. Pavlova, G. Barthe, L. Burdy, M. Huisman, and J.-L. Lanet. Enforcing high-level security properties for applets. In P. Paradinas and J.-J. Quisquater, editors, Smart Card Research and Advanced Application. Kluwer Academic Publishing, 2004.
30. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science. IEEE Press, July 2002.
31. K. Trentelman and M. Huisman. Extending JML specifications with temporal logic. In Algebraic Methodology and Software Technology, volume 2422 of Lecture Notes in Computer Science, pages 334-348. Springer-Verlag, 2002.
32. P. Wadler. A taste of linear logic. In Mathematical Foundations of Computer Science, pages 185-210, 1993.