On the public citation graph

Strategy synthesis for linear arithmetic games

0 signed · 81 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.2000.2894openalex-snapshot

Pushdown Processes: Games and Model-Checking

inferredcites →https://doi.org/10.1007/11513988_23openalex-snapshot

Program Repair as a Game

inferredcites →https://doi.org/10.1007/11609773_24openalex-snapshot

Synthesis of Reactive(1) Designs

inferredcites →https://doi.org/10.1007/11691372_14openalex-snapshot

Why Waste a Perfectly Good Abstraction?

inferredcites →https://doi.org/10.1007/11817963_14openalex-snapshot

Lazy Abstraction with Interpolants

inferredcites →https://doi.org/10.1007/11901914_25openalex-snapshot

Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise

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-45465-9_60openalex-snapshot

Symbolic Strategy Synthesis for Games on Pushdown Graphs

inferredcites →https://doi.org/10.1007/3-540-45694-5_2openalex-snapshot

A Deductive Proof System for CTL*

inferredcites →https://doi.org/10.1007/3-540-48320-9_27openalex-snapshot

Robust Satisfaction

inferredcites →https://doi.org/10.1007/3-540-59042-0_57openalex-snapshot

On the synthesis of strategies in infinite games

inferredcites →https://doi.org/10.1007/978-3-319-21668-3_12openalex-snapshot

Counterexample-Guided Quantifier Instantiation for Synthesis in SMT

inferredcites →https://doi.org/10.1007/978-3-319-41540-6_14openalex-snapshot

Compositional Synthesis of Reactive Controllers for Multi-agent Systems

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-31980-1_31openalex-snapshot

A New Algorithm for Strategy Synthesis in LTL Games

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-642-39799-8_61openalex-snapshot

Solving Existentially Quantified Horn Clauses

inferredcites →https://doi.org/10.1007/978-3-642-45221-5_13openalex-snapshot

Tree Interpolation in Vampire

inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_5openalex-snapshot

Super-Exponential Complexity of Presburger Arithmetic

inferredcites →https://doi.org/10.1007/978-94-010-9847-2_1openalex-snapshot

Game-Theoretical Semantics: Insights and Prospects

inferredcites →https://doi.org/10.1007/s10009-011-0202-1openalex-snapshot

Local abstraction–refinement for the μ-calculus

inferredcites →https://doi.org/10.1007/s10009-012-0223-4openalex-snapshot

Template-based program verification and program synthesis

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/s1571-0661(04)80534-6openalex-snapshot

Uniform Solution of Parity Games on Prefix-Recognizable Graphs

inferredcites →https://doi.org/10.1109/fmcad.2013.6679385openalex-snapshot

Syntax-guided 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/sfcs.1991.185392openalex-snapshot

Tree automata, mu-calculus and determinacy

inferredcites →https://doi.org/10.1137/0204006openalex-snapshot

A Decision Procedure for the First Order Theory of Real Addition with Order

inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot

Combinatorial sketching for finite programs

inferredcites →https://doi.org/10.1145/1328438.1328459openalex-snapshot

Proving non-termination

inferredcites →https://doi.org/10.1145/1328897.1328459openalex-snapshot

Proving non-termination

inferredcites →https://doi.org/10.1145/1706299.1706337openalex-snapshot

From program verification to program synthesis

inferredcites →https://doi.org/10.1145/1706299.1706338openalex-snapshot

Abstraction-guided synthesis of synchronization

inferredcites →https://doi.org/10.1145/1707801.1706338openalex-snapshot

Abstraction-guided synthesis of synchronization

inferredcites →https://doi.org/10.1145/1806596.1806632openalex-snapshot

Complete functional synthesis

inferredcites →https://doi.org/10.1145/2491956.2491969openalex-snapshot

Reasoning about nondeterminism in programs

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/2578855.2535860openalex-snapshot

A constraint-based approach to solving games on infinite graphs

inferredcites →https://doi.org/10.1145/2837614.2837628openalex-snapshot

Maximal specification synthesis

inferredcites →https://doi.org/10.1145/2914770.2837628openalex-snapshot

Maximal specification synthesis

inferredcites →https://doi.org/10.1145/357084.357090openalex-snapshot

A Deductive Approach to Program Synthesis

inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot

On the synthesis of a reactive module

inferredcites →https://doi.org/10.1305/ndjfl/1093883627openalex-snapshot

Game-theoretical semantics: insights and prospects.

inferredcites →https://doi.org/10.15607/rss.2016.xii.002openalex-snapshot

Incremental Task and Motion Planning: A Constraint-Based Approach

inferredcites →https://doi.org/10.2307/1971035openalex-snapshot

Borel Determinacy

inferredcites →https://doi.org/10.29007/vv21openalex-snapshot

Playing with Quantified Satisfaction

inferredcites →https://doi.org/10.4169/math.mag.84.4.278openalex-snapshot

How Cinderella Won the Bucket Game (and Lived Happily Ever After)

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-030-53291-8_32openalex-snapshot

Decidable Synthesis of Programs with Uninterpreted Functions

inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_16openalex-snapshot

Farkas-Based Tree Interpolation

inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_42openalex-snapshot

Causality-Based Game Solving

inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_17openalex-snapshot

Software Verification of Hyperproperties Beyond k-Safety

inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_13openalex-snapshot

Reasoning About Data Trees Using CHCs

inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_15openalex-snapshot

Boolean Abstractions for Realizability Modulo Theories

inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot

Programming Languages and Systems

inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_9openalex-snapshot

Hyperproperty Verification as CHC Satisfiability

inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_5openalex-snapshot

Quantified Linear Arithmetic Satisfiability via Fine-Grained Strategy Improvement

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-66997-2_18openalex-snapshot

Solving Hard Mizar Problems with Instantiation and Strategy Invention

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_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-22752-2_21openalex-snapshot

Modular Attractor Acceleration in Infinite-State Games

inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_12openalex-snapshot

Circuit-Based Search Space Pruning in QBF

inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_22openalex-snapshot

Learning Abstractions for Program Synthesis

inferred← citeshttps://doi.org/10.1007/s10703-023-00435-wopenalex-snapshot

Church synthesis on register automata over linearly ordered data domains

inferred← citeshttps://doi.org/10.1007/s10703-025-00482-5openalex-snapshot

Predicate abstraction for hyperliveness verification

inferred← citeshttps://doi.org/10.1109/ase56229.2023.00212openalex-snapshot

Symbolic Fixpoint Algorithms for Logical LTL Games

inferred← citeshttps://doi.org/10.1145/3468264.3473126openalex-snapshot

GenSys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces

inferred← citeshttps://doi.org/10.1145/3498725openalex-snapshot

Software model-checking as cyclic-proof search

inferred← citeshttps://doi.org/10.1145/3632899openalex-snapshot

Solving Infinite-State Games via Acceleration

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/3720470openalex-snapshot

LOUD: Synthesizing Strongest and Weakest Specifications

inferred← citeshttps://doi.org/10.1145/3729320openalex-snapshot

Verifying Solutions to Semantics-Guided Synthesis Problems

inferred← citeshttps://doi.org/10.1145/3763130openalex-snapshot

Verifying Asynchronous Hyperproperties in Reactive Systems

inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20523openalex-snapshot

Automated Synthesis of Generalized Invariant Strategies via Counterexample-Guided Strategy Refinement

inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25779openalex-snapshot

Reachability Games Modulo Theories with a Bounded Safety Player

inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28939openalex-snapshot

Adaptive Reactive Synthesis for LTL and LTLf Modulo Theories

inferred← citeshttps://doi.org/10.24963/ijcai.2020/236openalex-snapshot

Automatic Synthesis of Generalized Winning Strategies of Impartial Combinatorial Games Using SMT Solvers

inferred← citeshttps://doi.org/10.29007/w42sopenalex-snapshot

Towards Smarter MACE-style Model Finders

inferred← citeshttps://doi.org/10.48550/arxiv.2007.03656openalex-snapshot

Program Verification via Predicate Constraint Satisfiability Modulo Theories

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.