Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces

• URL: http://arxiv.org/abs/2108.05402v1
• Date: Wed, 11 Aug 2021 18:39:47 GMT
• Title: Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
• Authors: Damian Arellanes
• Abstract summary: We propose an abstract machine, called the composition machine, which allows the definition and the execution of such models. Unlike typical abstract machines, our proposal does not compute individual programs but enables the emergence of multiple programs at once.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We are entering a new era in which software systems are becoming more and more complex and larger. So, the composition of such systems is becoming infeasible by manual means. To address this challenge, self-organising software models represent a promising direction since they allow the (bottom-up) emergence of complex computational structures from simple rules. In this paper, we propose an abstract machine, called the composition machine, which allows the definition and the execution of such models. Unlike typical abstract machines, our proposal does not compute individual programs but enables the emergence of multiple programs at once. We particularly present the machine's semantics and provide examples to demonstrate its operation with well-known rules from the realm of Boolean logic and elementary cellular automata.

Related papers

• De-fine: Decomposing and Refining Visual Programs with Auto-Feedback [81.08213203440634]
  We introduce De-fine, a framework that decomposes complex tasks into simpler subtasks and refines programs through auto-feedback. Our experiments across various visual tasks show that De-fine creates more accurate and robust programs, setting new benchmarks in the field.
  arXiv  Detail & Related papers  (2023-11-21T06:24:09Z)
• ExeDec: Execution Decomposition for Compositional Generalization in Neural Program Synthesis [54.18659323181771]
  We characterize several different forms of compositional generalization that are desirable in program synthesis. We propose ExeDec, a novel decomposition-based strategy that predicts execution subgoals to solve problems step-by-step informed by program execution at each step.
  arXiv  Detail & Related papers  (2023-07-26T01:07:52Z)
• Learning-Based Automatic Synthesis of Software Code and Configuration [0.951828574518325]
  Large scale automatic software generation and configuration is a very complex and challenging task. In first task, we propose to synthesize software automatically with input output specifications. For the second task, we propose to synthesize configurations of large scale software from different input files.
  arXiv  Detail & Related papers  (2023-05-25T01:41:30Z)
• Modelling Concurrency Bugs Using Machine Learning [0.0]
  This project aims to compare both common and recent machine learning approaches. We define a synthetic dataset that we generate with the scope of simulating real-life (concurrent) programs. We formulate hypotheses about fundamental limits of various machine learning model types.
  arXiv  Detail & Related papers  (2023-05-08T17:30:24Z)
• A Conversational Paradigm for Program Synthesis [110.94409515865867]
  We propose a conversational program synthesis approach via large language models. We train a family of large language models, called CodeGen, on natural language and programming language data. Our findings show the emergence of conversational capabilities and the effectiveness of the proposed conversational program synthesis paradigm.
  arXiv  Detail & Related papers  (2022-03-25T06:55:15Z)
• Procedures as Programs: Hierarchical Control of Situated Agents through Natural Language [81.73820295186727]
  We propose a formalism of procedures as programs, a powerful yet intuitive method of representing hierarchical procedural knowledge for agent command and control. We instantiate this framework on the IQA and ALFRED datasets for NL instruction following.
  arXiv  Detail & Related papers  (2021-09-16T20:36:21Z)
• Launchpad: A Programming Model for Distributed Machine Learning Research [12.618286123360233]
  We introduce Launchpad, a programming model that simplifies the process of defining and launching distributed systems. We describe our framework, its design philosophy and implementation, and give a number of examples of common learning algorithms whose designs are greatly simplified by this approach.
  arXiv  Detail & Related papers  (2021-06-07T17:02:10Z)
• Controller Synthesis for Golog Programs over Finite Domains with Metric Temporal Constraints [5.254093731341154]
  Executing a Golog program on an actual robot typically requires additional steps to account for hardware or software details of the robot platform. We describe how to formulate such constraints based on a modal variant of the Situation Calculus. We show that for programs over finite domains, the problem of synthesizing a controller that satisfies the constraints while preserving the effects of the original program can be reduced to MTL synthesis.
  arXiv  Detail & Related papers  (2021-02-19T10:07:29Z)
• Representing Partial Programs with Blended Abstract Semantics [62.20775388513027]
  We introduce a technique for representing partially written programs in a program synthesis engine. We learn an approximate execution model implemented as a modular neural network. We show that these hybrid neuro-symbolic representations enable execution-guided synthesizers to use more powerful language constructs.
  arXiv  Detail & Related papers  (2020-12-23T20:40:18Z)
• Process Discovery for Structured Program Synthesis [70.29027202357385]
  A core task in process mining is process discovery which aims to learn an accurate process model from event log data. In this paper, we propose to use (block-) structured programs directly as target process models. We develop a novel bottom-up agglomerative approach to the discovery of such structured program process models.
  arXiv  Detail & Related papers  (2020-08-13T10:33:10Z)
• Program Synthesis with Pragmatic Communication [28.24612900419843]
  This work introduces a new inductive bias derived by modeling the program synthesis task as rational communication. A user study finds that end-user participants communicate more effectively with the pragmatic program synthesizer over a non-pragmatic one.
  arXiv  Detail & Related papers  (2020-07-09T20:55:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.