Modular verification of higher-order methods with mandatory calls specified by model programs

Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA

Volumn , Issue , 2007, Pages 351-367

  Shaner, Steve M ^a   Leavens, Gary T ^a   Naumann, David A ^b  

^a IOWA STATE UNIVERSITY   (United States)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Grey box approach; Higher order method; Hoare logic; Mandatory call; Model program; Refinement calculus; Specification languages; Verification

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); COMPUTER SYSTEMS PROGRAMMING; LINGUISTICS; NEODYMIUM; SPECIFICATIONS; STANDARDS;

CLIENT CODES; DESIGN PATTERNS; FIRST ORDERS; HIGHER ORDER; HIGHER ORDER METHODS; INTERNATIONAL CONFERENCES; LANGUAGES (TRADITIONAL); MODEL PROGRAMS; MODULAR APPROACH; MODULAR VERIFICATION; OBJECT-ORIENTED PROGRAMMING; OBSERVER (OBS); TEMPLATE METHODS; VERIFICATION CONDITION (VC);

OBJECT ORIENTED PROGRAMMING;

EID: 42149195986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1297027.1297053     Document Type: Conference Paper

References (43)

1. P. America. Designing an object-oriented programming language with behavioural subtyping. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Foundations of Object-Oriented Languages, REX School/Workshop, Noordwijkerhout, The Netherlands, May/June 1990, volume 489 of Lecture Notes in Computer Science, pages 60-90. Springer-Verlag, New York, NY, 1991.
2. R.-J. Back and J. von Wright. Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science. Springer-Verlag, 1998.
3. A. Banerjee and D. A. Naumann. Ownership confinement ensures representation independence for object-oriented programs. J. ACM, 52(6):894-960, Nov. 2005.
4. M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. In G. Barthe, L. Burdy, M. Huisman, J.-L. Lanet, and T. Muntean, editors, Construction and Analysis of Safe, Secure, and Interoperable Smart devices (CASSIS 2004), volume 3362 of Lecture Notes in Computer Science, pages 49-69. Springer-Verlag, 2005.
5. M. Barnett and W. Schulte. Runtime verification of .NET contracts. The Journal of Systems and Software, 65(3): 199-208, Mar. 2003.
6. B. Beckert, R. Hähnle, and P. H. Schmitt, editors. Verification of Object-Oriented Software: The KeY Approach. LNCS 4334. Springer-Verlag, 2007.
7. M. Büchi. Safe language mechanisms for modularization and concurrency. Technical Report TUCS Dissertations No. 28, Turku Center for Computer Science, May 2000.
8. M. Büchi and W. Week. A plea for grey-box components. Technical Report 122, Turku Center for Computer Science, Presented at the Workshop on Foundations of Component-Based Systems, Zürich, September 1997, 1997. http://tinyurl.com/2833tr.
9. M. Büchi and W. Week. The greybox approach: When blackbox specifications hide too much. Technical Report 297, Turku Center for Computer Science, Aug. 1999. http://tinyurl.com/ywmuzy
10. A. L. C. Cavalcanti and D. Naumann. A weakest precondition semantics for an object-oriented language of refinement. IEEE Transactions on Software Engineering, 26(8):713-728, Aug. 2000.
11. P. Chalin and F. Rioux. Non-null references by default in the Java Modeling Language. In Proceedings of the Workshop on the Specification and Verification of Component-Based Systems (SAVCBS'05), volume 31(2) of ACM Software Engineering Notes. ACM, 2005.
12. W. Damm and B. Josko. A sound and relatively complete Hoare-logic for a language with higher type procedures. Acta Informatica, 20(1):59-101, Oct. 1983.
13. F. S. de Boer. A WP-calculus for OO. In W. Thomas, editor, Foundations of Software Science and Computation Structures (FOSSACS), volume 1578 of Lecture Notes in Computer Science, pages 135-149. Springer-Verlag, 1999.
14. K. K. Dhara and G. T. Leavens. Forcing behavioral subtyping through specification inheritance. In Proceedings of the 18th ICSE, Berlin, Germany, pages 258-267. IEEE CS Press, Mar. 1996. A corrected version is ISU CS TR #95-20c, http://tinyurl.com/s2krg.
15. G. W. Ernst, J. K. Navlakha, and W. F. Ogden. Verification of programs with procedure-type parameters. Acta Informatica, 18(2): 149-169, Nov. 1982.
16. R. B. Findler and M. Felleisen. Contracts for higher-order functions. In Proceedings of ICFP, pages 48-59, Oct. 2002.
17. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI'02), volume 37(5) of SIGPLAN, pages 234-245, New York, NY, June 2002. ACM.
18. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading, Mass., 1995.
19. E. C. R. Hehner. Specified blocks. Verified Software: Theories, Tools, Experiments (VSTTE), Oct. 2005. http://tinyurl.com/2a7kf2.
20. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10):576-580,583, Oct. 1969.
21. C. A. R. Hoare. Procedures and parameters: An axiomatic approach. In E. Engeler, editor, Symposium on Semantics of Algorithmic Languages. Springer-Verlag, 1971.
22. A. Igarashi, B. Pierce, and P. Wadler. Featherweight Java: A minimal core calculus for Java and GJ. In L. Meissner, editor, Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA'99), volume 34(10) of ACM SIGPLAN Notices, pages 132-146, N. Y., Nov. 1999. ACM.
23. G. T. Leavens. JML's rich, inherited specifications for behavioral subtypes. In Z. Liu and H. Jifeng, editors, Formal Methods and Software Engineering: 8th International Conference on Formal Engineering Methods (ICFEM), volume 4260 of Lecture Notes in Computer Science, pages 2-34, New York, NY, Nov. 2006. Springer-Verlag.
24. G. T. Leavens, A. L. Baker, and C. Ruby. Preliminary design of JML: A behavioral interface specification language for Java. ACMSIGSOFT Software Engineering Notes, 31(3):1-38, Mar. 2006.
25. G. T. Leavens, K. R. M. Leino, and P. Müller. Specification and verification challenges for sequential object-oriented programs. Formal Aspects of Computing, 19(2): 159-189, June 2007.
26. G. T. Leavens and P. Müller. Information hiding and visibility in interface specifications. In International Conference on Software Engineering (ICSE), pages 385-395. IEEE, May 2007.
27. G. T. Leavens and D. A. Naumann. Behavioral subtyping, specification inheritance, and modular reasoning. Technical Report 06-20b, Department of Computer Science, Iowa State University, Ames, Iowa, 50011, Sept. 2006.
28. G. T. Leavens, D. A. Naumann, and S. Rosenberg. Preliminary definition of Core JML. CS Report 2006-07, Stevens Institute of Technology, Sept. 2006.
29. G. T. Leavens, E. Poll, C. Clifton, Y. Cheon, C. Ruby, D. R. Cok, P. Müller, J. Kiniry, and P. Chalin. JML Reference Manual. Department of Computer Science, Iowa State University. Available from http://www.jmlspecs.org, Feb. 2007.
30. G. T. Leavens and W. E. Weihl. Specification and verification of object-oriented programs using supertype abstraction. Acta Informatica, 32(8):705-778, Nov. 1995.
31. K. R. M. Leino. Data groups: Specifying the modification of extended state. In OOPSLA '98 Conference Proceedings, volume 33(10) of ACM SIGPLAN Notices, pages 144-153. ACM, Oct. 1998.
32. B. H. Liskov and J. M. Wing. A behavioral notion of subtyping. ACM Trans. Prog. Lang Syst., 16(6): 1811-1841, Nov. 1994.
33. C. Morgan. Procedures, parameters and abstraction: separate concerns. Science of Computer Programming, 11(1), Oct. 1988.
34. Reprinted in the book On the Refinement Calculus.
35. C. Morgan. Programming from Specifications: Second Edition. Prentice Hall International, Hempstead, UK, 1994.
36. P. Müller. Modular Specification and Verification of Object-Oriented Programs, volume 2262 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
37. D. A. Naumann. Verifying a secure information flow analyzer. In J. Hurd and T. Melham, editors, 18th International Conference on Theorem Proving in Higher Order Logics TPHOLS, volume 3603 of Lecture Notes in Computer Science, pages 211-226, 2005.
38. E. Olderog. On the notion of expressiveness and the rule of adaptation. Theoretical Comput Sci., 24:337-347, 1983.
39. M. J. Parkinson. Local reasoning for Java. Technical Report 654, University of Cambridge Computer Laboratory, Nov. 2005. The author's Ph.D. dissertation.
40. C. Pierik. Validation Techniques for Object-Oriented Proof Outlines. PhD thesis, Universiteit Utrecht, 2006.
41. A. Poetzsch-Heffter, P. Müller, and J. Schäfer. The Jive tool. http://tinyurl.com/3cke34, Apr. 2006.
42. P. V Roy and S. Haridi. Concepts, Techniques, and Models of Computer Programming. The MIT Press, Cambridge, Mass., 2004.
43. N. Soundarajan and S. Fridella. Incremental reasoning for object oriented systems. In O. Owe, S. Krogdahl, and T. Lyche, editors, From Object-Orientation to Formal Methods, Essays in Memory of Ole-Johan Dahl, volume 2635 of Lecture Notes in Computer Science, pages 302-333. Springer-Verlag, 2004.