ITP

swMATH9808MaRDI QIDQ21787

No author found.

Related Items (30)

Algebraic simulations ⋮ Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic ⋮ The rewriting logic semantics project ⋮ Metalevel algorithms for variant satisfiability ⋮ On First-Order Model-Based Reasoning ⋮ Principles of proof scores in CafeOBJ ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ Verification of the ROS NavFn planner using executable specification languages ⋮ From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories ⋮ A modular order-sorted equational generalization algorithm ⋮ A metamodel of access control for distributed environments: applications and properties ⋮ Theoretical Aspects of Computing – ICTAC 2005 ⋮ Term Rewriting and Applications ⋮ Equational abstractions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Proof Search for the First-Order Connection Calculus in Maude ⋮ Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories ⋮ Unnamed Item ⋮ All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. ⋮ Integrating Maude into Hets ⋮ Proving semantic properties as first-order satisfiability ⋮ A Modular Equational Generalization Algorithm ⋮ Programming and symbolic computation in Maude ⋮ Metalevel Algorithms for Variant Satisfiability ⋮ Order-Sorted Generalization ⋮ A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems ∗ ⋮ Deduction, Strategies, and Rewriting

This page was built for software: ITP