Filters








90 Hits in 2.4 sec

Scaling Enumerative Program Synthesis via Divide and Conquer [chapter]

Rajeev Alur, Arjun Radhakrishna, Abhishek Udupa
2017 Lecture Notes in Computer Science  
The key idea is to employ a divide-and-conquer approach by separately enumerating (a) smaller expressions that are correct on subsets of inputs, and (b) predicates on inputs that distinguish these subsets  ...  Given a semantic constraint specified by a logical formula, and syntactic constraints specified by a context-free grammar, the Syntax-Guided Synthesis (SyGuS) problem is to find an expression that satisfies  ...  To overcome this scalability issue, we introduce a divide-and-conquer enumerative algorithm.  ... 
doi:10.1007/978-3-662-54577-5_18 fatcat:w4oekwy72bf4jdb5ajxbtlmr4i

Programming by examples

Sumit Gulwani
2017 Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming - PPDP '17  
Our efficient search methodology is based on two key ideas: (i) Restriction of the search space to an appropriate domainspecific language that offers balanced expressivity and readability (ii) A divide-and-conquer  ...  99% of computer end users do not know programming, and struggle with repetitive tasks.  ...  The divide-and-conquer strategy underneath the various synthesis algorithms can be refactored out inside a framework.  ... 
doi:10.1145/3131851.3131853 dblp:conf/ppdp/Gulwani17 fatcat:56o4ajgwx5f7dbhislg3f77dci

Speeding up machine-code synthesis

Venkatesh Srinivasan, Tushar Sharma, Thomas Reps
2016 Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2016  
, and for the remaining formulas, speeds up synthesis by 3X.  ...  Instruction sets like Intel's IA-32 have around 43,000 unique instruction schemas; this huge instruction pool, along with the exponential cost inherent in enumerative synthesis, results in an enormous  ...  In summary, MCSYNTH uses a divide-and-conquer strategy in combination with footprint-based search-space pruning to combat the exponential cost of enumerative synthesis.  ... 
doi:10.1145/2983990.2984006 dblp:conf/oopsla/SrinivasanSR16 fatcat:47tnmknek5gvxnkfny4jtli3oe

Scaling up Superoptimization

Phitchaya Mangpo Phothilimthana, Aditya Thakur, Rastislav Bodik, Dinakar Dhurjati
2016 ACM SIGOPS Operating Systems Review  
We develop LENS, a search algorithm that increases the size of code a superoptimizer can synthesize by rapidly pruning away invalid candidate programs.  ...  These pruning strategies allow LENS to solve twice as many benchmarks as existing enumerative search algorithms, while LENS is about 11-times faster.  ...  Another pruning strategy using divide-and-conquer to break QFBV formula potentially reduces synthesis time by many orders of magnitude [28] , but it is likely synthesizing the same program as given.  ... 
doi:10.1145/2954680.2872387 fatcat:dyudxbtnm5hghfeg4pwngld2va

Scaling up Superoptimization

Phitchaya Mangpo Phothilimthana, Aditya Thakur, Rastislav Bodik, Dinakar Dhurjati
2016 SIGARCH Computer Architecture News  
We develop LENS, a search algorithm that increases the size of code a superoptimizer can synthesize by rapidly pruning away invalid candidate programs.  ...  These pruning strategies allow LENS to solve twice as many benchmarks as existing enumerative search algorithms, while LENS is about 11-times faster.  ...  Another pruning strategy using divide-and-conquer to break QFBV formula potentially reduces synthesis time by many orders of magnitude [28] , but it is likely synthesizing the same program as given.  ... 
doi:10.1145/2980024.2872387 fatcat:jjkzuerpojf47dxpwdtp5jqjzi

Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis [chapter]

Andrew Reynolds, Haniel Barbosa, Daniel Larraz, Cesare Tinelli
2020 Lecture Notes in Computer Science  
The procedure can be configured to generate progressively weaker and simpler solutions over the course of a run of the procedure.  ...  Our approach is fully general and can be applied over any background logic that is handled by the underlying SMT solver in our approach.  ...  Related Work The procedure introduced in Sect. 4.2 based on unsat core learning follows a recent trend in enumerative syntax-guided synthesis solving that aims to improve scalability by applying divide-and-conquer  ... 
doi:10.1007/978-3-030-51074-9_9 fatcat:d6ndidsc4ffjbams3nj2gfujfq

Scaling up Superoptimization

Phitchaya Mangpo Phothilimthana, Aditya Thakur, Rastislav Bodik, Dinakar Dhurjati
2016 SIGPLAN notices  
We develop LENS, a search algorithm that increases the size of code a superoptimizer can synthesize by rapidly pruning away invalid candidate programs.  ...  These pruning strategies allow LENS to solve twice as many benchmarks as existing enumerative search algorithms, while LENS is about 11-times faster.  ...  Another pruning strategy using divide-and-conquer to break QFBV formula potentially reduces synthesis time by many orders of magnitude [28] , but it is likely synthesizing the same program as given.  ... 
doi:10.1145/2954679.2872387 fatcat:lhu2j7hcjjdqxezwrnz2gfog74

Scaling up Superoptimization

Phitchaya Mangpo Phothilimthana, Aditya Thakur, Rastislav Bodik, Dinakar Dhurjati
2016 Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS '16  
We develop LENS, a search algorithm that increases the size of code a superoptimizer can synthesize by rapidly pruning away invalid candidate programs.  ...  These pruning strategies allow LENS to solve twice as many benchmarks as existing enumerative search algorithms, while LENS is about 11-times faster.  ...  Another pruning strategy using divide-and-conquer to break QFBV formula potentially reduces synthesis time by many orders of magnitude [28] , but it is likely synthesizing the same program as given.  ... 
doi:10.1145/2872362.2872387 dblp:conf/asplos/PhothilimthanaT16 fatcat:z67r6qsje5cijggqxonmwtpkqu

FlashMeta: a framework for inductive program synthesis

Oleksandr Polozov, Sumit Gulwani
2015 SIGPLAN notices  
Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming.  ...  This observation enables a novel program synthesis methodology called data-driven domain-specific deduction (D 4 ), where domain-specific insight, provided by the DSL designer, is separated from the synthesis  ...  initiative and for (re)implementation of multiple PBE-based applications on top of FlashMeta.  ... 
doi:10.1145/2858965.2814310 fatcat:dvvw76jbwjgxnm2vfw6b2c5eme

FlashMeta: a framework for inductive program synthesis

Oleksandr Polozov, Sumit Gulwani
2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015  
Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming.  ...  This observation enables a novel program synthesis methodology called data-driven domain-specific deduction (D 4 ), where domain-specific insight, provided by the DSL designer, is separated from the synthesis  ...  initiative and for (re)implementation of multiple PBE-based applications on top of FlashMeta.  ... 
doi:10.1145/2814270.2814310 dblp:conf/oopsla/PolozovG15 fatcat:uy7oen2t6fc7hn35m2zdeefxbq

Neural-Guided Deductive Search for Real-Time Program Synthesis from Examples [article]

Ashwin Kalyan, Abhishek Mohta, Oleksandr Polozov, Dhruv Batra, Prateek Jain, Sumit Gulwani
2018 arXiv   pre-print
Thus, it produces programs that satisfy the provided specifications by construction and generalize well on unseen examples, similar to data-driven systems.  ...  In this work, we propose Neural Guided Deductive Search (NGDS), a hybrid synthesis technique that combines the best of both symbolic logic techniques and statistical models.  ...  Following the divide-and-conquer paradigm, at each step it reduces its synthesis problem to smaller subproblems defined over the parameters of the current production.  ... 
arXiv:1804.01186v2 fatcat:bdovzu7cfrcrda2n4umckjs3na

ReGiS: Regular Expression Simplification via Rewrite-Guided Synthesis [article]

Jordan Schmerge, Miles Claver, Jackson Garner, Jake Vossen, Jedidiah McClurg
2021 arXiv   pre-print
We present a new approach called rewrite-guided synthesis (ReGiS), in which a unique interplay between SyGuS and equality saturation-based rewriting helps to overcome these problems, resulting in an efficient  ...  Syntax-guided synthesis (SyGuS) with a cost function can be used for this purpose, but ordered enumeration through a large space of candidate expressions can be expensive.  ...  [23] describe an approach which combines parallelism with a divide-and conquer methodology to perform synthesis with both enumeration and deduction (conceptually similar to rewriting).  ... 
arXiv:2104.12039v2 fatcat:urxthgmb7jcxnmw3dsa2ns32xu

Programming by Examples: PL Meets ML [chapter]

Sumit Gulwani, Prateek Jain
2017 Lecture Notes in Computer Science  
We leverage a divide-and-conquerbased deductive search paradigm that inductively reduces the problem of synthesizing a program expression of a certain kind that satisfies a given specification into sub-problems  ...  We leverage active-learning techniques based on clustering inputs and synthesizing multiple programs. Each of these PBE components leverage both symbolic reasoning and heuristics.  ...  in this article related to using ML techniques for search and ranking.  ... 
doi:10.1007/978-3-319-71237-6_1 fatcat:nou2fnkpt5elfj3ohaunnfmy7y

The Shape of Things to Run [chapter]

Josh Auerbach, Dave F. Bacon, Perry Cheng, Steve Fink, Rodric Rabbah
2013 Lecture Notes in Computer Science  
We present the design and implementation of new features in the Lime programming language that admit construction of stream graphs of arbitrary shape using the expressive power of an imperative, objectoriented  ...  If the check succeeds, the system guarantees it can extract the static structure needed for hardware synthesis.  ...  -Divide and Conquer: A form of recursive graph construction for divide Fig. 10 . 10 Graph construction using divide and conquer ).  ... 
doi:10.1007/978-3-642-39038-8_28 fatcat:smizdrf5x5artedb35e6mtncwm

Morphological methods for design of modular systems (a survey) [article]

Mark Sh. Levin
2012 arXiv   pre-print
The following methods are briefly described: (i) basic version of morphological analysis (MA), (ii) modification of MA as method of closeness to ideal point(s), (iii reducing of MA to linear programming  ...  The above-mentioned methods are illustrated by schemes, models, and illustrative examples. An additional realistic example (design of GSM network) is presented to illustrate main considered methods.  ...  MA is based on divide and conquer technique. A hierarchical structure of the designed system is a basis for usage of the method.  ... 
arXiv:1201.1712v1 fatcat:mjjsh626bvebjf65dcfswt7b6a
« Previous Showing results 1 — 15 out of 90 results