On the public citation graph
Definable operations in general algebras, and the theory of automata and flowcharts
0 signed · 113 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1016/0004-3702(70)90002-0openalex-snapshot
The correctness of nondeterministic programs
inferredcites →https://doi.org/10.1016/s0019-9958(67)90670-5openalex-snapshot
Automata in general algebras
inferredcites →https://doi.org/10.1016/s0022-0000(69)80009-7openalex-snapshot
The correctness of programs
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.1145/321510.321516openalex-snapshot
Properties of Programs and the First-Order Predicate Calculus
inferredcites →https://doi.org/10.1145/800169.805434openalex-snapshot
Formalization of properties of recursively defined functions
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_26openalex-snapshot
Partially Commutative Inverse Monoids
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_30openalex-snapshot
Iteration Theories of Boolean Functions
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_20openalex-snapshot
Axiomatizing the Least Fixed Point Operation and Binary Supremum
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_17openalex-snapshot
Equational Axioms for Probabilistic Bisimilarity
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_34openalex-snapshot
On Guarding Nested Fixpoints
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_34openalex-snapshot
Efficient Analysis of Cyclic Definitions
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_24openalex-snapshot
Towards the semantics of the definitional language of MetaSoft
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_4openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_1openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_4openalex-snapshot
Modal μ-calculus, model checking and Gauß elimination
inferred← citeshttps://doi.org/10.1007/978-3-030-00389-0_5openalex-snapshot
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_2openalex-snapshot
C-Dioids and $$\mu $$-Continuous Chomsky-Algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_4openalex-snapshot
Modular Design of Domain-Specific Languages Using Splittings of Catamorphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-71500-7_8openalex-snapshot
An Abstract Contract Theory for Programs with Procedures
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_32openalex-snapshot
Make Flows Small Again: Revisiting the Flow Framework
inferred← citeshttps://doi.org/10.1007/978-3-032-03585-1_3openalex-snapshot
Renowned Theorems in Fixed Point Theory: Topological and Discrete Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_26openalex-snapshot
The mu-calculus and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_2openalex-snapshot
Operational Semantics of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_18openalex-snapshot
Parametric (Co)Iteration vs. Primitive Direcursion
inferred← citeshttps://doi.org/10.1007/978-3-540-88059-2_3openalex-snapshot
An Introduction to the Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_15openalex-snapshot
Iteration Grove Theories with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_4openalex-snapshot
Kleene Theorem in Partial Conway Theories with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_20openalex-snapshot
Operational Characterization of Scattered MCFLs
inferred← citeshttps://doi.org/10.1007/978-3-662-47709-0_13openalex-snapshot
Equational Properties of Stratified Least Fixed Points (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_2openalex-snapshot
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferred← citeshttps://doi.org/10.1007/bf00709155openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/bfb0028581openalex-snapshot
Axiomatizing the equational theory of regular tree languages
inferred← citeshttps://doi.org/10.1007/bfb0039698openalex-snapshot
A three-valued logic for refinement
inferred← citeshttps://doi.org/10.1007/bfb0055801openalex-snapshot
Gaußian elimination and a characterization of algebraic power series
inferred← citeshttps://doi.org/10.1007/s00233-008-9060-xopenalex-snapshot
Partially commutative inverse monoids
inferred← citeshttps://doi.org/10.1007/s00236-007-0049-9openalex-snapshot
Dual unbounded nondeterminacy, recursion, and fixpoints
inferred← citeshttps://doi.org/10.1016/0022-4049(80)90106-1openalex-snapshot
Varieties of chain-complete algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90078-0openalex-snapshot
On rational definitions in complete algebras without rank
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90006-xopenalex-snapshot
Two-level semantics and code generation
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90082-dopenalex-snapshot
An extensional fixed-point semantics for nondeterministic data flow
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90095-bopenalex-snapshot
A type-theoretical alternative to ISWIM, CUCH, OWHY
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00082-8openalex-snapshot
Relation-algebraic semantics
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50022-9openalex-snapshot
Modal Logics and mu-Calculi: An Introduction
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.032openalex-snapshot
Logical Specification and Analysis of Fault Tolerant Systems Through Partial Model Checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.011openalex-snapshot
Fairness, Resources, and Separation
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.011openalex-snapshot
A Connection Between Concurrency and Language Theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.008openalex-snapshot
Parametrized Fixed Points and Their Applications to Session Types
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.10.001openalex-snapshot
Axiomatizing the equational theory of regular tree languages
inferred← citeshttps://doi.org/10.1016/j.scico.2015.08.010openalex-snapshot
Algorithmic verification of procedural programs in the presence of code variability
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.016openalex-snapshot
Parameterised boolean equation systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.034openalex-snapshot
A linear translation from CTL* to the first-order modal μ -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.033openalex-snapshot
Axiomatizing weighted synchronization trees and weighted bisimilarity
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00094-1openalex-snapshot
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00096-5openalex-snapshot
The semantics and execution of a synchronous block-diagram language
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot
The equational logic of fixed points
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00217-xopenalex-snapshot
The modal mu-calculus alternation hierarchy is strict
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80558-9openalex-snapshot
Unique, guarded fixed points in an additive setting
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.002openalex-snapshot
Origins of bisimulation and coinduction
inferred← citeshttps://doi.org/10.1017/s0956796807006557openalex-snapshot
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
inferred← citeshttps://doi.org/10.1017/s0956796825000036openalex-snapshot
Recursive subtyping for all
inferred← citeshttps://doi.org/10.1017/s0960129515000031openalex-snapshot
Equational axioms associated with finite automata for fixed point operations in cartesian categories
inferred← citeshttps://doi.org/10.1017/s0960129518000361openalex-snapshot
Equational properties of fixed-point operations in cartesian categories: An overview
inferred← citeshttps://doi.org/10.1051/ita/2012029openalex-snapshot
On characteristic formulae for Event-Recording Automata
inferred← citeshttps://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferred← citeshttps://doi.org/10.1109/synasc54541.2021.00023openalex-snapshot
An Editor Calculus With Undo/Redo
inferred← citeshttps://doi.org/10.1145/1516507.1516510openalex-snapshot
On the origins of bisimulation and coinduction
inferred← citeshttps://doi.org/10.1145/154630.154647openalex-snapshot
The correctness of an optimized code generation
inferred← citeshttps://doi.org/10.1145/2897336.2897346openalex-snapshot
Isomorphisms considered as equalities
inferred← citeshttps://doi.org/10.1145/3009837.3009882openalex-snapshot
Polymorphism, subtyping, and type inference in MLsub
inferred← citeshttps://doi.org/10.1145/3156018openalex-snapshot
Conditioning in Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3571230openalex-snapshot
A Robust Theory of Series Parallel Graphs
inferred← citeshttps://doi.org/10.1145/3649822openalex-snapshot
Newtonian Program Analysis of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3661814.3662138openalex-snapshot
A proof theory of right-linear (ω-)grammars via cyclic proofs
inferred← citeshttps://doi.org/10.1145/3729286openalex-snapshot
Probabilistic Kleene Algebra with Angelic Nondeterminism
inferred← citeshttps://doi.org/10.1145/3763172openalex-snapshot
Complete the Cycle: Reachability Types with Expressive Cyclic References
inferred← citeshttps://doi.org/10.1145/3797874openalex-snapshot
Denotation-based Compositional Compiler Verification
inferred← citeshttps://doi.org/10.1145/3828673openalex-snapshot
An Equational and Graphical Fixed-Point Calculus (Functional Pearl)
inferred← citeshttps://doi.org/10.25911/5d78d9f7865dbopenalex-snapshot
Arrows for knowledge-based circuits
inferred← citeshttps://doi.org/10.3233/fi-2017-1469openalex-snapshot
Infinitary Axiomatization of the Equational Theory of Context-Free Languages
inferred← citeshttps://doi.org/10.4204/eptcs.126.4openalex-snapshot
Infinitary Axiomatization of the Equational Theory of Context-Free Languages
inferred← citeshttps://doi.org/10.48550/arxiv.2005.13151openalex-snapshot
Timed Automata Benchmark Description
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01667openalex-snapshot
A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0408045openalex-snapshot
On computing the fixpoint of a set of boolean equations
inferred← citeshttps://doi.org/10.6100/ir643995openalex-snapshot
Improved verification methods for concurrent systems
inferred← citeshttps://doi.org/10.7146/brics.v5i40.19485openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v7i25.20153openalex-snapshot
Continuous Additive Algebras and Injective Simulations of Synchronization Trees
inferred← citeshttps://doi.org/10.7146/brics.v8i28.21688openalex-snapshot
A Fully Equational Proof of Parikh's Theorem
inferred← citeshttps://doi.org/10.7146/brics.v9i19.21736openalex-snapshot
An Extension Theorem with an Application to Formal Tree Series
inferred← citeshttps://doi.org/10.7146/brics.v9i6.21724openalex-snapshot
Equational Axioms for Probabilistic Bisimilarity (Preliminary Report)
inferred← citeshttps://doi.org/10.7146/dpb.v21i427.6741openalex-snapshot
The Correctness of an Optimized Code Generation
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.