CafeOBJ

swMATH6232MaRDI QIDQ18366FDOQ18366

Author name not available (Why is that?)

Official website: http://www.ldl.jaist.ac.jp/cafeobj/

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

• The rewriting logic semantics project: a progress report
• Theoretical Aspects of Computing – ICTAC 2005
• Operational termination of membership equational programs: the order-sorted way
• Transformation techniques for context-sensitive rewrite systems
• A Modular Equational Generalization Algorithm
• Strict coherence of conditional rewriting modulo axioms
• Title not available (Why is that?)
• Category-based constraint logic
• Title not available (Why is that?)
• Equational formulas and pattern operations in initial order-sorted algebras
• Equational formulas and pattern operations in initial order-sorted algebras
• Title not available (Why is that?)
• Foundations for structuring behavioural specifications
• A Transformational Approach to Prove Outermost Termination Automatically
• Structural induction in institutions
• Maude's module algebra
• A rewriting logic approach to operational semantics
• Title not available (Why is that?)
• Domain engineering
• Foundations of Software Science and Computation Structures
• Generate \& check method for verifying transition systems in CafeOBJ
• Automatic synthesis of logical models for order-sorted first-order theories
• Principles of proof scores in CafeOBJ
• Structured theories and institutions
• Title not available (Why is that?)
• Term Rewriting and Applications
• Matching logic
• Towards Formal Fault Tree Analysis Using Theorem Proving
• Logical foundations of CafeOBJ
• Computationally Equivalent Elimination of Conditions
• A semantic approach to interpolation
• Proving termination in the context-sensitive dependency pair framework
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Domain science and engineering from computer science to the sciences of informatics. II: Science
• Integrating Maude into Hets
• Methods for proving termination of rewriting-based programming languages by transformation
• Interpolation in Grothendieck institutions
• Constructor-based observational logic
• Automated Reasoning
• Term Rewriting and Applications
• Automata, Languages and Programming
• Two algebraic byways from differential equations: Gröbner bases and quivers
• Order-sorted generalization
• An encoding of partial algebras as total algebras
• Completeness of context-sensitive rewriting
• Complete Categorical Deduction for Satisfaction as Injectivity
• Behavioral and coinductive rewriting
• Equational abstractions
• An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents
• Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
• Normal forms and normal theories in conditional rewriting
• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
• A modular order-sorted equational generalization algorithm
• Natural Rewriting for General Term Rewriting Systems
• Order-Sorted Rewriting and Congruence Closure
• Title not available (Why is that?)
• Grothendieck institutions
• Proving Behavioral Refinements of COL-specifications
• Behavioral abstraction is hiding information
• Rewriting logic: Roadmap and bibliography
• Relating CASL with other specification languages: the institution level.
• Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
• Title not available (Why is that?)
• A Maude environment for CafeOBJ
• Comorphisms of structured institutions
• Domain science and engineering from computer science to the sciences of informatics. I: Engineering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extra theory morphisms for institutions: Logical semantics for multi-paradigm languages
• A dependency pair framework for \(A \vee C\)-termination
• Twenty years of rewriting logic
• CiMPG+F: a proof generator and fixer-upper for CafeOBJ specifications
• Proving operational termination of membership equational programs
• An Institution-independent Generalization of Tarski's Elementary Chain Theorem
• Bisimulation and Hidden Algebra
• Semantic foundations for generalized rewrite theories
• Foundations of algebraic specification and formal software development.
• Specification of real-time and hybrid systems in rewriting logic
• Title not available (Why is that?)
• Behavioural reasoning for conditional equations
• Coinduction for preordered algebra
• Quasi-Boolean encodings and conditionals in algebraic specification
• HasCasl
• Title not available (Why is that?)
• Vivid
• CASL
• OBJ3
• CIRC
• Maude
• 2OBJ
• Kumo
• Hets
• MMT
• VESTA
• AProVE
• PMaude
• PVeStA
• PAGODA
• CSI
• CRC 3

This page was built for software: CafeOBJ