22 papers · ranked by Valyu relevance
Cristina David, Daniel Kroening
Program synthesis is the mechanized construction of software, dubbed ‘self-writing code’. Synthesis tools relieve the programmer from thinking about how the problem is to be solved; instead, the programmer only provides a description of what is to be achieved. Given a specification of what the program should do, the…
Shmuel Berman, Mark Santolucito
—Program synthesis has seen many new applications in recent years, in large part thanks to the introduction of SyGuS. However, no existing SyGuS solvers have support for synthesizing recursive functions. We introduce an multi-phase algorithm for the synthesis of recursive "looplike" programs in SyGuS for…
Authors not listed
Identifying synthesis routes from knowledge graphs poses challenges beyond retrosynthesis, including path–finding artifacts and data issues. We introduce “SynGPS”, a novel algorithm that overcomes these limitations by identifying viable routes even with common artifacts. SynGPS can resolve nonsensical cycles…
Shuvendu K. Lahiri, Chao Wang, Yanju Chen, Chenglong Wang + 3 more
'Osbert Bastani' 'Isil Dillig' 'Yu Feng'] In this paper, we present a new program synthesis algorithm based on reinforcement learning. Given an initial policy (i.e. statistical model) trained off-line, our method uses this policy to guide its search and gradually improves it by leveraging feedback obtained from a…
Authors not listed
Program synthesis – the automatic generation of code given a specification – is one of the most fundamental tasks in artificial intelligence (AI) and many programmers' dream. Numerous synthesizers have been developed to tackle program synthesis, manifesting different ideas to approach the exponentially growing program…
Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi + 26 more
'Marco Selvi' 'Cosmin Paduraru' 'Edouard Leurent' 'Shariq Iqbal' 'Jean-Baptiste Lespiau' 'Alex Ahern' 'Thomas Köppe' 'Kevin Millikin' 'Stephen Gaffney' 'Sophie Elster' 'Jackson Broshear' 'Chris Gamble' 'Kieran Milan' 'Robert Tung' 'Minjae Hwang' 'Taylan Cemgil' 'Mohammadamin Barekatain' 'Yujia Li' 'Amol Mandhane'…
Jinwoo Kim
To answer this question, this paper studies program synthesis for a basic imperative, Turing-complete language IMP, for which this paper proves that program synthesis is Σ 0 3 -complete in the arithmetical hierarchy. The proof of this fact relies on a fully constructive encoding of program synthesis (which is typically…
Aditya Pratapa, Amogh P. Jalihal, S. S. Ravi, T. M. Murali
The genetic cross is a fundamental, flexible, and widely-used experimental technique to create new mutant strains from existing ones. Surprisingly, the problem of how to efficiently compute a sequence of crosses that can make a desired target mutant from a set of source mutants has received scarce attention. In this…
Margarida Ferreira, Victor Nicolet, Joey Dodds, Daniel Kroening
We present the first technique to synthesize programs that compose side-effecting functions, pure functions, and control flow, from partial traces containing records of only the side-effecting functions. This technique can be applied to synthesize API composing scripts from logs of calls made to those APIs, or a script…
Daniel Gahler, Dean Thomas, Slawomir Lach, Leroy Cronin
Complete Chemputer Authors: Daniel Gahler, Dean Thomas, Slawomir Lach, Leroy Cronin The most fundamental abstraction underlying all modern computers is the Turing Machine, that is, if any modern computer can simulate a Turing Machine, an equivalence which is called “Turing completeness”, it is theoretically possible to…
Bernd Finkbeiner, Gideon Geier, Noemi Passing
Reactive synthesis is the task of automatically deriving a correct implementation from a specification. It is a promising technique for the development of verified programs and hardware. Despite recent advances in terms of algorithms and tools, however, reactive synthesis is still not practical when the specified…
M. Ali Al-Radhawi, Anh Phong Tran, Elizabeth A. Ernst, Tianchi Chen + 2 more
Starting in the early 2000s, a sophisticated technology has been developed for the rational construction of synthetic genetic networks that implement specified logical functionalities. Despite impressive progress, however, the scaling necessary in order to achieve greater computational power has been hampered by many…
Anh Phong Tran, Dhruv D. Jatkar, M. Ali Al-Radhawi, Elizabeth A. Ernst + 1 more
Minimal synthesis of Boolean functions is an NP-hard problem, and heuristic approaches typically give suboptimal circuits. However, in the emergent field of synthetic biology, genetic logic designs that use even a single additional Boolean gate can render a circuit unimplementable in a cell. This has led to a renewed…
Authors not listed
Computer-aided synthesis planning aims to identify viable synthetic routes from a target compound to readily available building blocks by iteratively decomposing molecules into smaller precursors. Self-play search algorithms, trained with simulated experience, reach state-of-the-art performance. However, these methods…
Rolf Fagerberg, Christoph Flamm, Rojin Kianian, Daniel Merkle + 1 more
'Peter F. Stadler'] In synthesis planning, the goal is to synthesize a target molecule from available starting materials, possibly optimizing costs such as price or environmental impact of the process. Current algorithmic approaches to synthesis planning are usually based on selecting a bond set and finding a single…
Brandon Walker, Nathan Miller, Brett Yang, Dhatri V. L. Penna + 15 more
Rapid generation and evaluation of diverse synthesis pathways play a critical role in exploring a broader chemical space and identifying potent drug candidates. Drug discovery often relies on laborintensive manual processes for retro synthetic route finding, resulting in challenges related to scalability and…
Hal Finkel, Ignacio Laguna
In scientific computing, domain-specific languages have a long history, and scientists and engineers have increased the productivity of programming by creating specialized translators from mathematical expressions to code in C, C++, or Fortran. While many of these tools have an implicit implementation specification…
Megan Stanley, Marwin Segler
Computational techniques, including virtual screening, de novo design, and generative models, play an increasing role in expediting DMTA cycles for modern molecular discovery. However, computationally proposed molecules must be synthetically feasible for laboratory testing. In this perspective, we offer a succinct…
Tobias Schladt, Nicolai Engelmann, Erik Kubaczka, Christian Hochberger + 1 more
Genetic design automation methods for combinational circuits often rely on standard algorithms from electronic design automation in their circuit synthesis and technology mapping. However, those algorithms are domain-specific and are hence often not directly suitable for the biological context. In this work we identify…
Grzegorz Skoraczyński, Mateusz Kitlas, Błażej Miasojedow, Anna Gambin
Modern computer-assisted synthesis planning tools provide strong support for this problem. However, they are still limited by computational complexity. This limitation may be overcome by scoring the synthetic accessibility as a pre-retrosynthesis heuristic. A wide range of machine learning scoring approaches is…
Maranga Mokaya, Charlotte M. Deane, Anthony R. Bradley
Synthesising compounds is a major component of the time and cost of drug discovery. Retrosynthesis approaches have grown in prominence in efficiently predicting synthetic routes. For such tools to be truly impactful they should be able to effectively incorporate rarely seen chemical reactions and synthesise unknown…
Authors not listed
Automated chemistry platforms hold the potential to enable large-scale organic synthesis campaigns, such as producing a library of compounds for biological evaluation. The efficiency of such platforms will depend on the schedule according to which the synthesis operations are executed. In this work, we study the…