On the public citation graph

Theoretical Computer Science

0 signed · 26 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.1007/bfb0009646openalex-snapshot
An axiomatic approach to semantics of specification languages
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/bfb0009651openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/bfb0036481openalex-snapshot
Heuristics for minimum edge length rectangular partitions of rectilinear figures
inferredcites →https://doi.org/10.1007/bfb0036489openalex-snapshot
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics

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-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_37openalex-snapshot
Entailment and disentailment of order-sorted feature constraints
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_8openalex-snapshot
On the Expressiveness of ACP
inferred← citeshttps://doi.org/10.1007/978-1-4613-9347-4_5openalex-snapshot
Homomorphic Reduction of Coordination Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_3openalex-snapshot
Semantical Analysis of Specification Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot
Origins and Development of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-76462-2_22openalex-snapshot
A Consistency Condition Supporting Design and Verification of Byzantine Adaptive Agreement Protocols
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_4openalex-snapshot
Semantics of Prolog and Logic Programming in General
inferred← citeshttps://doi.org/10.1007/978-94-011-0305-3_3openalex-snapshot
Timing Problems and Their Handling at System Integration
inferred← citeshttps://doi.org/10.1007/bf01057645openalex-snapshot
Cecylia Rauszer
inferred← citeshttps://doi.org/10.1007/bf01384499openalex-snapshot
Generality in design and compositional verification usingTav
inferred← citeshttps://doi.org/10.1007/bfb0054480openalex-snapshot
Inferring functional dependencies in linearly ordered databases
inferred← citeshttps://doi.org/10.1016/b978-044482816-3/50032-0openalex-snapshot
ObjectInterconnecting the GEODE and CÆSAR-Aldébaran toolsets
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105033openalex-snapshot
On divergence-sensitive weak probabilistic bisimilarity
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.04.010openalex-snapshot
On the probabilistic closure of the loose unambiguous hierarchy
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.08.003openalex-snapshot
Meta-kernelization with structural parameters
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80379-2openalex-snapshot
SGCCS: A Graphical Language for Real-Time Coordination
inferred← citeshttps://doi.org/10.1142/s0129054102001412openalex-snapshot
A FORMULA-DRIVEN MODULAR ATTACK ON STATE EXPLOSION
inferred← citeshttps://doi.org/10.1145/141936.141963openalex-snapshot
A formalism for real-time concurrent object-oriented computing
inferred← citeshttps://doi.org/10.1145/872035.872083openalex-snapshot
A lattice-theoretic characterization of safety and liveness
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.