An Abstract Equivalence Notion for Object Models | Zendy

Rohit Gheyi | Zendy; Tiago Massoni | Zendy; Paulo Borba | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Abstract Equivalence Notion for Object Models

Author(s) -

Rohit Gheyi,

Tiago Massoni,

Paulo Borba

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.03.002

Subject(s) - equivalence (formal languages) , computer science , code refactoring , programming language , abstraction , theoretical computer science , logical equivalence , modeling language , object (grammar) , set (abstract data type) , simple (philosophy) , algebra over a field , mathematics , artificial intelligence , discrete mathematics , pure mathematics , software , philosophy , epistemology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research