On the public citation graph

Parameterized Synthesis Case Study: AMBA AHB

0 signed · 35 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/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_37openalex-snapshot
RATSY – A New Requirements Analysis Tool with Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-19583-9_16openalex-snapshot
Revisiting Synthesis of GR(1) Specifications
inferredcites →https://doi.org/10.1007/978-3-642-27940-9_15openalex-snapshot
Lazy Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_8openalex-snapshot
LTL to Büchi Automata Translation: Fast and More Deterministic
inferredcites →https://doi.org/10.1007/978-3-642-35873-9_9openalex-snapshot
Towards Efficient Parameterized Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-39799-8openalex-snapshot
Computer Aided Verification
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_66openalex-snapshot
PARTY Parameterized Synthesis of Token Rings
inferredcites →https://doi.org/10.1007/978-3-642-54013-4_15openalex-snapshot
Parameterized Model Checking of Token-Passing Systems
inferredcites →https://doi.org/10.1007/s10009-011-0207-9openalex-snapshot
Synthesis of AMBA AHB from formal specification: a case study
inferredcites →https://doi.org/10.1007/s10009-012-0228-zopenalex-snapshot
Bounded synthesis
inferredcites →https://doi.org/10.1016/j.jcss.2011.08.007openalex-snapshot
Synthesis of Reactive(1) designs
inferredcites →https://doi.org/10.1109/fscs.1990.89597openalex-snapshot
Distributed reactive systems are hard to synthesize
inferredcites →https://doi.org/10.1142/s0129054103001881openalex-snapshot
On Reasoning About Rings
inferredcites →https://doi.org/10.2168/lmcs-10(1:12)2014openalex-snapshot
Parameterized Synthesis
inferredcites →https://doi.org/10.2168/lmcs-10(4:5)2014openalex-snapshot
Decidability Problems for Actor Systems
inferredcites →https://doi.org/10.4204/eptcs.157.9openalex-snapshot
Parameterized Synthesis Case Study: AMBA AHB
inferredcites →https://doi.org/10.48550/arxiv.1201.0682openalex-snapshot
LTL to Büchi Automata Translation: Fast and More Deterministic

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-25540-4_35openalex-snapshot
Temporal Stream Logic: Synthesis Beyond the Bools
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_7openalex-snapshot
GR(1)*: GR(1) Specifications Extended with Existential Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_16openalex-snapshot
Promptness and Bounded Fairness in Concurrent and Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-73721-8_12openalex-snapshot
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_31openalex-snapshot
Strix: Explicit Reactive Synthesis Strikes Back!
inferred← citeshttps://doi.org/10.1007/s00165-021-00535-6openalex-snapshot
GR(1)*: GR(1) specifications extended withexistential guarantees
inferred← citeshttps://doi.org/10.1007/s00236-019-00349-3openalex-snapshot
Practical synthesis of reactive systems from LTL specifications via parity games
inferred← citeshttps://doi.org/10.1007/s00236-019-00361-7openalex-snapshot
Parameterized synthesis of self-stabilizing protocols in symmetric networks
inferred← citeshttps://doi.org/10.1007/s00446-017-0302-6openalex-snapshot
Parameterized model checking of rendezvous systems
inferred← citeshttps://doi.org/10.1145/3331545.3342601openalex-snapshot
Synthesizing functional reactive programs
inferred← citeshttps://doi.org/10.1145/3519939.3523429openalex-snapshot
Can reactive synthesis and syntax-guided synthesis be friends?
inferred← citeshttps://doi.org/10.1145/3732365.3732386openalex-snapshot
Tester-based Symbolic Synthesis of Linear Dynamic Logic on Finite Traces
inferred← citeshttps://doi.org/10.4204/eptcs.202.5openalex-snapshot
Synthesizing a Lego Forklift Controller in GR(1): A Case Study
inferred← citeshttps://doi.org/10.4204/eptcs.202.6openalex-snapshot
A multi-paradigm language for reactive synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.229.12openalex-snapshot
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results
inferred← citeshttps://doi.org/10.48550/arxiv.1808.09430openalex-snapshot
Reactive Synthesis: Branching Logics and Parameterized Systems
showing the first 16 of 17 · page through all 17
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.