On the public citation graph

Processes, Terms and Cycles: Steps on the Road to Infinity

https://doi.org/10.1007/11601548
0 signed · 110 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.1995.1075openalex-snapshot
Transfinite Reductions in Orthogonal Term Rewriting Systems
inferredcites →https://doi.org/10.1006/inco.1997.2651openalex-snapshot
Lambda Calculus with Explicit Recursion
inferredcites →https://doi.org/10.1006/inco.1997.2683openalex-snapshot
Diagram Techniques for Confluence
inferredcites →https://doi.org/10.1006/inco.1999.2824openalex-snapshot
Bisimilarity in Term Graph Rewriting
inferredcites →https://doi.org/10.1006/inco.2000.2876openalex-snapshot
Descendants and Origins in Term Rewriting
inferredcites →https://doi.org/10.1006/jsco.1996.0002openalex-snapshot
Comparing Curried and Uncurried Rewriting
inferredcites →https://doi.org/10.1007/3-540-11494-7_3openalex-snapshot
A formalized proof system for total correctness of while programs
inferredcites →https://doi.org/10.1007/3-540-12896-4_353openalex-snapshot
Algebraic tools for system construction
inferredcites →https://doi.org/10.1007/3-540-13345-3_7openalex-snapshot
The algebra of recursively defined processes and the algebra of regular processes
inferredcites →https://doi.org/10.1007/3-540-15670-4_4openalex-snapshot
Process algebra with asynchronous communication mechanisms
inferredcites →https://doi.org/10.1007/3-540-17220-3_8openalex-snapshot
Term rewriting systems with priorities
inferredcites →https://doi.org/10.1007/3-540-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
inferredcites →https://doi.org/10.1007/3-540-52531-9_132openalex-snapshot
On the power of subsumption and context checks
inferredcites →https://doi.org/10.1007/3-540-53904-2_120openalex-snapshot
Open problems in rewriting
inferredcites →https://doi.org/10.1007/3-540-54317-1_79openalex-snapshot
Extended term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56868-9_39openalex-snapshot
More problems in rewriting
inferredcites →https://doi.org/10.1007/3-540-57887-0_114openalex-snapshot
Syntactic definitions of undefined: On defining the undefined
inferredcites →https://doi.org/10.1007/3-540-59200-8_82openalex-snapshot
Problems in rewriting III
inferredcites →https://doi.org/10.1007/3-540-61254-8_19openalex-snapshot
Collapsing partial combinatory algebras
inferredcites →https://doi.org/10.1007/978-1-4471-2120-6_1openalex-snapshot
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
inferredcites →https://doi.org/10.1007/978-1-4757-3661-8_3openalex-snapshot
Term Rewriting Systems
inferredcites →https://doi.org/10.1007/bfb0012754openalex-snapshot
Algebraic specifications for parametrized data types with minimal parameter and target algebras
inferredcites →https://doi.org/10.1007/bfb0013021openalex-snapshot
Process theory based on bisimulation semantics
inferredcites →https://doi.org/10.1007/bfb0025776openalex-snapshot
Correctness of programs with function procedures
inferredcites →https://doi.org/10.1007/bfb0032044openalex-snapshot
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
inferredcites →https://doi.org/10.1016/0020-0190(94)90034-5openalex-snapshot
Modularity of confluence: A simplified proof
inferredcites →https://doi.org/10.1016/0022-0000(86)90033-4openalex-snapshot
Conditional rewrite rules: Confluence and termination
inferredcites →https://doi.org/10.1016/0304-3975(79)90004-5openalex-snapshot
Church-Rosser strategies in the lambda calculus
inferredcites →https://doi.org/10.1016/0304-3975(80)90032-8openalex-snapshot
Invertible terms in the lambda calculus
inferredcites →https://doi.org/10.1016/0304-3975(84)90065-3openalex-snapshot
Proving program inclusion using Hoare's logic
inferredcites →https://doi.org/10.1016/0304-3975(84)90114-2openalex-snapshot
Linear time and branching time semantics for recursion with merge
inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
inferredcites →https://doi.org/10.1016/0304-3975(87)90052-1openalex-snapshot
On the consistency of Koomen's Fair Abstraction Rule
inferredcites →https://doi.org/10.1016/0304-3975(89)90006-6openalex-snapshot
Term-rewriting systems with rule priorities
inferredcites →https://doi.org/10.1016/0304-3975(91)90004-lopenalex-snapshot
An analysis of loop checking mechanisms for logic programs
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/0890-5401(87)90001-0openalex-snapshot
Needed reduction and spine strategies for the lambda calculus
inferredcites →https://doi.org/10.1016/0890-5401(89)90014-xopenalex-snapshot
Unique normal forms for lambda calculus with surjective pairing
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0049-237x(09)70651-2openalex-snapshot
A Complete Inference System for Regular Processes with Silent Moves
inferredcites →https://doi.org/10.1016/s0167-9260(83)80018-2openalex-snapshot
A proof rule for restoring logic circuits
inferredcites →https://doi.org/10.1016/s0304-3975(96)00171-5openalex-snapshot
Infinitary lambda calculus
inferredcites →https://doi.org/10.1016/s0747-7171(08)80124-1openalex-snapshot
Sequentiality in orthogonal term rewriting systems
inferredcites →https://doi.org/10.1016/s1385-7258(76)80001-7openalex-snapshot
Representability In Lambda Algebras
inferredcites →https://doi.org/10.1016/s1571-0661(05)80463-3openalex-snapshot
Confluent rewriting of bisimilar term graphs
inferredcites →https://doi.org/10.1017/cbo9780511608841.002openalex-snapshot
An introduction to process algebra
inferredcites →https://doi.org/10.1017/s0960129599002832openalex-snapshot
Extending partial combinatory algebras
inferredcites →https://doi.org/10.1093/comjnl/30.6.498openalex-snapshot
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
inferredcites →https://doi.org/10.1093/logcom/10.3.437openalex-snapshot
A geometric proof of confluence by decreasing diagrams
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0001openalex-snapshot
Term Rewriting Systems
inferredcites →https://doi.org/10.1109/lics.1992.185528openalex-snapshot
Asynchronous communication in process algebra
inferredcites →https://doi.org/10.1109/lics.1994.316066openalex-snapshot
Cyclic lambda graph rewriting
inferredcites →https://doi.org/10.1109/lics.1996.561461openalex-snapshot
Completing partial combinatory algebras with unique head-normal forms
inferredcites →https://doi.org/10.1137/0217073openalex-snapshot
Readies and Failures in the Algebra of Communicating Processes
inferredcites →https://doi.org/10.1145/177492.177577openalex-snapshot
On the adequacy of graph rewriting for simulating term rewriting
inferredcites →https://doi.org/10.1145/227683.227689openalex-snapshot
Termination for direct sums of left-linear complete term rewriting systems
inferredcites →https://doi.org/10.1515/9783112733417-002openalex-snapshot
Verification of an alternating bit protocol by means of process algebra
inferredcites →https://doi.org/10.2307/2271947openalex-snapshot
Degrees of sensible lambda theories
inferredcites →https://doi.org/10.3233/fi-1986-9202openalex-snapshot
Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra1
inferredcites →https://doi.org/10.3233/fi-1996-263401openalex-snapshot
EQUATIONAL TERM GRAPH REWRITING

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11841883_13openalex-snapshot
Process Bisimulation Via a Graphical Encoding
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_22openalex-snapshot
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms
inferred← citeshttps://doi.org/10.1007/978-3-319-09719-0_17openalex-snapshot
The Henkin Sentence
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_2openalex-snapshot
Ugo Montanari and Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_54openalex-snapshot
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_5openalex-snapshot
Reduction Strategies and Acyclicity
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_12openalex-snapshot
Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_14openalex-snapshot
Is Observational Congruence Axiomatisable in Equational Horn Logic?
inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_16openalex-snapshot
Query Completeness of Skolem Machine Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-75144-1_8openalex-snapshot
Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_14openalex-snapshot
Skolem Machines and Geometric Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-75698-9_19openalex-snapshot
Action Abstraction in Timed Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_24openalex-snapshot
RPO, Second-Order Contexts, and λ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_27openalex-snapshot
Non Expansive ε-Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_12openalex-snapshot
Embedding and Confluence of Graph Transformations with Negative Application Conditions
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_15openalex-snapshot
High-Level Programs and Program Conditions
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_10openalex-snapshot
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_40openalex-snapshot
Modelling and Verifying Mobile Systems Using π-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_17openalex-snapshot
Comparing Böhm-Like Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_9openalex-snapshot
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_11openalex-snapshot
Deriving Syntax and Axioms for Quantitative Regular Behaviours
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_38openalex-snapshot
On Bisimilarity and Substitution in Presence of Replication
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_25openalex-snapshot
Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_11openalex-snapshot
Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_22openalex-snapshot
Local Confluence for Rules with Nested Application Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_22openalex-snapshot
Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_4openalex-snapshot
Axiomatizing Weak Ready Simulation Semantics over BCCSP
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_12openalex-snapshot
The Equational Theory of Weak Complete Simulation Semantics over BCCSP
inferred← citeshttps://doi.org/10.1007/978-3-642-33386-6_31openalex-snapshot
A Probabilistic Kleene Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-40206-7_5openalex-snapshot
Exploiting Algebraic Laws to Improve Mechanized Axiomatizations
inferred← citeshttps://doi.org/10.1007/s11334-024-00587-wopenalex-snapshot
Empowering model repair: a rule-based approach to graph repair without side effects—extended version
inferred← citeshttps://doi.org/10.1016/j.aim.2012.05.010openalex-snapshot
Higher-dimensional normalisation strategies for acyclicity
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.004openalex-snapshot
Parallel Processes with Implicit Computational Capital
inferred← citeshttps://doi.org/10.1016/j.ic.2006.03.003openalex-snapshot
Splitting bisimulations and retrospective conditions
inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.006openalex-snapshot
Making random choices invisible to the scheduler
inferred← citeshttps://doi.org/10.1016/j.ic.2011.01.007openalex-snapshot
Infinitary Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104606openalex-snapshot
Unique solutions of contractions, CCS, and their HOL formalisation
inferred← citeshttps://doi.org/10.1016/j.scico.2011.09.004openalex-snapshot
Formal modeling of evolving self-adaptive systems
inferred← citeshttps://doi.org/10.1016/j.scico.2018.10.007openalex-snapshot
Bisimilarity of open terms in stream GSOS
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.018openalex-snapshot
Calculi, types and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.024openalex-snapshot
Access control in mobile ambient calculi: A comparative view
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.032openalex-snapshot
Security types for dynamic web data
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.03.013openalex-snapshot
Axiomatizing weak simulation semantics over BCCSP
inferred← citeshttps://doi.org/10.1145/3161558openalex-snapshot
Typed Nominal Rewriting
inferred← citeshttps://doi.org/10.1145/3479394.3479403openalex-snapshot
Confluence in Non-Left-Linear Untyped Higher-Order Rewrite Theories
inferred← citeshttps://doi.org/10.4204/eptcs.225.6openalex-snapshot
Reasoning about Graph Programs
inferred← citeshttps://doi.org/10.4204/eptcs.82.1openalex-snapshot
The Design of GP 2
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:35)2022openalex-snapshot
On sets of terms having a given intersection type
inferred← citeshttps://doi.org/10.5555/2050655.2050681openalex-snapshot
Semantic clone detection for model-based development of embedded systems
inferred← citeshttps://doi.org/10.70675/ab8c4538zf338z4b1dzb5c4z539a6179abc8openalex-snapshot
A study on the expressive power of some fragments of the modal µ-calculus
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.