On the public citation graph
Solving Infinite-State Games via Acceleration
0 signed · 55 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.1006/inco.2000.2894openalex-snapshot
Pushdown Processes: Games and Model-Checking
inferredcites →https://doi.org/10.1007/11562948_35openalex-snapshot
Flat Acceleration in Symbolic Model Checking
inferredcites →https://doi.org/10.1007/11562948_36openalex-snapshot
Flat Counter Automata Almost Everywhere!
inferredcites →https://doi.org/10.1007/11817963_33openalex-snapshot
Repair of Boolean Programs with an Application to C
inferredcites →https://doi.org/10.1007/3-540-36206-1_14openalex-snapshot
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
inferredcites →https://doi.org/10.1007/3-540-36387-4openalex-snapshot
Automata logics, and infinite games: a guide to current research
inferredcites →https://doi.org/10.1007/3-540-44685-0_36openalex-snapshot
Symbolic Algorithms for Infinite-State Games
inferredcites →https://doi.org/10.1007/3-540-45061-0_69openalex-snapshot
Counterexample-Guided Control
inferredcites →https://doi.org/10.1007/978-1-4419-0224-5openalex-snapshot
Verification and Control of Hybrid Systems: A Symbolic Approach
inferredcites →https://doi.org/10.1007/978-3-030-11245-5_5openalex-snapshot
Lazy but Effective Functional Synthesis
inferredcites →https://doi.org/10.1007/978-3-030-25540-4_35openalex-snapshot
Temporal Stream Logic: Synthesis Beyond the Bools
inferredcites →https://doi.org/10.1007/978-3-030-64437-6_14openalex-snapshot
Parameterized Synthesis with Safety Properties
inferredcites →https://doi.org/10.1007/978-3-030-72013-1_8openalex-snapshot
Syntax-Guided Quantifier Instantiation
inferredcites →https://doi.org/10.1007/978-3-030-99253-8_17openalex-snapshot
Temporal Stream Logic modulo Theories
inferredcites →https://doi.org/10.1007/978-3-030-99524-9_24openalex-snapshot
cvc5: A Versatile and Industrial-Strength SMT Solver
inferredcites →https://doi.org/10.1007/978-3-031-13185-1_17openalex-snapshot
Software Verification of Hyperproperties Beyond k-Safety
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_27openalex-snapshot
Graph Games and Reactive Synthesis
inferredcites →https://doi.org/10.1007/978-3-319-89963-3_10openalex-snapshot
Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts
inferredcites →https://doi.org/10.1007/978-3-319-96145-3_31openalex-snapshot
Strix: Explicit Reactive Synthesis Strikes Back!
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_16openalex-snapshot
Don’t Know in the μ-Calculus
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_12openalex-snapshot
FAST: Fast Acceleration of Symbolic Transition Systems
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-33475-7_5openalex-snapshot
Cinderella versus the Wicked Stepmother
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_12openalex-snapshot
An Automaton Learning Approach to Solving Safety Games over Infinite Graphs
inferredcites →https://doi.org/10.1007/s10703-012-0176-yopenalex-snapshot
Loop summarization using state and transition invariants
inferredcites →https://doi.org/10.1016/j.ic.2006.10.009openalex-snapshot
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
inferredcites →https://doi.org/10.1016/j.jcss.2011.08.007openalex-snapshot
Synthesis of Reactive(1) designs
inferredcites →https://doi.org/10.1093/logcom/exm062openalex-snapshot
Monotonic and Downward Closed Games
inferredcites →https://doi.org/10.1109/fmcad.2014.6987617openalex-snapshot
Predicate abstraction for reactive synthesis
inferredcites →https://doi.org/10.1109/lics.2006.10openalex-snapshot
An Abstraction-Refinement Framework for Multi-Agent Systems
inferredcites →https://doi.org/10.1109/tro.2009.2030225openalex-snapshot
Temporal-Logic-Based Reactive Mission and Motion Planning
inferredcites →https://doi.org/10.1145/2535838.2535860openalex-snapshot
A constraint-based approach to solving games on infinite graphs
inferredcites →https://doi.org/10.1145/3158149openalex-snapshot
Strategy synthesis for linear arithmetic games
inferredcites →https://doi.org/10.1145/3468264.3473126openalex-snapshot
GenSys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces
inferredcites →https://doi.org/10.1145/3519939.3523429openalex-snapshot
Can reactive synthesis and syntax-guided synthesis be friends?
inferredcites →https://doi.org/10.1145/3571265openalex-snapshot
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification
inferredcites →https://doi.org/10.1609/aaai.v37i5.25779openalex-snapshot
Reachability Games Modulo Theories with a Bounded Safety Player
inferredcites →https://doi.org/10.48550/arxiv.2305.16118openalex-snapshot
Solving Infinite-State Games via Acceleration (Full Version)
inferredcites →https://doi.org/10.5281/zenodo.8409938openalex-snapshot
Artifact of "Solving Infinite-State Games via Acceleration"
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-65633-0_7openalex-snapshot
Localized Attractor Computations for Infinite-State Games
inferred← citeshttps://doi.org/10.1007/978-3-031-75387-9_17openalex-snapshot
Synthesis from Infinite-State Generalized Reactivity(1) Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-78750-8_2openalex-snapshot
Predictable and Performant Reactive Synthesis Modulo Theories via Functional Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_11openalex-snapshot
Counter Example Guided Reactive Synthesis for LTL Modulo Theories$$^*$$
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_13openalex-snapshot
Full LTL Synthesis over Infinite-State Arenas
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_14openalex-snapshot
Issy: A Comprehensive Tool for Specification and Synthesis of Infinite-State Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-08707-2_18openalex-snapshot
Control Closure Certificates
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_21openalex-snapshot
Modular Attractor Acceleration in Infinite-State Games
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_18openalex-snapshot
sweap: Reactive Synthesis for Infinite-State Integer Problems
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00212openalex-snapshot
Symbolic Fixpoint Algorithms for Logical LTL Games
inferred← citeshttps://doi.org/10.1145/3704888openalex-snapshot
Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis
inferred← citeshttps://doi.org/10.1145/3704904openalex-snapshot
A Primal-Dual Perspective on Program Verification Algorithms
inferred← citeshttps://doi.org/10.1145/3763130openalex-snapshot
Verifying Asynchronous Hyperproperties in Reactive Systems
inferred← citeshttps://doi.org/10.1145/3776726openalex-snapshot
Parameterized Infinite-State Reactive Synthesis
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.