Optimizing synthesis with metasketches
From MaRDI portal
Publication:2828321
DOI10.1145/2837614.2837666zbMath1347.68071OpenAlexW2294286398MaRDI QIDQ2828321
Dan Grossman, Emina Torlak, Luis Ceze, James Bornholt
Publication date: 24 October 2016
Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2837614.2837666
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
A Delta for Hybrid Type Checking, Approximate bit dependency analysis to identify program synthesis problems as infeasible, Counterexample-guided inductive synthesis for probabilistic systems, Inductive synthesis for probabilistic programs reaches new horizons, A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
