10,449 Hits in 9.0 sec

Synthesis of Data Word Transducers [article]

Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
2021 arXiv   pre-print
In the unbounded setting, we show undecidability for both universal and nondeterministic specifications, while decidability is recovered in the deterministic case.  ...  In the bounded setting, undecidability still holds for nondeterministic specifications, but can be recovered by disallowing tests over input data.  ...  Such result allows us to reduce unbounded synthesis to bounded synthesis for DRA ∅ . Bounded synthesis is in ExpSpace for DRA (Thm. 13) and is the topic of the next section.  ... 
arXiv:1905.03538v5 fatcat:xb7oqut5kbaltjdc5b25xodga4

Synthesis of Data Word Transducers

Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
2019 Logical Methods in Computer Science  
In the unbounded setting, we show undecidability for both universal and nondeterministic specifications, while decidability is recovered in the deterministic case.  ...  In the bounded setting, undecidability still holds for nondeterministic specifications, but can be recovered by disallowing tests over input data.  ...  Acknowledgments The authors would like to thank Ayrat Khalimov for his remarks and suggestions, which helped improve the quality of the paper.  ... 
doi:10.23638/lmcs-17(1:22)2021 fatcat:hjtfxs6p5rg4hh45aaowensj7y

The Church Synthesis Problem with Metric

Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell, Marc Herbstritt
2011 Annual Conference for Computer Science Logic  
We show that for every fixed bounded length interval of the reals, Church's problem is decidable when specifications and implementations are described in the monadic second-order logics over the reals  ...  the specification in the sense that ϕ(I, F (I)) holds for all inputs I.  ...  Finally, we show that the synthesis problem over bounded intervals of reals is nonelementary, even for specifications expressed in fragments of MSO(<, +1) with an elementary satisfiability problem.  ... 
doi:10.4230/lipics.csl.2011.307 dblp:conf/csl/JenkinsORW11 fatcat:45luxvniongbnldmt7drzntlz4

Specification-Based Monitoring of Cyber-Physical Systems: A Survey on Theory, Tools and Applications [chapter]

Ezio Bartocci, Jyotirmoy Deshmukh, Alexandre Donzé, Georgios Fainekos, Oded Maler, Dejan Ničković, Sriram Sankaranarayanan
2018 Lecture Notes in Computer Science  
Rigorous Specification Formalisms.  ...  A primitive form of this type of monitoring exists in many domains: indicators on the control panel of a car, airplane or electronic device, monitors for physiological conditions of patients in a hospital  ...  For unbounded past operators, the algorithm exploits the fact that an unbounded past formula can be rewritten such that the computation over an unbounded history can be stored as a summary in a variable  ... 
doi:10.1007/978-3-319-75632-5_5 fatcat:2m52qvfax5cn3fgyhcl3piy2ui

Compiler Infrastructure for Specializing Domain-Specific Memory Templates [article]

Stephanie Soldavini, Christian Pilato
2021 arXiv   pre-print
To simplify this process, we propose a multi-level compilation flow that specializes a domain-specific memory template to match data, application, and technology requirements.  ...  Specialized hardware accelerators are becoming important for more and more applications.  ...  CONCLUSION We described a novel approach for specializing domain-specific memory templates during the compilation flow and before highlevel synthesis of the accelerator logic.  ... 
arXiv:2104.01448v1 fatcat:z4vytguw7bagzfabvvfat45wru

Synthesis with Abstract Examples [chapter]

Dana Drachsler-Cohen, Sharon Shoham, Eran Yahav
2017 Lecture Notes in Computer Science  
The main idea is to use abstract examples-a new form of examples that represent a potentially unbounded set of concrete examples.  ...  A user that wishes to guarantee correctness for all possible inputs has to manually inspect the synthesized program, an error-prone and challenging task.  ...  The former domain is suitable for end users, as targeted by approaches like Flash Fill or learning regular expressions.  ... 
doi:10.1007/978-3-319-63387-9_13 fatcat:737ux2l7xrbgnoczw3o3rwffwq


Vincent Richard, Renaud Loison, Raphael Gillard, Herve Legay, Maxime Romier, Jean-Paul Martinaud, Daniele Bresciani, Fabien Delepaux
2019 Progress In Electromagnetics Research C  
It relies on an original spherical representation that transforms the optimization domain in a continuous and unbounded space with reduced dimension.  ...  A general synthesis approach is proposed for reflectarrays using second order Phoenix cells.  ...  Furthermore, the mapping transforms the initial optimization domain into an unbounded periodic space, and it also reduces its dimension.  ... 
doi:10.2528/pierc18102303 fatcat:3yvjd4dkpbauzfqczh3av74uoi

Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061)

Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, Wolfgang Thomas, Marc Herbstritt
2015 Dagstuhl Reports  
applications from the control domain.  ...  Other domains Theoretical results developed for games have been generalized to problems in other settings as well.  ... 
doi:10.4230/dagrep.5.2.1 dblp:journals/dagstuhl-reports/ChatterjeeLMT15 fatcat:3g2k4ej7n5hczbe33yhxrh3h5a

Church Synthesis on Register Automata over Linearly Ordered Data Domains [article]

Léo Exibard, Emmanuel Filiot, Ayrat Khalimov
2021 arXiv   pre-print
We study the synthesis problem for specifications given as register automata over a linearly ordered data domain (e.g.  ...  This is in contrast with the equality case, where the problem is only undecidable for nondeterministic and universal specifications.  ...  As an application, we prove the decidability of a synthesis problem of deterministic register transducers over linearly ordered data domains.  ... 
arXiv:2004.12141v2 fatcat:tfkcrgmv7rcwbecev4dh6rkdwe

DDNeRF: Depth Distribution Neural Radiance Fields [article]

David Dadon, Ohad Fried, Yacov Hel-Or
2022 arXiv   pre-print
Models such as neural radiance fields (NeRF), which uses relatively small neural networks, can represent high-quality scenes and achieve state-of-the-art results for novel view synthesis.  ...  More specifically, we train a coarse model to predict the internal distribution of the transparency of an input volume in addition to the volume's total density.  ...  Acknowledgements This work was supported by the Israeli Ministry of Science and Technology under The National Foundation for Applied Science (MIA), and was partially supported by the Israel Science Foundation  ... 
arXiv:2203.16626v1 fatcat:ndcyqqw6zndb3cyj5i44ohua6e

Decidable Synthesis of Programs with Uninterpreted Functions [chapter]

Paul Krogmeier, Umang Mathur, Adithya Murali, P. Madhusudan, Mahesh Viswanathan
2020 Lecture Notes in Computer Science  
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains.  ...  We formulate a powerful grammar-restricted (syntax-guided) synthesis problem for coherent uninterpreted programs, and we show the problem to be decidable, identify its precise complexity, and also study  ...  Another setting with a decidable synthesis result over unbounded domains is work on strategy synthesis for linear arithmetic satisfiability games [17] .  ... 
doi:10.1007/978-3-030-53291-8_32 fatcat:hertfunhojfglaq3tgjpxgac64

Synthesis over Regularly Approximable Data Domains [article]

Léo Exibard, Emmanuel Filiot, Ayrat Khalimov
2021 arXiv   pre-print
We then introduce a notion of reducibility between data domains which we exploit to show decidability of synthesis over, e.g., the domains (ℕ^d, =^d, <^d) of tuples of numbers equipped with the component-wise  ...  for equality.  ...  Lemmas 2,3, 4 reduce register-bounded synthesis to (finite-alphabet) synthesis for the ω-regular specification W qf S,k .  ... 
arXiv:2105.09978v3 fatcat:xyb2whrphncgnlit2omn2up2fm

Task-Level Data Model for Hardware Synthesis Based on Concurrent Collections

Jason Cong, Karthik Gururaj, Peng Zhang, Yi Zou
2012 Journal of Electrical and Computer Engineering  
The state-of-art concurrent specification models are not suitable for modeling task-level concurrent behavior for the hardware synthesis design flow.  ...  for data processing applications.  ...  Acknowledgement This work is partially funded by the Center for Domain-Specific Computing (NSF Expeditions in Computing Award CCF-0926127), and the Semiconductor Research Corporation under Contract 2009  ... 
doi:10.1155/2012/691864 fatcat:p25oxad2e5e3neqpzegft77qhe

Synthesizing Computable Functions from Rational Specifications over Infinite Words [article]

Emmanuel Filiot, Sarah Winter
2021 arXiv   pre-print
In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing computability notion over infinite inputs.  ...  This entails the decidability of the synthesis problem of computable functions, which we prove to be ExpTime-complete, for a large subclass of rational specifications, namely deterministic rational specifications  ...  may need unbounded memory, as illustrated by the specification R 1 for which any infinite-input Turing-machine realizing the specification needs unbounded memory.  ... 
arXiv:2103.05674v3 fatcat:q5p5rnhct5cqpa3mwz2a5evqqu

Programmable Program Synthesis [chapter]

Loris D'Antoni, Qinheping Hu, Jinwoo Kim, Thomas Reps
2021 Lecture Notes in Computer Science  
However, for synthesis to become a mainstream technique adopted at large by programmers as well as by end-users, we need to design programmable synthesis frameworks that (i) are not tailored to specific  ...  AbstractProgram synthesis is now a reality, and we are approaching the point where domain-specific synthesizers can now handle problems of practical sizes.  ...  Research Awards; by a Microsoft Faculty Fellowship; by NSF under grants 1420866, 1763871, and 1750965; by ONR under grants N00014-17-1-2889 and N00014-19-1-2318; and a grant from the Korea Foundation for  ... 
doi:10.1007/978-3-030-81685-8_4 fatcat:osmodpksw5cufgczwanjbmwjhu
« Previous Showing results 1 — 15 out of 10,449 results