Observational purity and encapsulation

DOI10.1016/j.tcs.2007.02.004zbMath1116.68052OpenAlexW2101530705MaRDI QIDQ882452

David A. Naumann

Publication date: 23 May 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.004

zbMATH Keywords

information hidingspecification and verificationbenevolent side effects

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

A generic complete dynamic logic for reasoning about purity and effects

Uses Software

• Eiffel
• JML
• Spec#
• ESC/Java

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards imperative modules: reasoning about invariants and sharing of mutable state
• Relational separation logic
• How the design of JML accommodates both runtime assertion checking and formal verification
• Program logic and equivalence in the presence of garbage collection.
• Proof of correctness of data representations
• Ownership types for object encapsulation
• Simple relational correctness proofs for static analyses and program transformations
• Ownership confinement ensures representation independence for object-oriented programs
• Stack-based access control and secure information flow
• Data Refinement
• Representation independence, confinement and access control [extended abstract]
• Fundamental Approaches to Software Engineering
• An axiomatic basis for computer programming
• FM 2005: Formal Methods
• Static Analysis
• Modular specification and verification of object-oriented programs