Relative Equational Specification and Semantics
نویسنده
چکیده
Standard concepts of initial and final algebra semantics are generalised in a modular hierarchical manner. The resulting relative formalism allows a unified view on the relationship between initial and final algebra semantics and gives a dualised notion of consistency. Using this, a modular hierarchical approach to proof by consistency is taken by which only top-level equations need be considered at any level. The formalism also allows non-homogeneous specification schemes and different proof methods at each level.
منابع مشابه
Towards Behavioral Maude: Behavioral Membership Equational Logic
How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80’s, and further developed into the hidden-sorted logic approach by researchers at Oxford, UC San Diego, and Kanazawa offers some attractive answers, and has been i...
متن کاملEquational Specification of Dynamic Objects
An equational language to specify object-oriented conceptual models is defined. Objects are considered to be characterized by a unique object identifier and have static and dynamic structure. Examples of static structure are classification, aggregation, generalization and grouping, examples of dynamic structure are events, processes, local (intra-object) and global (inter-object) and communicat...
متن کاملAn Equational Specification for the Scheme Language
This work describes the formal semantics of Scheme as an equational theory in the Maude rewriting system. The semantics is based on continuations and is highly modular. We briefly investigate the relationship between our methodology for defining programming languages and other semantic formalisms. We conclude by showing some performance results of the interpreter obtained for free from the exec...
متن کاملA quick ITP tutorial
The ITP tool is an experimental inductive theorem prover for proving properties of Maude equational specifications, i.e., specifications in membership equational logic with an initial algebra semantics. The ITP tool has been written entirely in Maude and is in fact an executable specification of the formal inference system that it implements.
متن کاملAn Inductive Programming Approach to Algebraic Specification
Inductive machine learning suggests an alternative approach to the algebraic specification of software systems: rather than using test cases to validate an existing specification we use the test cases to induce a specification. In the algebraic setting test cases are ground equations that represent specific aspects of the desired system behavior or, in the case of negative test cases, represent...
متن کامل