ITP

swMATH9808MaRDI QIDQ21787FDOQ21787

Author name not available (Why is that?)

Cited In (30)

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

This page was built for software: ITP