On the public citation graph

The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results

0 signed · 61 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/3-540-44585-4_6openalex-snapshot
Fast LTL to Büchi Automata Translation
inferredcites →https://doi.org/10.1007/3-540-61474-5_95openalex-snapshot
VIS: A system for verification and synthesis
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_3openalex-snapshot
Algorithms for Model Checking HyperLTL and HyperCTL $$^*$$
inferredcites →https://doi.org/10.1007/978-3-319-31220-0_13openalex-snapshot
LtlNfBa: Making LTL Translation More Practical
inferredcites →https://doi.org/10.1007/978-3-319-41540-6_20openalex-snapshot
A SAT-Based Counterexample Guided Method for Unbounded Synthesis
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_5openalex-snapshot
ABC: An Academic Industrial-Strength Verification Tool
inferredcites →https://doi.org/10.1007/978-3-642-19835-9_25openalex-snapshot
Unbeast: Symbolic Bounded Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-25566-3_46openalex-snapshot
EDACC - An Advanced Platform for the Experiment Design, Administration and Analysis of Empirical Algorithms
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-31424-7_45openalex-snapshot
Acacia+, a Tool for LTL Synthesis
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-38613-8_13openalex-snapshot
Solving Games Using Incremental Induction
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-45221-5_45openalex-snapshot
PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification
inferredcites →https://doi.org/10.1007/978-3-642-54013-4_1openalex-snapshot
SAT-Based Synthesis Methods for Safety Specs
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.1007/s10009-016-0416-3openalex-snapshot
The first reactive synthesis competition (SYNTCOMP 2014)
inferredcites →https://doi.org/10.1007/s10703-011-0137-xopenalex-snapshot
Symbolic bounded synthesis
inferredcites →https://doi.org/10.1016/j.artint.2016.01.004openalex-snapshot
Solving QBF with counterexample guided refinement
inferredcites →https://doi.org/10.1016/j.entcs.2007.09.004openalex-snapshot
Specify, Compile, Run: Hardware from PSL
inferredcites →https://doi.org/10.1016/j.ic.2009.05.007openalex-snapshot
Solving games via three-valued abstraction refinement
inferredcites →https://doi.org/10.1016/j.jcss.2011.08.007openalex-snapshot
Synthesis of Reactive(1) designs
inferredcites →https://doi.org/10.1109/fmcad.2006.22openalex-snapshot
Optimizations for LTL Synthesis
inferredcites →https://doi.org/10.1109/iccad.1995.479994openalex-snapshot
Who are the variables in your neighbourhood
inferredcites →https://doi.org/10.1109/tc.1978.1675141openalex-snapshot
Binary Decision Diagrams
inferredcites →https://doi.org/10.1109/tcad.2014.2363395openalex-snapshot
A Counterexample-Guided Interpolant Generation Algorithm for SAT-Based Model Checking
inferredcites →https://doi.org/10.1201/9781420049671-29openalex-snapshot
Binary Decision Diagrams
inferredcites →https://doi.org/10.2307/2270398openalex-snapshot
Alonzo Church. Logic, arithmetic, and automata. Proceedings of the International Congress of Mathematicians, 15–22 August 1962, Institut Mittag-Leffler, Djursholm, Sweden, 1963, pp. 23–35.
inferredcites →https://doi.org/10.3233/sat190083openalex-snapshot
Controlling a Solver Execution with the runsolver Tool
inferredcites →https://doi.org/10.3233/sat190106openalex-snapshot
Hardware Model Checking Competition 2014: An Analysis and Comparison of Model Checkers and Benchmarks
inferredcites →https://doi.org/10.4171/dms/1-1openalex-snapshot
Plenary Lectures and Ceremonies
inferredcites →https://doi.org/10.4204/eptcs.157.11openalex-snapshot
AbsSynthe: abstract synthesis from succinct safety specifications
inferredcites →https://doi.org/10.4204/eptcs.157.9openalex-snapshot
Parameterized Synthesis Case Study: AMBA AHB
inferredcites →https://doi.org/10.4204/eptcs.202.4openalex-snapshot
The Second Reactive Synthesis Competition (SYNTCOMP 2015)
inferredcites →https://doi.org/10.4204/eptcs.202.7openalex-snapshot
Compositional Algorithms for Succinct Safety Games
inferredcites →https://doi.org/10.4204/eptcs.202.8openalex-snapshot
Specification Format for Reactive Synthesis Problems
inferredcites →https://doi.org/10.4204/eptcs.229.10openalex-snapshot
A High-Level LTL Synthesis Format: TLSF v1.1
inferredcites →https://doi.org/10.4204/eptcs.229.11openalex-snapshot
The Reactive Synthesis Competition: SYNTCOMP 2016 and Beyond
inferredcites →https://doi.org/10.48550/arxiv.1201.0682openalex-snapshot
LTL to Büchi Automata Translation: Fast and More Deterministic
inferredcites →https://doi.org/10.48550/arxiv.1405.5793openalex-snapshot
Extended AIGER Format for Synthesis
inferredcites →https://doi.org/10.5555/224841.224862openalex-snapshot
Who are the variables in your neighbourhood
inferredcites →https://doi.org/10.5555/259794.259802openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams
inferredcites →https://doi.org/10.5555/2616606.2616790openalex-snapshot
Partial witnesses from preprocessed quantified Boolean formulas
inferredcites →https://doi.org/10.5555/2685048.2685101openalex-snapshot
User-guided device driver synthesis
inferredcites →https://doi.org/10.7873/date2014.162openalex-snapshot
Partial witnesses from preprocessed quantified Boolean formulas

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-24258-9_27openalex-snapshot
Clausal Abstraction for DQBF
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_17openalex-snapshot
BoSy: An Experimentation Framework for Bounded Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_25openalex-snapshot
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
inferred← citeshttps://doi.org/10.1007/s00236-019-00351-9openalex-snapshot
Performance heuristics for GR(1) synthesis and related algorithms
inferred← citeshttps://doi.org/10.1109/access.2021.3057823openalex-snapshot
BeBoSy: Behavior Examples Meet Bounded Synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.229.11openalex-snapshot
The Reactive Synthesis Competition: SYNTCOMP 2016 and Beyond
inferred← citeshttps://doi.org/10.4204/eptcs.260.10openalex-snapshot
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results
inferred← citeshttps://doi.org/10.4204/eptcs.260.4openalex-snapshot
CTL* synthesis via LTL synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.260.7openalex-snapshot
Performance Heuristics for GR(1) Synthesis and Related Algorithms
inferred← citeshttps://doi.org/10.4204/eptcs.277.7openalex-snapshot
Solving QBF by Abstraction
inferred← citeshttps://doi.org/10.48550/arxiv.1803.09566openalex-snapshot
BoSy: An Experimentation Framework for Bounded Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1808.08759openalex-snapshot
Clausal Abstraction for DQBF (full version)
inferred← citeshttps://doi.org/10.48550/arxiv.1904.07736openalex-snapshot
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results
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.