Automated Generation of Executable Cross-Language Background Knowledge
Certain problems require specific semanticknowledge to be solved, e.g. the transformation “January→1”.Without the requireddomain specific knowledge, a program synthesizer can’t generalize towards a program thatalso learns the other months of the year. Online repositories of code contain many of thesetransformations and they can be used to improve the semantic strength of a synthesis technique. By reusing previouslywritten code that contains parts of or the entiretransformation, these domain specific problemscan now be solved as well. This backgroundknowledge, in the form of method declarations,is however not easily available in a uniform format. The lack of formalization of this processresults in handcrafted crawling and parsing software for each program synthesis technique, ascan be found in recent works. Moreover, when the program space spans over multiple programminglanguages these techniques have to be adapted bythe synthesis researchers for each separate language. This work tries to formalize the processof generating executable background knowledgein multiple programming languages that can beused in different synthesis techniques.Suchframework would lower the amount of time spenton crawling, parsing and runtime environmentswithin future research projects.
Code (0)
등록된 구현이 없습니다.
Tasks
Program SynthesisSimilar Papers 제목 키워드 기반
What Makes AI Research Replicable? Executable Knowledge Graphs as Scientific Knowledge Representations
Replicating AI research is a crucial yet challenging task for large language model (LLM) agents. Existing approaches often struggle to generate executable code, primarily due to insufficient background knowledge and the …
Knowledge GraphsLarge Language Models for Code Generation: A Comprehensive Survey of Challenges, Techniques, Evaluation, and Applications
Large Language Models (LLMs) have demonstrated their remarkable capabilities in numerous fields. This survey focuses on how LLMs empower users, regardless of their technical background, to use human languages to automati…
Code GenerationSurveyAmbiguity Detection and Elimination in Automated Executable Process Modeling
Automated generation of executable Business Process Model and Notation (BPMN) models from natural-language specifications is increasingly enabled by large language models. However, ambiguous or underspecified text can yi…
Automatic Generation of Executable BPMN Models from Medical Guidelines
We present an end-to-end pipeline that converts healthcare policy documents into executable, data-aware Business Process Model and Notation (BPMN) models using large language models (LLMs) for simulation-based policy eva…
LLM4SFC: Sequential Function Chart Generation via Large Language Models
While Large Language Models (LLMs) are increasingly used for synthesizing textual PLC programming languages like Structured Text (ST) code, other IEC 61131-3 standard graphical languages like Sequential Function Charts (…