OBJ3

swMATH5370MaRDI QIDQ17510FDOQ17510

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Transformation techniques for context-sensitive rewrite systems
• Twenty years of rewriting logic
• Essential concepts of algebraic specification and program development
• An Object-Oriented Component Model for Heterogeneous Nets
• A Modular Equational Generalization Algorithm
• Strict coherence of conditional rewriting modulo axioms
• The formal specification of safety requirements for storing explosives
• An algebraic approach to compiler design
• May I borrow your logic? (Transporting logical structures along maps)
• Lax Theory Morphisms
• A scalable module system
• Partial derivatives of regular expressions and finite automaton constructions
• Proving operational termination of membership equational programs
• Formal specification of topological subdivisions using hypermaps
• A rewriting logic approach to operational semantics
• Bisimulation and Hidden Algebra
• Hidden coinduction: behavioural correctness proofs for objects
• Title not available (Why is that?)
• Order-Sorted Generalization
• Order-sorted algebraic specifications with higher-order functions
• Automatic synthesis of logical models for order-sorted first-order theories
• Principles of proof scores in CafeOBJ
• Structured theories and institutions
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
• Title not available (Why is that?)
• Termination of rewriting with strategy annotations
• An approach to object semantics based on terminal co-algebras
• Title not available (Why is that?)
• Logical foundations of CafeOBJ
• Computationally Equivalent Elimination of Conditions
• CASL: the Common Algebraic Specification Language.
• Title not available (Why is that?)
• Invariant-driven specifications in Maude
• A metamodel of access control for distributed environments: applications and properties
• Quasi-Boolean encodings and conditionals in algebraic specification
• Specification and proof in membership equational logic
• Methods for proving termination of rewriting-based programming languages by transformation
• Institution-independent model theory
• A survey of strategies in rule-based program transformation systems
• How to prove decidability of equational theories with second-order computation analyser SOL
• Normal form approach to compiler design
• Institution morphisms
• An encoding of partial algebras as total algebras
• A hidden agenda
• Behavioral and coinductive rewriting
• Functorial semantics of first-order views
• Parameterisation for abstract structured specifications
• Operational Termination of Membership Equational Programs: the Order-Sorted Way
• An axiomatic approach to structuring specifications
• Dependency pairs for proving termination properties of conditional term rewriting systems
• Title not available (Why is that?)
• On the algebra of structured specifications
• Lazy rewriting and context-sensitive rewriting
• An Oxford survey of order sorted algebra
• An overview of the K semantic framework
• Normal forms and normal theories in conditional rewriting
• Using CafeOBJ to mechanise refactoring proofs and application
• OBSCURE, a specification language for abstract data types
• Creol: A type-safe object-oriented model for distributed concurrent systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A modular order-sorted equational generalization algorithm
• Context-sensitive dependency pairs
• Maude: specification and programming in rewriting logic
• Operational termination of conditional term rewriting systems
• Lazy rewriting and eager machinery
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditional rewriting logic as a unified model of concurrency
• Institutions: abstract model theory for specification and programming
• Behavioral abstraction is hiding information
• Context-sensitive rewriting strategies
• Relating CASL with other specification languages: the institution level.
• Domain Endurants
• Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
• A Maude environment for CafeOBJ
• Equational rules for rewriting logic
• The role of logical interpretations in program development
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Behavioural specification for hierarchical object composition
• A hidden Herbrand theorem: Combining the object and logic paradigms
• FORMAL VALIDATION AND VERIFICATION OF ATOMIC RESOLUTION MICROSCOPE CONTROL AND TOPOGRAPHY
• Equational formulas and pattern operations in initial order-sorted algebras
• Title not available (Why is that?)
• Ground confluence of order-sorted conditional specifications modulo axioms
• Just-in-time: on strategy annotations
• Title not available (Why is that?)
• Recent Trends in Algebraic Development Techniques
• Rewriting, inference, and proof
• CafeOBJ Traces
• Towards a Combination of CafeOBJ and PAT
• Morphism axioms
• Category-based modularisation for equational logic programming
• First-Order Logic with Dependent Types
• On-demand strategy annotations revisited: an improved on-demand evaluation strategy
• Proving termination of context-sensitive rewriting by transformation
• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors

This page was built for software: OBJ3