Electronic Notes in Theoretical Computer Science · 2005 · 50 citations · 13 references
ComputingComputer ScienceFormal MethodsModel-based Systems EngineeringSystems ModelingEquivalence CheckingModel ComparisonModel FormulationModel TheoryModel TransformationModel-based DesignFormal ModelingModel EquivalenceModel Equivalence AnalysisModel RefactoringModel RefinementModel SemanticsObject ModelingRefactoring
Equivalence notions for object models are usually too concrete in the sense that they assume that the compared models are formed by elements with the same names. This is not adequate in several situations: during model refactoring, when using auxiliary model elements, or when the compared models comprise distinct but corresponding elements. So, in this paper, we propose a more abstract and language-independent equivalence notion for object models. It supports, as desired, abstraction from names and elements when comparing models. We use the PVS system to specify and prove properties of our notion. It is illustrated here by comparing simple models in Alloy, a formal object-oriented modeling language, but has also been applied for deriving a comprehensive set of algebraic laws for Alloy.
13
The unified Modeling Language User Guide
Geoff Glasson · Linux journal · 1999 · 3.3K citations
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Refactoring improving the design of existing code
Mauricio A. Saca · 2017 · 2.1K citations
Alfred Tarski · Journal of Symbolic Logic · 1941 · 813 citations
Humanities, Mathematics, Philosophy +13
The Z notation: A reference manual
Jan Madey · Science of Computer Programming · 1990 · 561 citations