Pages that link to "Item:Q2715825"
From MaRDI portal
The following pages link to CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification (Q2715825):
Displaying 50 items.
- Behavioral equivalence of hidden \(k\)-logics: an abstract algebraic approach (Q301373) (← links)
- Functorial semantics of first-order views (Q344796) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Parameterisation for abstract structured specifications (Q387996) (← links)
- Foundations for structuring behavioural specifications (Q406465) (← links)
- An axiomatic approach to structuring specifications (Q428861) (← links)
- A Maude environment for CafeOBJ (Q520244) (← links)
- On the algebra of structured specifications (Q549182) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Behavioral abstraction is hiding information (Q703529) (← links)
- Structural induction in institutions (Q719243) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Algebraic simulations (Q844884) (← links)
- Quasi-Boolean encodings and conditionals in algebraic specification (Q844886) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- Equational abstractions (Q944377) (← links)
- An encoding of partial algebras as total algebras (Q990084) (← links)
- Saturated models in institutions (Q992038) (← links)
- A semantic approach to interpolation (Q1006639) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- A hidden agenda (Q1575735) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Maude: specification and programming in rewriting logic (Q1608917) (← links)
- Logical foundations of CafeOBJ (Q1608919) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Specification of real-time and hybrid systems in rewriting logic (Q1608921) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- On combining algebraic specifications with first-order logic via Athena (Q1697091) (← links)
- Relating CASL with other specification languages: the institution level. (Q1853458) (← links)
- Relaxed models for rewriting logic (Q1853590) (← links)
- A hidden Herbrand theorem: Combining the object and logic paradigms (Q1858427) (← links)
- Structured theories and institutions (Q1884906) (← links)
- Interpolation in Grothendieck institutions (Q1884940) (← links)
- Principles of proof scores in CafeOBJ (Q1929233) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Observational interpretations of hybrid dynamic logic with binders and silent transitions (Q1979970) (← links)
- Introducing \(H\), an institution-based formal specification and verification language (Q2183716) (← links)
- Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally (Q2254574) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- Foundations of logic programming in hybrid logics with user-defined sharing (Q2358621) (← links)
- Constructor-based observational logic (Q2369030) (← links)
- Ultraproducts and possible worlds semantics in institutions (Q2373712) (← links)
- A modular order-sorted equational generalization algorithm (Q2437800) (← links)
