On the public citation graph

Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs

https://doi.org/10.1145/3586052
0 signed · 66 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-030-01090-4_28openalex-snapshot
Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-030-25540-4_14openalex-snapshot
Quantified Invariants via Syntax-Guided Synthesis
inferredcites →https://doi.org/10.1007/978-3-030-44914-8_21openalex-snapshot
Solving Program Sketches with Large Integer Values
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-319-21668-3_12openalex-snapshot
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
inferredcites →https://doi.org/10.1007/978-3-319-27565-9openalex-snapshot
Behavioral Program Synthesis with Genetic Programming
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_1openalex-snapshot
Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_3openalex-snapshot
Non-polynomial Worst-Case Analysis of Recursive Programs
inferredcites →https://doi.org/10.1007/978-3-319-68167-2_26openalex-snapshot
Finding Polynomial Loop Invariants for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_11openalex-snapshot
Invariant Generation for Multi-Path Loops with Polynomial Assignments
inferredcites →https://doi.org/10.1007/978-3-319-96145-3_15openalex-snapshot
Counterexample Guided Inductive Synthesis Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_7openalex-snapshot
Constraint-Based Linear-Relations Analysis
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_39openalex-snapshot
Linear Invariant Generation Using Non-linear Constraint Solving
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-10672-9_3openalex-snapshot
The Sketching Approach to Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_7openalex-snapshot
The MathSAT5 SMT Solver
inferredcites →https://doi.org/10.1007/978-3-662-03718-8openalex-snapshot
Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_15openalex-snapshot
Counterexample-Guided Model Synthesis
inferredcites →https://doi.org/10.1007/bf01186549openalex-snapshot
Zur Deutung der intuitionistischen Logik
inferredcites →https://doi.org/10.1007/s10009-012-0223-4openalex-snapshot
Template-based program verification and program synthesis
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50019-2openalex-snapshot
APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This…
inferredcites →https://doi.org/10.1016/j.jco.2022.101663openalex-snapshot
On the complexity of Putinar–Vasilescu's Positivstellensatz
inferredcites →https://doi.org/10.1016/s0049-237x(08)71127-3openalex-snapshot
Aspects of Constructive Mathematics
inferredcites →https://doi.org/10.1017/9781108770750.008openalex-snapshot
Termination Analysis of Probabilistic Programs with Martingales
inferredcites →https://doi.org/10.1090/s0002-9947-1953-0053041-6openalex-snapshot
Classes of Recursively Enumerable Sets and Their Decision Problems
inferredcites →https://doi.org/10.1109/tevc.2022.3162324openalex-snapshot
A Comprehensive Survey on Program Synthesis With Evolutionary Algorithms
inferredcites →https://doi.org/10.1137/1.9781611972290openalex-snapshot
Semidefinite Optimization and Convex Algebraic Geometry
inferredcites →https://doi.org/10.1145/1707801.1706337openalex-snapshot
From program verification to program synthesis
inferredcites →https://doi.org/10.1145/1925844.1926423openalex-snapshot
Automating string processing in spreadsheets using input-output examples
inferredcites →https://doi.org/10.1145/1993316.1993506openalex-snapshot
Synthesis of loop-free programs
inferredcites →https://doi.org/10.1145/2240236.2240260openalex-snapshot
Spreadsheet data manipulation using examples
inferredcites →https://doi.org/10.1145/2666356.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/2980983.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/3158122openalex-snapshot
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
inferredcites →https://doi.org/10.1145/3208071openalex-snapshot
Search-based program synthesis
inferredcites →https://doi.org/10.1145/3236024.3236034openalex-snapshot
Syntax-guided synthesis of Datalog programs
inferredcites →https://doi.org/10.1145/3276519openalex-snapshot
Finding code that explodes under symbolic evaluation
inferredcites →https://doi.org/10.1145/3314221.3314602openalex-snapshot
Resource-guided program synthesis
inferredcites →https://doi.org/10.1145/3360555openalex-snapshot
Modular verification for almost-sure termination of probabilistic programs
inferredcites →https://doi.org/10.1145/3371080openalex-snapshot
Program synthesis by type-guided abstraction refinement
inferredcites →https://doi.org/10.1145/3410310openalex-snapshot
Replication Package for Article: Quantitative Analysis of Assertion Violations in Probabilistic Programs
inferredcites →https://doi.org/10.1145/3586052openalex-snapshot
Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs
inferredcites →https://doi.org/10.1145/362566.362568openalex-snapshot
Toward automatic program synthesis
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.1145/982962.964028openalex-snapshot
Non-linear loop invariant generation using Gröbner bases
inferredcites →https://doi.org/10.1512/iumj.1993.42.42045openalex-snapshot
inferredcites →https://doi.org/10.1561/2500000010openalex-snapshot
Program Synthesis
inferredcites →https://doi.org/10.21236/ada016811openalex-snapshot
PYGMALION: A Creative Programming Environment
inferredcites →https://doi.org/10.2140/pjm.1988.132.35openalex-snapshot
Representing polynomials by positive linear functions on compact convex polyhedra
inferredcites →https://doi.org/10.2307/2153000openalex-snapshot
Fundamentals of Matrix Computations.
inferredcites →https://doi.org/10.7717/peerj-cs.103openalex-snapshot
SymPy: symbolic computing in Python

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-71162-6_6openalex-snapshot
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_1openalex-snapshot
Efficient Synthesis of Tight Polynomial Upper-Bounds for Systems of Conditional Polynomial Recurrences
inferred← citeshttps://doi.org/10.1007/978-3-032-08707-2_19openalex-snapshot
PolyQEnt: A Polynomial Quantified Entailment Solver
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_7openalex-snapshot
Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_15openalex-snapshot
Program Synthesis for Non-linear Real Arithmetic: Going Beyond Realizability
inferred← citeshttps://doi.org/10.1007/s10703-026-00495-8openalex-snapshot
Linear temporal constraints for sketch-based synthesizers
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102551openalex-snapshot
Algebraic and algorithmic methods for computing polynomial loop invariants
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103732openalex-snapshot
Series–parallel-loop decompositions of control-flow graphs
inferred← citeshttps://doi.org/10.1145/3632867openalex-snapshot
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis
inferred← citeshttps://doi.org/10.1145/3656418openalex-snapshot
From Batch to Stream: Automatic Generation of Online Algorithms
inferred← citeshttps://doi.org/10.1145/3666000.3669710openalex-snapshot
Algebraic Tools for Computing Polynomial Loop Invariants
inferred← citeshttps://doi.org/10.1145/3708559openalex-snapshot
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming
inferred← citeshttps://doi.org/10.1145/3735544.3735581openalex-snapshot
Beyond Affine Loops: A Geometric Approach to Program Synthesis
inferred← citeshttps://doi.org/10.29007/njphopenalex-snapshot
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers
showing the first 14 of 15 · page through all 15
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.