25 papers · ranked by Valyu relevance
Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen, Saba Aflaki
Randomization is a key concept in distributed computing to tackle impossibility results. This also holds for self-stabilization in anonymous networks where coin flips are often used to break symmetry. Although the use of randomization in self-stabilizing algorithms is rather common, it is unclear what the optimal coin…
Yong‐Ho Yoon, Woosuk Lee, Kwangkeun Yi
A key challenge in example-based program synthesis is the gigantic search space of programs. To address this challenge, various work proposed to use abstract interpretation to prune the search space. However, most of existing approaches have focused only on forward abstract interpretation, and thus cannot fully exploit…
Gergely Zahoránszky-Kőhalmi, Nikita Lysov, Ilia Vorontcov, Jeffrey Wang + 6 more
'Jeffrey Wang' 'Jeyaraman Soundararajan' 'Dimitrios Metaxotos' 'Biju Mathew' 'Rafat Sarosh' 'Samuel G. Michael' 'Alexander G. Godfrey'] Synthesis route planning is in the core of chemical intelligence that will power the autonomous chemistry platforms. In this task, we rely on algorithms to generate possible synthesis…
Alessandro Abate, Haniel Barbosa, Clark Barrett, Cristina David + 5 more
'Pascal Kesseli' 'Daniel Kroening' 'Elizabeth Polgreen' 'Andrew Reynolds' 'Cesare Tinelli'] Program synthesis is the mechanised construction of software. One of the main difficulties is the efficient exploration of the very large solution space, and tools often require a user-provided syntactic restriction of the…
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…
Bernd Finkbeiner, Noemi Passing
In contrast to the breakthroughs in reactive synthesis of monolithic systems, distributed synthesis is not yet practical. Compositional approaches can be a key technique for scalable algorithms. Here, the challenge is to decompose a specification of the global system into local requirements on the individual processes.…
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…
Smaran Adarsh, Lukas Burgholzer, Tanmay Manjunath, Robert Wille
Reversible circuits form the backbone for many promising emerging technologies such as quantum computing, low power/adiabatic design, encoder/decoder devices, and several other applications. In the recent years, the scalable synthesis of such circuits has gained significant attention. In this work, we present the SyReC…
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…
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, Sławomir 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 achieve any task that can be algorithmically described by executing a series of…
Hongxiang Li, Xuan Liu, Guangde Jiang, Huimin Zhao
Thanks to the growing interests in computer-aided synthesis planning (CASP), a wide variety of retrosynthesis and retrobiosynthesis tools have been developed in the past decades. However, synthesis planning tools for multi-step chemoenzymatic reactions are still rare despite the widespread use of enzymatic reactions in…
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…
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…
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…
Michel Adam, Patrice Frison, Sabine Letellier Zarshenas, Moncef Daoud
Program construction in imperative languages remains largely based on writing textual code that specifies sequences of instructions operating on program data. This approach requires developers to anticipate the effects of instructions on evolving data states, which increases cognitive load and the likelihood of errors…
Eli N. Weinstein, Alan N. Amin, Will Grathwohl, Daniel Kassler + 2 more
Generative probabilistic models of biological sequences have widespread existing and potential applications in analyzing, predicting and designing proteins, RNA and genomes. To test the predictions of such a model experimentally, the standard approach is to draw samples, and then synthesize each sample individually in…
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…
Jiangyi Liu, Charlie Murphy, Anvay Grover, Keith J. C. Johnson + 2 more
'Thomas Reps' 'Loris D’Antoni'] Program verification and synthesis frameworks that allow one to customize the language in which one is interested typically require the user to provide a formally defined semantics for the language. Because writing a formal semantics can be a daunting and error-prone task, this…
Chonghuan Zhang, Alexei Lapkin
Computer assisted synthesis planning (CASP) accelerates the development of organic synthesis routes of pharmaceuticals and industrial chemicals. CASP tools are generally developed on the rules or data of synthetic chemistry which include some enzymatic reactions. However, synthetic biology offers a new degree of…
Laurence Legon, Christophe Corre, Declan G. Bates, Ahmad A. Mannan
A widely applicable strategy for developing evolutionarily robust cell factories is to knock out (KO) genes or reactions to couple chemical synthesis with cell growth. Genome-scale metabolic models enable their rational design, but KOs that provide growth-coupling (gc) are rare in the immense design space, making…
Eli N. Weinstein, Mattia G. Gollub, Andrei Slabodkin, Cameron L. Gardner + 5 more
We introduce a method to reduce the cost of synthesizing proteins and other biological sequences designed by a generative model by as much as a trillion-fold. In particular, we make our generative models manufacturing-aware, such that model-designed sequences can be efficiently synthesized in the real world with…
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…