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

DOI10.1016/J.JLAMP.2021.100714MaRDI QIDQ2239281zbMATH OpenOpenAlexFDO

Authors Emmanouil Krasanakis, Andreas Symeonidis

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 logicDSL abstractionprogram synthesis

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 1926611
• Counterexample guided inductive synthesis modulo theories
• Program synthesis with equivalence reduction
• Programming by predicates: a formal model for interactive synthesis
• Abstraction-based interaction model for synthesis

Cites work

• Applied logistic regression
• Flattening and saturation: Two representation changes for generalization
• From program verification to program synthesis
• Introduction to algorithms.
• Large-scale machine learning with stochastic gradient descent
• Natural language processing with Python.
• On the formal semantics of IF-like logics
• Possible-translations algebraization for paraconsistent logics
• Program synthesis using deduction-guided reinforcement learning
• Refutation-based synthesis in SMT
• Scaling enumerative program synthesis via divide and conquer
• Second-Order Logic and Foundations of Mathematics
• Towards Complete Reasoning about Axiomatic Specifications

Describes a project that uses

Uses Software

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

This page was built for publication: Defining behaviorizeable relations to enable inference in semi-automatic program synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239281)