Refactoring and representation independence for class hierarchies

DOI10.1016/J.TCS.2012.02.009MaRDI QIDQ428866zbMATH OpenOpenAlexFDO

Authors David A. Naumann, Augusto Sampaio, Leila Silva

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

zbMATH Keywords

verificationsemanticsclass inheritanceprogram transformationrefactoringrepresentation independence

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 2016082
• Refactoring by transformation
• Sound refactorings
• Evolving object-oriented designs with refactorings
• Graph Transformations

Cites work

• scientific article; zbMATH DE number 1728235 (Why is no real title available?)
• scientific article; zbMATH DE number 1956470 (Why is no real title available?)
• scientific article; zbMATH DE number 1929900 (Why is no real title available?)
• scientific article; zbMATH DE number 2090153 (Why is no real title available?)
• A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
• A bisimulation for type abstraction and recursion
• A relational modal logic for higher-order stateful ADTs
• Algebraic reasoning for object-oriented programming
• Blaming the client: on data refinement in the presence of pointers
• Ownership confinement ensures representation independence for object-oriented programs
• Ownership types for object encapsulation
• Programming Languages and Systems
• Refactoring and representation independence for class hierarchies
• Relational Parametricity and Separation Logic
• Separation logic and abstraction
• Small bisimulations for reasoning about higher-order imperative programs
• Sound refactorings
• State-dependent representation independence
• Theorem Proving in Higher Order Logics
• Using CafeOBJ to mechanise refactoring proofs and application
• rCOS: a refinement calculus of object systems

Cited in

(6)

• Four Approaches to the Reference Class Problem
• Verification, Model Checking, and Abstract Interpretation
• Laws of programming for references
• Refactoring and representation independence for class hierarchies
• Static composition of refactorings
• Full abstraction at package boundaries of object-oriented languages

This page was built for publication: Refactoring and representation independence for class hierarchies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428866)