On assertion-based encapsulation for object invariants and simulations

Formal Aspects of Computing

Volumn 19, Issue 2, 2007, Pages 205-224

  Naumann, David A ^a  

^a Stevens Institute of Technology   (United States)

Author keywords

Encapsulation and abstraction; Object invariants; Separation and alias control

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION; ENCAPSULATION; INVARIANCE;

AUXILIARY STATE (GHOST FIELDS); SEPARATION LOGIC; SOUND MODULAR REASONING;

OBJECT ORIENTED PROGRAMMING;

EID: 34250221169     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-006-0020-5     Document Type: Article

References (75)

1. Aldrich J, Chambers C (2004) Ownership domains: separating aliasing policy from mechanism. In: European conference on object-oriented programming (ECOOP), pp 1-25
2. Apt KR, Olderog E-R (1997) Verification of sequential and concurrent Programs. 2nd ed. Springer, Berlin Heidelberg New York
3. Biering B, Birkedal L, Torp-Smith N (2005) BI hyperdoctrines and higher-order separation logic. In: European symposium on programming (ESOP), vol. 3444 of LNCS, pp 233-247
4. Bornat R, Calcagno C, O'Hearn PW, Parkinson MJ (2005) Permission accounting in separation logic. In: ACM symposium on principles of programming languages (POPL), pp 259-270
5. Barnett M, DeLine R, Fähndrich M, Leino KRM, Schulte W (2004) Verification of object-oriented programs with invariants. J Object Technol 3(6):27-56 Special issue: ECOOP 2003 workshop on formal techniques for Java-like Programs
6. Boyapati C, Lee R, Rinard M (2002) Ownership types for safe programming: preventing data races and deadlocks. In: Object-oriented programming, systems, languages, and applications (OOPSLA), pp 211-230
7. Boyapati C, Liskov B, Shrira L (2003) Ownership types for object encapsulation. In: ACM symposium on principles of programming languages (POPL), pp 213-223
8. Barnett M, Leino KRM, Schulte W (2005) The Spec# programming system: an overview. In: Barthe G, Burdy L, Huisman M, Lanet JL, Muntean T (eds) Construction and analysis of safe, secure, and interoperable smart devices, international workshop (CASSIS 2004), revised selected papers, Vol. 3362, of LNCS, pp 49-69
9. Banerjee A, Naumann DA (2002) Representation independence, confinement and access control. In: ACM symposium on principles of programming languages (POPL), pp 166-177
10. Barnett M, Naumann DA (2004) Friends need a bit more: maintaining invariants over shared state. In: Kozen D, Shankland C, (eds) Mathematics of program construction, Vol. 3125 of LNCS, pp 54-84
11. Banerjee A, Naumann DA (2005) Ownership confinement ensures representation independence for object-oriented programs. J ACM, 52(6):894-960 Extended version of [BN02].
12. Banerjee A, Naumann DA (2005) State based ownership, reentrance, and encapsulation. In: European conference on object-oriented programming (ECOOP), pp 387-411
13. Barnett M, Naumann DA, Schulte W, Sun Q 99.44% pure: useful abstractions in specifications. In: ECOOP workshop on formal techniques for Java-like programs (FTfJP), 2004. Technical Report NIII-R0426, University of Nijmegen
14. Barnett M, Naumann DA, Schulte W, Sun Q (2006) Allowing state changes in specifications. In: International conference on emerging trends in information and communication security (ETRICS), Vol. 3995 of LNCS, Müller G, (ed) pp 321-336. Springer, Berlin Heidelberg New York Extended version of [BNSS04]
15. Bierman GM, Parkinson MJ (2005) Separation logic and abstraction. In: ACM symposium on principles of programming languages (POPL), pp. 247-258
16. Borba PHM, Sampaio ACA, Cornélio ML (2003) A refinement algebra for object-oriented programming. In: Cardelli L (ed) European conference on object-oriented programming (ECOOP), Vol. 2743 in LNCS, pp 457-482
17. Borba PHM, Sampaio A, Cavalcanti A, Cornélio M (2004) Algebraic reasoning for object-oriented programming. Sci Comput Program 52(1-3):53-100
18. Birkedal L, Torp-Smith N (2005) Higher order separation logic and abstraction (submitted.)
19. Birkedal L, Torp-Smith N, Yang H (2005) Semantics of separation-logic typing and higher-order frame rules. In: IEEE symposium on logic in computer science (LICS), pp 260-269
20. Clarke D (2001) Object ownership and containment. Dissertation, Computer Science and Engineering, University of New South Wales
21. Cavalcanti ALC, Naumann DA (2002) Forward simulation for data refinement of classes. In: Eriksson L, Lindsay PA (eds) Formal Methods Europe, Vol. 2391 of LNCS, pp 471-490
22. Clarke DG, Noble J, Potter JM (2001) Simple ownership types for object containment. In: Knudsen JL (ed) ECOOP 2001-object oriented programming, pp 53-76
23. Calcagno C, O'Hearn PW, Bornat R (2003) Program logic and equivalence in the presence of garbage collection. Theoret Comput Sci 298(3):557-581
24. de Boer FS, Pierik C (2002) Computer-aided specification and verification of annotated object-oriented programs. In: Jacobs B, Rensink A (eds) Formal methods for open object-based distributed systems, pp 163-177
25. DeLine R, Fähndrich M (2001) Enforcing high-level protocols in low-level software. In: ACM Conference on Programing Languages on Design and implementation (PLDI), pp 59-69
26. Detlefs DL, Leino KRM, Nelson G (1998) Wrestling with rep exposure. Research 156, DEC Systems Research Center
27. de Roever W-P, Engelhardt K (1998) Data refinement: model-oriented proof methods and their comparison. Cambridge University Press
28. Gamma E, Helm R, Johnson R, Vlissides J (1995) Design patterns: elements of reusable object-oriented software. Addison-Wesley
29. Gries D (1993) Data refinement and the tranform. In: Broy M (ed) Program design calculi. International Summer School at Marktoberdorf. Springer, Berlin Heidelberg New York
30. Hoare CAR (1972) Proofs of correctness of data representations. Acta Inf 1:271-281
31. Hogg J (1991) Islands: aliasing protection in object-oriented languages. In: OOPSLA '91 conference proceedings, Vol. 26(11) of SIGPLAN, ACM
32. Jacobs B, Kiniry J, Warnier M (2003) Java program verification challenges. In: de Boer F, Bonsangue M, Graf S, de Roever W-P (eds) Formal methods for components and objects (FMCO 2002), Vol. 2852 of LNCS, pp 202-219
33. Jacobs B, Leino KRM, Schulte W (2004) Multithreaded object-oriented programs with invariants. In: SAVCBS
34. Jones CB (1996) Accomodating interference in the formal design of concurrent object-based programs. Formal Methods Syst Des 8(2): 105-122
35. Kassios IT (2006) Dynamic framing: Support for framing, dependencies and sharing without restriction: Formal Methods, vol 4085 in LNCS, pp 268-283
36. Kassios IT (2006) A theory of object oriented refinement. PhD dissertation, University of Toronto
37. Leavens GT, Cheon Y, Clifton C, Ruby C, Cok DR (2003) How the design of JML accommodates both runtime assertion checking and formal verification. In: de Boer FS, Bonsangue MM Grafs, de Roever WP (eds) Formal Methods for Components and Objects (FMCO 2002), Vol. 2852 of LNCS, pp 262-284. Springer, Berlin Heidelberg New York
38. Liskov B, Guttag J (1986) Abstraction and specification in program development. MIT Press, Cambridge
39. Leino KRM, Müller P (2004) Object invariants in dynamic contexts. In: European conference on object-oriented programming (ECOOP), pp 491-516
40. Leino KRM, Müller P (2005) Modular verification of static class invariants. In: Proceedings, formal methods, Vol. 3582 of LNCS, pp 26-42
41. Leino KRM, Poetzsch-Heffter A, Zhou Y (2002) Using data groups to specify and check side effects. In: ACM Conference on Programming Language Design and Implementation (PLDI), pp 246-257
42. Lynch N, Vaandrager F (1995) Forward and backward simulations part I: untimed systems. Inf Comput 121(2):214-233
43. Liskov BH, Wing JM (1994) A behavioral notion of subtyping. ACM Trans Program Lang Syst 16(6):254-280
44. Meyer B (1997) Object-oriented software construction, 2nd edn. Prentice Hall, New York
45. Milner R (1971) An algebraic definition of simulation between programs. In: Proceedings of 2nd International Joint Conference on Artificial Intelligence, pp 481-489
46. Mitchell JC (1986) Representation independence and data abstraction. In: ACM symposium on principles of programming languages (POPL), pp 263-276
47. Müller P, Poetzsch-Heffter A, Leavens GT (2004) Modular invariants for layered object structures. Technical Report 424, Department of Computer Science, ETH Zurich
48. Mijajlovic I, Torp-Smith N, O'Hearn PW (2004) Refinement and separation contexts. In: Foundations of Software Technology and Theoretical Computer Science (FST&TCS)
49. Müller P (2002) Modular specification and verification of object-oriented programs, Vol. 2262 of LNCS. Springer, Berlin Heidelberg New York
50. Mijajlović I, Yang H (2005) Data refinement with low-level pointer operations. In: Asian symposium on programming languages and systems (APLAS), pp 19-36
51. Naumann DA (2001) Ideal models for pointwise relational and state-free imperative programming. In: Sondergaard H (ed) ACM international conference on principles and practice of declarative programming, pp 4-15
52. Naumann DA (2001) Patterns and lax lambda laws for relational and imperative programming. Technical Report 2001-2, Computer Science, Stevens Institute of Technology
53. Naumann DA (2002) Soundness of data refinement for a higher order imperative language. Theoret Comput Sci 278(1-2): 271-301
54. Naumann DA (2005) Assertion-based encapsulation, object invariants and simulations. In: de Boer FS, Bonsangue MM, Graf S, de Roever WP (eds) Post-proceedings, formal methods for components and objects (FMCO 2004), Vol. 3657 of LNCS, pp 251-273
55. Naumann DA (2005) Observational purity and encapsulation. In: Fundamental aspects of software engineering (FASE), pp 190-204. Best Software Science Paper by the European Association of Software Sciences and Technology at the European Joint Conferences on Theory and Practice of Software (ETAPS)
56. Naumann DA (2006) From coupling relations to mated invariants for secure information flow. In: European symposium on research in computer security (ESORICS), Vol. 4189 in LNCS, pp 279-296
57. Naumann DA (2006) Observational purity and encapsulation. Theoret Comput Sci (to appear) Extended version of [Nau05b]
58. Naumann DA, Barnett M (2004) Towards imperative modules: Reasoning about invariants and sharing of mutable state (extended abstract). In: IEEE symposium on logic in computer science (LICS), pp 313-323
59. Naumann DA, Barnett M (2006) Towards imperative modules: reasoning about invariants and sharing of mutable state. Theoret Comput Sci 365:143-168, Extended version of [NB04]
60. O'Hearn PW (2005) Scalable specification and reasoning: technical challenges for program logic. In: Meyer B, Woodcock JCP (eds) Verified software: theories, tools, and experiments (VSTTE), Post-proceedings, (to appear)
61. O'Hearn PW, Tennent RD (1995) Parametricity and local variables. J ACM 42(3):658-709
62. O'Hearn PW, Yang H, Reynolds JC (2004) Separation and information hiding. In: ACM symposium on principles of programming languages (POPL), pp 268-280
63. Parkinson MJ Local reasoning for Java. Technical Report 654. Dissertation,University of Cambridge Computer Laboratory
64. Pierik C, Clarke D, de Boer FS (2005) Controlling object allocation using creation guards. In: Proceedings, formal methods, Vol. 3582 of LNCS, pp 59-74
65. Pierik C, de Boer FS (2005) On behavioral subtyping and completeness. In: J. Vitek, F. Logozzo (eds) ECOOP workshop on formal techniques for Java-like programs (to appear)
66. Pierik C, de Boer FS (2005) A proof outline logic for object-oriented programming. Theoret Comput Sci 343:413-442
67. Pitts AM (1996) Reasoning about local variables with operationally-based logical relations. In: O'Hearn PW, Tennent RD (eds) Algol-like languages, Vol. 2, chap 17, pp 173-193. Birkhauser, 1997. In: Reprinted from proceedings 11th annual IEEE symposium on logic in computer science, Brunswick, 1996, pp 152-163
68. Pitts AM (2000) Parametric polymorphism and operational equivalence. Math Struct Comput Sci 10:321-359
69. Plotkin G (1973) Lambda definability and logical relations. Technical Report SAI-RM-4, University of Edinburgh, School of Artificial Intelligence
70. Reynolds JC (1981) The craft of programming. Prentice-Hall, Englewood Cliffs
71. Reynolds JC (2002) Separation logic: a logic for shared mutable data structures. In: LICS, pp 55-74
72. Rehof J, Mogensen T (1999) Tractable constraints in finite semilattices. Sci Comput Program 35(2-3): 191-221
73. Szyperski C, Gruntz D, Murer S (2002) Component software: beyond object-oriented programming, 2nd edn. ACM Press and Addison-Wesley, New York
74. Skalka C, Smith S (2005) Static use-based object confinement. Springer Int J Inf Sec 4(1-2)
75. Yang H, O'Hearn PW (2002) A semantic basis for local reasoning. In: Proceedings, FOSSACS