Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Theoretical Computer Science
Swinging types = functions + relations + transition systems
Theoretical Computer Science
Algebraic specification of abstract data types
Handbook of logic in computer science
Observational proofs by rewriting
Theoretical Computer Science
Algebraic Specification and Program Development by Stepwise Refinement
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Observational logic, constructor-based logic, and their duality
Theoretical Computer Science - Foundations of software science and computation structures
Hidden coinduction: behavioural correctness proofs for objects
Mathematical Structures in Computer Science
Closure properties for the class of behavioral models
Theoretical Computer Science
Behavioural reasoning for conditional equations
Mathematical Structures in Computer Science
Foundations of Algebraic Specification and Formal Software Development
Foundations of Algebraic Specification and Formal Software Development
Refinement by Interpretation in a General Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In the algebraic specification of software systems, it is desirable to have freedom in the implementation process, namely for the software reuse. In this paper we will discuss two issues in order to achieve this freedom: we study the observational stepwise refinement process and we propose an alternative formalization of the refinement concept based on the logical translation from the abstract algebraic logic. In the first topic, we go beyond the traditional assumption of maintaining the set of observable sorts during the refinement process by the possibility of changing it between the process steps, i.e., we analise the stepwise refinement with encapsulation and desencapsulation of sorts during the process. In the second topic, we suggest a formalization of the refinement concept where an equation may be mapped into a set of equations, against the refinements based on signature morphisms, where an equation is mapped into another one.