Filters








357,387 Hits in 3.7 sec

Synthesis with Abstract Examples [chapter]

Dana Drachsler-Cohen, Sharon Shoham, Eran Yahav
2017 Lecture Notes in Computer Science  
When the user accepts a set of abstract examples that covers the entire input space, the synthesis process is completed.  ...  We present a novel synthesis framework that communicates only through (abstract) examples and guarantees that the synthesized program is correct on all inputs.  ...  Synthesis with Abstract Examples In this section, we present our framework for synthesis with abstract examples.  ... 
doi:10.1007/978-3-319-63387-9_13 fatcat:737ux2l7xrbgnoczw3o3rwffwq

Learning Abstractions for Program Synthesis [article]

Xinyu Wang, Greg Anderson, Isil Dillig, K. L. McMillan
2018 arXiv   pre-print
Many example-guided program synthesis techniques use abstractions to prune the search space.  ...  While abstraction-based synthesis has proven to be very powerful, a domain expert needs to provide a suitable abstract domain, together with the abstract transformers of each DSL construct.  ...  The number of examples for each benchmark ranges from 1 to 400, with a median of 7 examples.  ... 
arXiv:1804.04152v1 fatcat:z7m5s4gyrvh7tldsoirruo3ina

Learning Abstractions for Program Synthesis [chapter]

Xinyu Wang, Greg Anderson, Isil Dillig, K. L. McMillan
2018 Lecture Notes in Computer Science  
Many example-guided program synthesis techniques use abstractions to prune the search space.  ...  While abstraction-based synthesis has proven to be very powerful, a domain expert needs to provide a suitable abstract domain, together with the abstract transformers of each DSL construct.  ...  The number of examples for each benchmark ranges from 1 to 400, with a median of 7 examples.  ... 
doi:10.1007/978-3-319-96145-3_22 fatcat:diejb7qrlbcodoywj2yrxymqyy

Program synthesis using abstraction refinement

Xinyu Wang, Isil Dillig, Rishabh Singh
2017 Proceedings of the ACM on Programming Languages  
We present a new approach to example-guided program synthesis based on counterexample-guided abstraction refinement.  ...  While synthesis using abstraction refinement (SYNGAR) could be implemented in different settings, we propose a refinement-based synthesis algorithm that uses abstract finite tree automata (AFTA).  ...  P that is consistent with the input-output examples with respect to its abstract semantics.  ... 
doi:10.1145/3158151 dblp:journals/pacmpl/WangDS18 fatcat:epe5sqludjfo3jgikimm2nxply

On the use of observation equivalence in synthesis abstraction

Sahar Mohajerani, Robi Malik, Simon Ware, Martin Fabian
2011 2011 3rd International Workshop on Dependable Control of Discrete Systems  
The paper concludes with an example showing the suitability of these relations to achieve substantial state reduction while computing a modular supervisor.  ...  In the current paper, observation equivalence is studied in relation to synthesis abstraction. It is shown that general observation equivalence is not useful for synthesis abstraction.  ...  In combination with example 4, this result confirms that synthesis observation equivalence can perform more abstraction than the projection-based method of [8] . V.  ... 
doi:10.1109/dcds.2011.5970323 fatcat:srh2bnuikzfmdjwto46qzcexju

Transition removal for compositional supervisor synthesis

Sahar Mohajerani, Robi Malik, Martin Fabian
2012 2012 IEEE International Conference on Automation Science and Engineering (CASE)  
Based on the results, different techniques are proposed to remove controllable and uncontrollable transitions, and an example shows the potential of the method for practical problems.  ...  This paper investigates under which conditions transitions can be removed from an automaton while preserving important synthesis properties.  ...  H is a state-wise (or transition-wise) synthesis abstraction of G with respect to Υ.  ... 
doi:10.1109/coase.2012.6386447 dblp:conf/case/MohajeraniMF12 fatcat:p3ode2w7nbeavgl2z3bgy42n3i

Program Synthesis using Abstraction Refinement [article]

Xinyu Wang and Isil Dillig and Rishabh Singh
2017 arXiv   pre-print
We present a new approach to example-guided program synthesis based on counterexample-guided abstraction refinement.  ...  However, since program P may be spurious with respect to the concrete semantics, our approach iteratively refines the abstraction until we either find a program that satisfies the examples or prove that  ...  P that is consistent with the input-output examples with respect to its abstract semantics.  ... 
arXiv:1710.07740v1 fatcat:3bhiypos6ragldzpgv5j7ckffa

Deep Transform: Error Correction via Probabilistic Re-Synthesis [article]

Andrew J.R. Simpson
2015 arXiv   pre-print
We then exploit the fact that this abstract transformation, which we call a deep transform (DT), inherently rejects information (errors) existing outside of the abstract feature space.  ...  Using the DT to perform probabilistic re-synthesis, we demonstrate the recovery of data that has been subject to extreme degradation.  ...  Probabilistic re-synthesis via deep transform. a shows example images from the MNIST dataset (left) with highly degraded instances (middle) and images corrected by DT probabilistic resynthesis (right).  ... 
arXiv:1502.04617v1 fatcat:nwg67wuubvclfa4dcorbmhwnqi

Synthesizing highly expressive SQL queries from input-output examples

Chenglong Wang, Alvin Cheung, Rastislav Bodik
2017 Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2017  
Using abstract queries to represent the search space nicely decomposes the synthesis problem into two tasks: (1) searching for abstract queries that can potentially satisfy the given I/O examples, and  ...  Our key innovation is the development of a language for abstract queries, i.e., queries with uninstantiated operators, that can express a large space of SQL queries efficiently.  ...  With these optimizations, the predicate synthesis algorithm efficiently searches for instantiations of abstract queries that are consistent with the provided I/O example.  ... 
doi:10.1145/3062341.3062365 dblp:conf/pldi/WangCB17 fatcat:ap2kzhjks5cinofsafl3xxs3oe

A Framework for Compositional Synthesis of Modular Nonblocking Supervisors

Sahar Mohajerani, Robi Malik, Martin Fabian
2014 IEEE Transactions on Automatic Control  
The paper describes synthesis equivalent abstractions and shows their use in an algorithm to efficiently compute supervisors.  ...  The state-space explosion is mitigated by the use of abstraction to simplify individual components, and the property of synthesis equivalence guarantees that the final synthesis result is the same as it  ...  Example 2: Consider automaton G in Fig. 9 with Σ u = {!λ, !µ, !υ} and Υ = {γ, !λ}. State q 3 is blocking, so q 2 is Fig. 9 . Example of halfway synthesis. Uncontrollable events are prefixed with !  ... 
doi:10.1109/tac.2013.2283109 fatcat:bfu7umdf5bfgldvypuhzqx253q

G4LTL-ST: Automatic Generation of PLC Programs [chapter]

Chih-Hong Cheng, Chung-Hao Huang, Harald Ruess, Stefan Stattelmann
2014 Lecture Notes in Computer Science  
The synthesis algorithm of G4LTL-ST implements pseudo-Boolean abstraction of data constraints and the compilation of timing constraints into LTL, together with a counterstrategy-guided abstraction-refinement  ...  synthesis loop.  ...  Abstraction-Refinement Synthesis Loop The input to the synthesis engine of G4LTL-ST are LTL formulas with non-linear arithmetic constraints with bounded real (or rational) variables, and the workflow of  ... 
doi:10.1007/978-3-319-08867-9_36 fatcat:sd76q5moorf6pkb7lcykr5l2ja

Combining Induction, Deduction, and Structure for Verification and Synthesis

Sanjit A. Seshia
2015 Proceedings of the IEEE  
The second is to solve the resulting synthesis problem by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure.  ...  Even with impressive advances in formal methods, certain major challenges remain.  ...  over many years in collaboration with several students and colleagues. The contributions of Susmit Jha, in particular, are gratefully acknowledged.  ... 
doi:10.1109/jproc.2015.2471838 fatcat:cfj3tcy3njg3debcuxzqjye2ii

Inductive Program Synthesis over Noisy Datasets using Abstraction Refinement Based Optimization [article]

Shivam Handa, Martin Rinard
2021 arXiv   pre-print
We present a new synthesis algorithm to solve program synthesis over noisy datasets, i.e., data that may contain incorrect/corrupted input-output examples.  ...  of up to 1587 and 81.7, with median speedups of 20.5 and 81.7.  ...  abstract values with each symbol.  ... 
arXiv:2104.13315v1 fatcat:nk5bfzwx3nhorkiifjqfg7huui

An Algorithm for Weak Synthesis Observation Equivalence for Compositional Supervisor Synthesis

Sahar Mohajerani, Robi Malik, Martin Fabian
2012 IFAC Proceedings Volumes  
It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be made.  ...  It successfully computes modular supervisors, even for systems with more than 10 12 reachable states.  ...  (H T )) = L(G T supCN (G T )) . (7) Synthesis abstraction requires that the supervisor synthesised from the abstracted automaton H together with the rest of the system T , yields the same language when  ... 
doi:10.3182/20121003-3-mx-4033.00040 fatcat:cfdn7xijrrgazgekcqm4vguzqq

Representing Partial Programs with Blended Abstract Semantics [article]

Maxwell Nye, Yewen Pu, Matthew Bowers, Jacob Andreas, Joshua B. Tenenbaum, Armando Solar-Lezama
2021 arXiv   pre-print
Synthesizing programs from examples requires searching over a vast, combinatorial space of possible programs.  ...  We introduce a general technique for representing partially written programs in a program synthesis engine.  ...  PROGRAM SYNTHESIS WITH BLENDED ABSTRACT SEMANTICS To perform synthesis, we experiment with methods to guide search introduced in Ellis et al. (2019). 3 In this work, the search over partial programs  ... 
arXiv:2012.12964v2 fatcat:sw2vlyno3bci3jmz7w362bu6wq
« Previous Showing results 1 — 15 out of 357,387 results