On the public citation graph
Results and Analysis of SyGuS-Comp'15
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.
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.1007/978-3-319-08587-6_28openalex-snapshot
StarExec: A Cross-Community Infrastructure for Logic Solving
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_5openalex-snapshot
ICE: A Robust Framework for Learning Invariants
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_10openalex-snapshot
Synthesis Through Unification
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-21668-3_22openalex-snapshot
Adaptive Concretization for Parallel Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_26openalex-snapshot
Alchemist: Learning Guarded Affine Functions
inferredcites →https://doi.org/10.1109/icse.2015.77openalex-snapshot
Alloy*: A General-Purpose Higher-Order Relational Constraint Solver
inferredcites →https://doi.org/10.1145/1064978.1065045openalex-snapshot
Programming by sketching for bit-streaming programs
inferredcites →https://doi.org/10.1145/1065010.1065045openalex-snapshot
Programming by sketching for bit-streaming programs
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1706299.1706337openalex-snapshot
From program verification to program synthesis
inferredcites →https://doi.org/10.1145/1806799.1806833openalex-snapshot
Oracle-guided component-based program synthesis
inferredcites →https://doi.org/10.1145/2594291.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/2837614.2837664openalex-snapshot
Learning invariants using decision trees and implication counterexamples
inferredcites →https://doi.org/10.1145/2914770.2837664openalex-snapshot
Learning invariants using decision trees and implication counterexamples
inferredcites →https://doi.org/10.48550/arxiv.1405.5590openalex-snapshot
Language to Specify Syntax-Guided Synthesis Problems
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-56222-8_3openalex-snapshot
SynthLearn: A Tool for Guided Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_21openalex-snapshot
Syntax-Guided Synthesis with Quantitative Syntactic Objectives
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_11openalex-snapshot
Synthesizing Piece-Wise Functions by Learning Classifiers
inferred← citeshttps://doi.org/10.1007/s10703-017-0290-yopenalex-snapshot
Solving quantified linear arithmetic by counterexample-guided instantiation
inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886678openalex-snapshot
SWAPPER: A framework for automatic generation of formula simplifiers based on conditional rewrite rules
inferred← citeshttps://doi.org/10.1145/3062341.3062345openalex-snapshot
Automatic program inversion using symbolic transducers
inferred← citeshttps://doi.org/10.1145/3071178.3071224openalex-snapshot
Counterexample-driven genetic programming
inferred← citeshttps://doi.org/10.1145/3385412.3386027openalex-snapshot
Reconciling enumerative and deductive program synthesis
inferred← citeshttps://doi.org/10.1145/3689744openalex-snapshot
Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics
inferred← citeshttps://doi.org/10.1162/evco_a_00228openalex-snapshot
Counterexample-Driven Genetic Programming: Heuristic Program Synthesis from Formal Specifications
inferred← citeshttps://doi.org/10.24963/ijcai.2018/742openalex-snapshot
Counterexample-Driven Genetic Programming: Stochastic Synthesis of Provably Correct Programs
inferred← citeshttps://doi.org/10.29007/xrhzopenalex-snapshot
Challenges for Fast Synthesis Procedures in SMT
inferred← citeshttps://doi.org/10.4204/eptcs.229.13openalex-snapshot
SyGuS-Comp 2016: Results and Analysis
inferred← citeshttps://doi.org/10.4204/eptcs.229.3openalex-snapshot
Using SyGuS to Synthesize Reactive Motion Plans
inferred← citeshttps://doi.org/10.4204/eptcs.260.8openalex-snapshot
SyGuS Techniques in the Core of an SMT Solver
inferred← citeshttps://doi.org/10.4204/eptcs.260.9openalex-snapshot
SyGuS-Comp 2017: Results and Analysis
inferred← citeshttps://doi.org/10.5555/3077629.3077661openalex-snapshot
Swapper: a framework for automatic generation of formula simplifiers based on conditional rewrite rules
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.