Refactoring and representation independence for class hierarchies
From MaRDI portal
Publication:428866
DOI10.1016/j.tcs.2012.02.009zbMath1278.68145OpenAlexW2032691771MaRDI QIDQ428866
David A. Naumann, Leila Silva, Augusto Sampaio
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.009
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
Laws of Programming for References ⋮ Refactoring and representation independence for class hierarchies ⋮ Full Abstraction at Package Boundaries of Object-Oriented Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refactoring and representation independence for class hierarchies
- Blaming the client: on data refinement in the presence of pointers
- rCOS: a refinement calculus of object systems
- Algebraic reasoning for object-oriented programming
- Sound refactorings
- Using CafeOBJ to Mechanise Refactoring Proofs and Application
- Ownership types for object encapsulation
- Relational Parametricity and Separation Logic
- Ownership confinement ensures representation independence for object-oriented programs
- A bisimulation for type abstraction and recursion
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
- A relational modal logic for higher-order stateful ADTs
- State-dependent representation independence
- Separation logic and abstraction
- Small bisimulations for reasoning about higher-order imperative programs
- Theorem Proving in Higher Order Logics
- Programming Languages and Systems
This page was built for publication: Refactoring and representation independence for class hierarchies
