On the public citation graph

FSTTCS 2004 : foundations of software technology and theoretical computer science : 24th International Conference, Chennai, India, December 16-18, 2004 : proceedings

https://doi.org/10.1007/b104325
0 signed · 44 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.1993.1052openalex-snapshot
Asynchronous Mappings and Asynchronous Cellular Automata
inferredcites →https://doi.org/10.1007/10722167_20openalex-snapshot
Efficient Algorithms for Model Checking Pushdown Systems
inferredcites →https://doi.org/10.1007/10722167_31openalex-snapshot
Regular Model Checking
inferredcites →https://doi.org/10.1007/3-540-45061-0_45openalex-snapshot
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games
inferredcites →https://doi.org/10.1007/3-540-45465-9_60openalex-snapshot
Symbolic Strategy Synthesis for Games on Pushdown Graphs
inferredcites →https://doi.org/10.1007/3-540-45694-5_11openalex-snapshot
A Decidable Class of Asynchronous Distributed Controllers
inferredcites →https://doi.org/10.1007/3-540-45711-9_16openalex-snapshot
Grammars as Processes
inferredcites →https://doi.org/10.1007/3-540-48224-5_33openalex-snapshot
Distributed Controller Synthesis for Local Specifications
inferredcites →https://doi.org/10.1007/3-540-49019-1_2openalex-snapshot
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
inferredcites →https://doi.org/10.1007/3-540-60630-0_5openalex-snapshot
Mona: Monadic second-order logic in practice
inferredcites →https://doi.org/10.1007/3-540-61604-7_59openalex-snapshot
Bisimulation collapse and the process taxonomy
inferredcites →https://doi.org/10.1007/3-540-63141-0_10openalex-snapshot
Reachability analysis of pushdown automata: Application to model-checking
inferredcites →https://doi.org/10.1007/3-540-63166-6_41openalex-snapshot
Symbolic model checking with rich assertional languages
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_49openalex-snapshot
Distributed Games and Distributed Control for Asynchronous Systems
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/bfb0035790openalex-snapshot
On the synthesis of an asynchronous reactive module
inferredcites →https://doi.org/10.1016/0304-3975(85)90087-8openalex-snapshot
The theory of ends, pushdown automata, and second-order logic
inferredcites →https://doi.org/10.1016/0304-3975(95)00130-1openalex-snapshot
Logical definability on infinite traces
inferredcites →https://doi.org/10.1016/s0304-3975(00)00307-8openalex-snapshot
Branching time controllers for discrete event systems
inferredcites →https://doi.org/10.1016/s0898-1221(00)00333-3openalex-snapshot
Lower bounds for multiplayer noncooperative games of incomplete information
inferredcites →https://doi.org/10.1109/5.21072openalex-snapshot
The control of discrete event systems
inferredcites →https://doi.org/10.1109/lics.2001.932514openalex-snapshot
Synthesizing distributed systems
inferredcites →https://doi.org/10.1109/sfcs.1979.25openalex-snapshot
Multiple-person alternation
inferredcites →https://doi.org/10.1142/9789814261456_0007openalex-snapshot
Asynchronous Automata
inferredcites →https://doi.org/10.1145/800061.808767openalex-snapshot
Iterated pushdown automata and complexity classes
inferredcites →https://doi.org/10.2307/1994916openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.7146/brics.v3i54.20057openalex-snapshot
Pushdown Processes: Games and Model Checking

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11128-024-04448-0openalex-snapshot
Quantum interactive proofs using quantum energy teleportation
inferred← citeshttps://doi.org/10.1016/j.cose.2010.11.004openalex-snapshot
Extending the enforcement power of truncation monitors using static analysis
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.09.008openalex-snapshot
Towards modeling and runtime verification of self-organizing systems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.12.002openalex-snapshot
Extended transitive separation logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.041openalex-snapshot
Focusing and polarization in linear, intuitionistic, and classical logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.028openalex-snapshot
A calculus of branching processes
inferred← citeshttps://doi.org/10.1080/11663081.2015.1018801openalex-snapshot
Separation logics and modalities: a survey
inferred← citeshttps://doi.org/10.1103/physreva.75.032321openalex-snapshot
Simulating adiabatic evolution of gapped spin systems
inferred← citeshttps://doi.org/10.1103/physrevc.108.024313openalex-snapshot
Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model
inferred← citeshttps://doi.org/10.1103/physrevresearch.5.043048openalex-snapshot
Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.023243openalex-snapshot
Simplifying the simulation of local Hamiltonian dynamics
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.l022041openalex-snapshot
Quadratic acceleration of multistep probabilistic algorithms for state preparation
inferred← citeshttps://doi.org/10.1145/2897518.2897571openalex-snapshot
Separating subadditive euclidean functionals
inferred← citeshttps://doi.org/10.1145/2897518.2897636openalex-snapshot
Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
inferred← citeshttps://doi.org/10.1145/3192366.3192414openalex-snapshot
Modularity for decidability of deductive verification with applications to distributed systems
inferred← citeshttps://doi.org/10.1145/3296979.3192414openalex-snapshot
Modularity for decidability of deductive verification with applications to distributed systems
inferred← citeshttps://doi.org/10.1145/3498725openalex-snapshot
Software model-checking as cyclic-proof search
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.