On the public citation graph

Decidable approximations of sets of descendants and sets of normal forms

https://doi.org/10.1007/bfb0052368
0 signed · 99 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/jsco.1995.1036openalex-snapshot
Modular Properties of Composable Term Rewriting Systems
inferredcites →https://doi.org/10.1007/3-540-15984-3_291openalex-snapshot
Completeness in data type specifications
inferredcites →https://doi.org/10.1007/3-540-16780-3_85openalex-snapshot
Sufficient completeness, term rewriting systems and ”anti-unification”
inferredcites →https://doi.org/10.1007/3-540-53904-2_104openalex-snapshot
Bottom-up tree pushdown automata and rewrite systems
inferredcites →https://doi.org/10.1007/3-540-61464-8_65openalex-snapshot
Decidable approximations of term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-62950-5_68openalex-snapshot
Proving innermost normalisation automatically
inferredcites →https://doi.org/10.1007/bf00292110openalex-snapshot
On sufficient-completeness and related properties of term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0009650openalex-snapshot
A decidability result about sufficient-completeness of axiomatically specified abstract data types
inferredcites →https://doi.org/10.1007/bfb0030601openalex-snapshot
Termination proofs using gpo ordering constraints
inferredcites →https://doi.org/10.1007/bfb0030602openalex-snapshot
Automatically proving termination where simplification orderings fail
inferredcites →https://doi.org/10.1007/bfb0030616openalex-snapshot
E-unification by means of tree tuple synchronized grammars
inferredcites →https://doi.org/10.1007/bfb0036486openalex-snapshot
A decidability result about sufficient-completeness of axiomatically specified abstract data types
inferredcites →https://doi.org/10.1007/bfb0052368openalex-snapshot
Decidable approximations of sets of descendants and sets of normal forms
inferredcites →https://doi.org/10.1016/0020-0190(90)90221-iopenalex-snapshot
Modular term rewriting systems and the termination
inferredcites →https://doi.org/10.1016/0022-0000(88)90014-1openalex-snapshot
Deterministic tree pushdown automata and monadic tree rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(85)90089-1openalex-snapshot
Reductions in tree replacement systems
inferredcites →https://doi.org/10.1016/0304-3975(94)00275-4openalex-snapshot
Natural termination
inferredcites →https://doi.org/10.1109/lics.1990.113750openalex-snapshot
The theory of ground rewrite systems is decidable
inferredcites →https://doi.org/10.3233/fi-1995-24127openalex-snapshot
REGULAR TREE LANGUAGES AND REWRITE SYSTEMS

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2000.2874openalex-snapshot
The Combinator S
inferred← citeshttps://doi.org/10.1006/inco.2002.3157openalex-snapshot
Decidability for Left-Linear Growing Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/10721959_21openalex-snapshot
Rewriting for Cryptographic Protocol Verification
inferred← citeshttps://doi.org/10.1007/10721975_2openalex-snapshot
Tree Automata and Term Rewrite Systems
inferred← citeshttps://doi.org/10.1007/11805618_10openalex-snapshot
Feasible Trace Reconstruction for Rewriting Approximations
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_26openalex-snapshot
A Static Analysis Technique for Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_10openalex-snapshot
Regular Sets of Descendants by Some Rewrite Strategies
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_8openalex-snapshot
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_48openalex-snapshot
Reachability Analysis of Term Rewriting Systems with Timbuk
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_4openalex-snapshot
Approximating the Behaviour of Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_10openalex-snapshot
Regular Sets of Descendants for Constructor-Based Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_10openalex-snapshot
Abstracting Cryptographic Protocols with Tree Automata
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_40openalex-snapshot
Homomorphisms and concurrent term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_22openalex-snapshot
Decidability for Left-Linear Growing Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_11openalex-snapshot
The Recognizability Problem for Tree Automata with Comparisons between Brothers
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_19openalex-snapshot
Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_6openalex-snapshot
SAT-Based Automated Completion for Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_28openalex-snapshot
Reachability Analysis with State-Compatible Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_8openalex-snapshot
Towards Static Analysis of Functional Programs Using Tree Automata Completion
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_51openalex-snapshot
Towards More Precise Rewriting Approximations
inferred← citeshttps://doi.org/10.1007/978-3-319-24537-9_12openalex-snapshot
Over-Approximating Terms Reachable by Context-Sensitive Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-99840-4openalex-snapshot
Rewriting Logic and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-99840-4_14openalex-snapshot
Approximating Any Logic Program by a CS-Program
inferred← citeshttps://doi.org/10.1007/978-3-319-99840-4_9openalex-snapshot
Extending Timbuk to Verify Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_26openalex-snapshot
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-40981-6_5openalex-snapshot
Automatic Approximation for the Verification of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_43openalex-snapshot
Certifying a Tree Automata Completion Checker
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_21openalex-snapshot
Proving Termination of Rewrite Systems Using Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_6openalex-snapshot
Rewriting Approximations for Fast Prototyping of Static Analyzers
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_6openalex-snapshot
Towards an Efficient Implementation of Tree Automata Completion
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_33openalex-snapshot
Termination of Priority Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_26openalex-snapshot
Beyond Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_20openalex-snapshot
Declarative Debugging of Rewriting Logic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_9openalex-snapshot
How to Tackle Integer Weighted Automata Positivity
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_38openalex-snapshot
CSI – A Confluence Tool
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_8openalex-snapshot
Characterizing Conclusive Approximations by Logical Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_22openalex-snapshot
Equational Abstraction Refinement for Certified Tree Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_22openalex-snapshot
Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering
inferred← citeshttps://doi.org/10.1007/s10817-004-6246-0openalex-snapshot
Reachability Analysis over Term Rewriting Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.07.016openalex-snapshot
Context-Free Tree Languages for Descendants
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.002openalex-snapshot
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.04.004openalex-snapshot
A Framework for Developing Stand-Alone Certifiers
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.007openalex-snapshot
On tree automata that certify termination of left-linear term rewriting systems
inferred← citeshttps://doi.org/10.1016/j.ic.2006.12.006openalex-snapshot
Alternating two-way AC-tree automata
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.002openalex-snapshot
A framework for the verification of infinite-state graph transformation systems
inferred← citeshttps://doi.org/10.1016/j.ic.2009.02.010openalex-snapshot
Match-bounds revisited
inferred← citeshttps://doi.org/10.1016/j.ic.2016.06.011openalex-snapshot
Reachability, confluence, and termination analysis with state-compatible automata
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.03.008openalex-snapshot
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.05.003openalex-snapshot
Termination criteria for tree automata completion
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.10.003openalex-snapshot
Reversible computation in term rewriting
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.006openalex-snapshot
Reduction strategies in rewriting and programming
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.008openalex-snapshot
Tree automata for rewrite strategies
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.01.009openalex-snapshot
Equational approximations for tree automata completion
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.026openalex-snapshot
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00132-6openalex-snapshot
Abstracting cryptographic protocols with tree automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00357-7openalex-snapshot
Rewriting logic: roadmap and bibliography
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80658-3openalex-snapshot
Reachability in Conditional Term Rewriting Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80124-0openalex-snapshot
Termination and normalisation under strategy Proofs in ELAN
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82552-6openalex-snapshot
An Overview of ELAN
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82616-7openalex-snapshot
A Rewriting Strategy for Protocol Verification1 1Work partially supported by MURST 40% “Architetture Software per Infrastrutture di Rete ad Accesso Eterogeneo (SAHARA)”.
inferred← citeshttps://doi.org/10.1142/s0129054105003108openalex-snapshot
FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
inferred← citeshttps://doi.org/10.1145/1462179.1462182openalex-snapshot
Termination of rewriting under strategies
inferred← citeshttps://doi.org/10.1609/aaai.v39i14.33630openalex-snapshot
Sound Over-Approximation of Equational Reasoning with Variable-Preserving Rules Parameterized by Derivation Depth
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:19)2014openalex-snapshot
Modular Complexity Analysis for Term Rewriting
inferred← citeshttps://doi.org/10.4204/eptcs.21.9openalex-snapshot
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems
inferred← citeshttps://doi.org/10.4204/eptcs.414.2openalex-snapshot
An Overview of the Decentralized Reconfiguration Language Concerto-D through its Maude Formalization
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.277openalex-snapshot
Declarative Debugging of Missing Answers for Maude
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.385openalex-snapshot
Modular Complexity Analysis via Relative Complexity
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.187openalex-snapshot
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
inferred← citeshttps://doi.org/10.4230/lipics.rta.2015.177openalex-snapshot
Reachability Analysis of Innermost Rewriting
inferred← citeshttps://doi.org/10.4230/oasics.wpte.2014.39openalex-snapshot
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
inferred← citeshttps://doi.org/10.48550/arxiv.1203.1495openalex-snapshot
Tree Regular Model Checking for Lattice-Based Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1410.2901openalex-snapshot
Towards Static Analysis of Functional Programs using Tree Automata Completion
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00478openalex-snapshot
Proving Looping and Non-Looping Non-Termination by Finite Automata
inferred← citeshttps://doi.org/10.48550/arxiv.2003.01696openalex-snapshot
Sparse Tiling through Overlap Closures for Termination of String Rewriting
inferred← citeshttps://doi.org/10.4995/thesis/10251/139076openalex-snapshot
Formal Methods for Constraint-Based Testing and Reversible Debugging in Erlang
inferred← citeshttps://doi.org/10.70675/63d6f79fz8006z44b7za36cz0799f216b88aopenalex-snapshot
Analyse d'atteignabilité pour les programmes fonctionnels avec stratégie d'évaluation en profondeur
inferred← citeshttps://doi.org/10.70675/8e153fb0z54c9z4004z8b28za822c1e74a78openalex-snapshot
Automatic verification of higher-order functional programs using regular tree languages
inferred← citeshttps://doi.org/10.70675/ce5447cezb7f1z45c3zaa9az916e8f3dc4f5openalex-snapshot
Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité
showing the first 79 of 80 · page through all 80
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.