Defining behaviorizeable relations to enable inference in semi-automatic program synthesis

DOI10.1016/j.jlamp.2021.100714OpenAlexW3195237345MaRDI QIDQ2239281

Andreas Symeonidis, Emmanouil Krasanakis

Publication date: 3 November 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100714

zbMATH Keywords

algebraic logicprogram synthesisDSL abstraction

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• NLTK
• aplore3
• Python
• Prophet
• SQLizer
• RobustFill

Cites Work

• On the formal semantics of IF-like logics
• Flattening and saturation: Two representation changes for generalization
• Program synthesis using deduction-guided reinforcement learning
• Refutation-based synthesis in SMT
• Towards Complete Reasoning about Axiomatic Specifications
• Large-Scale Machine Learning with Stochastic Gradient Descent
• Scaling Enumerative Program Synthesis via Divide and Conquer
• Second-Order Logic and Foundations of Mathematics
• Applied Logistic Regression
• From program verification to program synthesis
• Unnamed Item
• Unnamed Item
• Unnamed Item