On the public citation graph

Specification and proof in membership equational logic

https://doi.org/10.1007/bfb0030589
0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1056openalex-snapshot
Equational Formulas with Membership Constraints
inferredcites →https://doi.org/10.1006/jsco.1994.1049openalex-snapshot
Tree Automata Help One To Solve Equational Formulae In AC-Theories
inferredcites →https://doi.org/10.1006/jsco.1996.0076openalex-snapshot
Automated Theorem Proving by Test Set Induction
inferredcites →https://doi.org/10.1007/3-540-51081-8_101openalex-snapshot
Inductive proofs by specification transformations
inferredcites →https://doi.org/10.1007/3-540-55160-3_49openalex-snapshot
Parallel programming in maude
inferredcites →https://doi.org/10.1007/3-540-55719-9_91openalex-snapshot
Completion of rewrite systems with membership constraints
inferredcites →https://doi.org/10.1007/3-540-56868-9_25openalex-snapshot
Encompassment properties and automata with constraints
inferredcites →https://doi.org/10.1007/3-540-57785-8_138openalex-snapshot
Ground reducibility and automata with disequality constraints
inferredcites →https://doi.org/10.1007/3-540-58201-0_89openalex-snapshot
Dynamically-typed computations for order-sorted equational presentations
inferredcites →https://doi.org/10.1007/3-540-61377-3_51openalex-snapshot
Equivalences among various logical frameworks of partial algebras
inferredcites →https://doi.org/10.1007/bfb0015747openalex-snapshot
Operational semantics for order-sorted algebra
inferredcites →https://doi.org/10.1007/bfb0030589openalex-snapshot
Specification and proof in membership equational logic
inferredcites →https://doi.org/10.1007/bfb0059396openalex-snapshot
Lokal präsentierbare Kategorien
inferredcites →https://doi.org/10.1007/bfb0059404openalex-snapshot
Lokal α-präsentierbare Kategorien
inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot
Conditional rewrite rules
inferredcites →https://doi.org/10.1016/0304-3975(90)90064-oopenalex-snapshot
A rationale for conditional equational programming
inferredcites →https://doi.org/10.1016/0304-3975(92)90302-vopenalex-snapshot
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
inferredcites →https://doi.org/10.1016/0743-1066(92)90027-zopenalex-snapshot
Programming with equalities, subsorts, overloading, and parametrization in OBJ
inferredcites →https://doi.org/10.1016/s1571-0661(04)00034-9openalex-snapshot
Principles of Maude
inferredcites →https://doi.org/10.1145/318593.318610openalex-snapshot
Principles of OBJ2
inferredcites →https://doi.org/10.1515/9783112573426openalex-snapshot
Initial Computability, Algebraic Specifications, and Partial Algebras

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-49253-4_15openalex-snapshot
Term Rewriting in a Logic of Special Relations
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_27openalex-snapshot
Algebraic Specifications, Higher-Order Types and Set-Theoretic Models
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_26openalex-snapshot
Membership algebra as a logical framework for equational specification
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_27openalex-snapshot
Mapping tile logic into rewriting logic
inferred← citeshttps://doi.org/10.1007/978-3-031-65941-6_8openalex-snapshot
Specifying Fairness Constraints and Model Checking with Non-intensional Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_27openalex-snapshot
Twenty Years Later
inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_16openalex-snapshot
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_25openalex-snapshot
Towards a Verification Logic for Rewriting Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_10openalex-snapshot
Research Directions in Rewriting Logic
inferred← citeshttps://doi.org/10.1007/bfb0017445openalex-snapshot
AC-unification of higher-order patterns
inferred← citeshttps://doi.org/10.1007/s00165-003-0017-2openalex-snapshot
Redesign of a Systems Engineering Language: Formalisation of χ
inferred← citeshttps://doi.org/10.1007/s10515-021-00307-9openalex-snapshot
Model checking strategy-controlled systems in rewriting logic
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100700openalex-snapshot
Strategies, model checking and branching-time properties in Maude
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100719openalex-snapshot
A probabilistic approximate logic for neuro-symbolic learning and reasoning
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00357-7openalex-snapshot
Rewriting logic: roadmap and bibliography
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00206-6openalex-snapshot
Specification and proof in membership equational logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00034-9openalex-snapshot
Principles of Maude
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00037-4openalex-snapshot
Reflection and Strategies in Rewriting Logic1 1Supported by Office of Naval Research Contracts N00014-95-C-0225 and N00014-96-C-0114, National Science Foundation Grant CCR-9224005, and by the Information Technology Promotion Agency, Japan, as a part of the Industrial Science and Technology…
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00040-4openalex-snapshot
Rewriting Logic as a Logical and Semantic Framework1 1This paper is a short version of [36], where the reader can find more examples and details not discussed here.
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80013-1openalex-snapshot
Rewriting Logic as a Logic of Special Relations
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80020-9openalex-snapshot
Metalevel Computation in Maude
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80024-6openalex-snapshot
Membership Equational Logic, Calculus of Inductive Constructions, and Rewrite Logic (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80760-1openalex-snapshot
A Logic for Modular Descriptions of Asynchronous and Synchronized Concurrent Systems
inferred← citeshttps://doi.org/10.1080/00222933608655221openalex-snapshot
L.—Five new species of ant (Formicidæ) from various localities
inferred← citeshttps://doi.org/10.1109/lics.1997.614920openalex-snapshot
Automata-driven automated induction
inferred← citeshttps://doi.org/10.29007/l7kxopenalex-snapshot
Pandora's Box
inferred← citeshttps://doi.org/10.48550/arxiv.1907.11321openalex-snapshot
Probabilistic Approximate Logic and its Implementation in the Logical Imagination Engine
inferred← citeshttps://doi.org/10.5381/jot.2011.10.1.a5openalex-snapshot
A Rewriting Logic Semantics for ATL.
inferred← citeshttps://doi.org/10.6100/ir552381openalex-snapshot
Formal specification and analysis of industrial systems
showing the first 29 of 30 · page through all 30
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.