The following pages link to OBJ3 (Q17510):
Displaying 50 items.
- 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)
- A scalable module system (Q391632) (← links)
- An axiomatic approach to structuring specifications (Q428861) (← links)
- A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
- A Maude environment for CafeOBJ (Q520244) (← links)
- On the algebra of structured specifications (Q549182) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- The formal specification of safety requirements for storing explosives (Q684392) (← links)
- Institution morphisms (Q699929) (← links)
- Behavioral abstraction is hiding information (Q703529) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Formal specification of topological subdivisions using hypermaps (Q805200) (← links)
- Invariant-driven specifications in Maude (Q838161) (← links)
- Quasi-Boolean encodings and conditionals in algebraic specification (Q844886) (← links)
- Creol: A type-safe object-oriented model for distributed concurrent systems (Q854164) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Algorithm theories and design tactics (Q918221) (← links)
- An overview of the K semantic framework (Q987974) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- An encoding of partial algebras as total algebras (Q990084) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Constructing specification morphisms (Q1322845) (← links)
- Normal form approach to compiler design (Q1323320) (← links)
- OBSCURE, a specification language for abstract data types (Q1323328) (← links)
- Gordon's computer: A hardware verification case study in OBJ3 (Q1329091) (← links)
- Verifying a distributed list system: A case history (Q1355754) (← links)
- Essential concepts of algebraic specification and program development (Q1377322) (← links)
- Program tactics and logic tactics (Q1380427) (← links)
- Order-sorted algebraic specifications with higher-order functions (Q1391097) (← links)
- May I borrow your logic? (Transporting logical structures along maps) (Q1391728) (← links)
- Abstract data type systems (Q1391729) (← links)
- A hidden agenda (Q1575735) (← links)
- Maude: specification and programming in rewriting logic (Q1608917) (← links)
- Logical foundations of CafeOBJ (Q1608919) (← links)
- Equational rules for rewriting logic (Q1608925) (← 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)
- Algebraic models of microprocessors architecture and organisation (Q1815999) (← links)
- CASL: the Common Algebraic Specification Language. (Q1853453) (← links)
- Relating CASL with other specification languages: the institution level. (Q1853458) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- A hidden Herbrand theorem: Combining the object and logic paradigms (Q1858427) (← links)
- Structured theories and institutions (Q1884906) (← links)
- Category-based modularisation for equational logic programming (Q1901708) (← links)
