Filters








169 Hits in 2.3 sec

Proving Unrealizability for Syntax-Guided Synthesis [article]

Qinheping Hu, Jason Breck, John Cyphert, Loris D'Antoni, Thomas Reps
2019 arXiv   pre-print
Proving Unrealizability for Syntax-Guided Synthesis We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no solution).  ...  NOPE can prove unrealizability for 59/134 variants of existing linear-integer-arithmetic SyGus benchmarks, whereas all existing SyGus solvers lack the ability to prove that these benchmarks are unrealizable  ...  Syntax-Guided Synthesis.  ... 
arXiv:1905.05800v3 fatcat:em6gxv76qvdcjhpz3pbccumbnm

Proving Unrealizability for Syntax-Guided Synthesis [chapter]

Qinheping Hu, Jason Breck, John Cyphert, Loris D'Antoni, Thomas Reps
2019 Lecture Notes in Computer Science  
We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no solution).  ...  We implemented the proposed technique in a tool called nope. nope can prove unrealizability for 59/132 variants of existing linear-integer-arithmetic SyGuS benchmarks, whereas all existing SyGuS solvers  ...  Syntax-Guided Synthesis.  ... 
doi:10.1007/978-3-030-25540-4_18 fatcat:h5owclerpvh27fhje5bi6rwq74

Exact and Approximate Methods for Proving Unrealizability of Syntax-Guided Synthesis Problems [article]

Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas Reps
2020 pre-print
We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no solution).  ...  Nay can prove unrealizability for 70/132 existing SyGuS benchmarks, with running times comparable to those of the state-of-the-art tool Nope.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1145/3385412.3385979 arXiv:2004.00878v1 fatcat:gnkkuhwtmzfr7afyj5rep7sajq

Semantics-Guided Synthesis [article]

Jinwoo Kim, Qinheping Hu, Loris D'Antoni, Thomas Reps
2020 arXiv   pre-print
This paper develops a new framework for program synthesis, called semantics-guided synthesis (SemGuS), that allows a user to provide both the syntax and the semantics for the constructs in the language  ...  In addition to the SemGuS framework, we develop an algorithm for solving SemGuS problems that is capable of both synthesizing programs and proving unrealizability, by encoding a SemGuS problem as a proof  ...  This question was partly answered by the framework of of syntax-guided synthesis (SyGuS) [1] , which provides a logical framework for defining synthesis problems.  ... 
arXiv:2008.09836v1 fatcat:bv7c3f36vrbkjmhcjombn3bnz4

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  ...  We report on our work on designing such frameworks and on building synthesis engines that can handle program-synthesis problems describable in such frameworks, and describe open challenges and opportunities  ...  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

Spectra: a specification language for reactive systems

Shahar Maoz, Jan Oliver Ringert
2021 Journal of Software and Systems Modeling  
AbstractWe introduce Spectra, a new specification language for reactive systems, specifically tailored for the context of reactive synthesis.  ...  The collected specifications can serve as benchmarks for future studies on reactive synthesis.  ...  We thank Elizabeth Firman, Aviv Kuvent, Or Pistiner, Rafi Shalom, Ilia Shevrin, Keren Solodkin, and Yoni Wolbe for their contribution to the implementation of Spectra Tools.  ... 
doi:10.1007/s10270-021-00868-z fatcat:okjmdffdxbdxdladfiaqztjqu4

Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts [article]

Andreas Katis, Grigory Fedyukovich, Huajun Guo, Andrew Gacek, John Backes, Arie Gurfinkel, Michael W. Whalen
2018 arXiv   pre-print
Automated synthesis of reactive systems from specifications has been a topic of research for decades.  ...  Experimental results show how the new algorithm outperforms JKinds already existing synthesis procedure based on k-induction and addresses soundness issues in the k-inductive approach with respect to unrealizable  ...  Validity-Guided Synthesis from Assume-Guarantee Contracts Alg. 1, named JSyn-vg (for validity guided), shows the validity-guided technique that we use towards the automatic synthesis of implementations  ... 
arXiv:1709.04986v2 fatcat:4bq44mfugndhbeolkvrenus7xe

Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts [chapter]

Andreas Katis, Grigory Fedyukovich, Huajun Guo, Andrew Gacek, John Backes, Arie Gurfinkel, Michael W. Whalen
2018 Lecture Notes in Computer Science  
Automated synthesis of reactive systems from specifications has been a topic of research for decades.  ...  unrealizable results.  ...  Validity-Guided Synthesis from Assume-Guarantee Contracts Algorithm 1, named JSyn-vg (for validity guided), shows the validity-guided technique that we use towards the automatic synthesis of implementations  ... 
doi:10.1007/978-3-319-89963-3_10 fatcat:7ae7juzryfgkvagaxaqpptatly

Interpolation-Based GR(1) Assumptions Refinement [article]

Davide G. Cavezza, Dalal Alrajeh
2018 arXiv   pre-print
We propose a new counterstrategy-guided synthesis approach for GR(1) specifications based on Craig's interpolants.  ...  Our interpolation-based method identifies causes for unrealizability and computes assumptions that directly target unrealizable cores, without the need for user input.  ...  of the Oracle-Guided Inductive Synthesis (OGIS) framework [43, 27] .  ... 
arXiv:1611.07803v3 fatcat:6aewhlewxrapnhvphz2s2c65zq

Counter play-out: Executing unrealizable scenario-based specifications

Shahar Maoz, Yaniv Sa'ar
2013 2013 35th International Conference on Software Engineering (ICSE)  
This results in an interactive, guided execution, leading to the root causes of unrealizability.  ...  In this paper we present counter play-out, an interactive debugging method for unrealizable scenario-based specifications.  ...  Note that in debugging a reactive system, a single execution path does not suffice to prove unrealizability; instead, guided interactivity is an advantage, as it allows to simulate and examine the choices  ... 
doi:10.1109/icse.2013.6606570 dblp:conf/icse/MaozS13 fatcat:lidvfy6yi5bidjc363tqkxnfx4

Two-Way Traceability and Conflict Debugging for AspectLTL Programs [chapter]

Shahar Maoz, Yaniv Sa'ar
2013 Lecture Notes in Computer Science  
In this work we address these challenges in the context of AspectLTL, a temporallogic based language for the specification and implementation of crosscutting concerns, which has a composition and synthesis-based  ...  When a specification is unrealizable, we provide an interactive game proof that demonstrates conflicts that should be fixed. The techniques are implemented and demonstrated using running examples.  ...  in this case for our example of proving unrealizability).  ... 
doi:10.1007/978-3-642-36964-3_2 fatcat:mje4qwivjfbedjfasw7sv2zfu4

Two-way traceability and conflict debugging for AspectLTL programs

Shahar Maoz, Yaniv Sa'ar
2012 Proceedings of the 11th annual international conference on Aspect-oriented Software Development - AOSD '12  
In this work we address these challenges in the context of AspectLTL, a temporallogic based language for the specification and implementation of crosscutting concerns, which has a composition and synthesis-based  ...  When a specification is unrealizable, we provide an interactive game proof that demonstrates conflicts that should be fixed. The techniques are implemented and demonstrated using running examples.  ...  in this case for our example of proving unrealizability).  ... 
doi:10.1145/2162049.2162055 dblp:conf/aosd/MaozS12 fatcat:xsgf7iggq5enfclyaajnomhb5q

Unrealizable Cores for Reactive Systems Specifications [article]

Shahar Maoz, Rafi Shalom
2021 arXiv   pre-print
One means to deal with unrealizability, in the context of GR(1), an expressive assume-guarantee fragment of LTL that enables efficient synthesis, is the computation of an unrealizable core, which can be  ...  One of the main challenges of reactive synthesis, an automated procedure to obtain a correct-by-construction reactive system, is to deal with unrealizable specifications.  ...  ACKNOWLEDGEMENTS We thank the anonymous reviewers for their helpful comments. We thank Roee Sinai for implementing the Quick-Xplain algorithm in the Spectra environment.  ... 
arXiv:2103.00297v1 fatcat:xndzhbypsng2lcmj6o4t2lomh4

Diagnosis and Repair for Synthesis from Signal Temporal Logic Specifications

Shromona Ghosh, Dorsa Sadigh, Pierluigi Nuzzo, Vasumathi Raman, Alexandre Donzé, Alberto L. Sangiovanni-Vincentelli, S. Shankar Sastry, Sanjit A. Seshia
2016 Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control - HSCC '16  
Given an infeasible STL synthesis problem, we present algorithms that provide feedback on the reasons for unrealizability, and suggestions for making it realizable.  ...  We build on recent approaches that reduce the controller synthesis problem to solving one or more mixed integer linear programs (MILPs), where infeasibility of an MILP usually indicates unrealizability  ...  Similar syntax tree based definitions of unsatisfiable cores for LTL were presented in [24] . In the context of synthesis from LTL, Raman et al.  ... 
doi:10.1145/2883817.2883847 dblp:conf/hybrid/GhoshSNRDSSS16 fatcat:qrrada6fsjewjlbvs6ppqb2mui

Towards a notion of unsatisfiable and unrealizable cores for LTL

Viktor Schuppan
2012 Science of Computer Programming  
We are not aware of a similar systematic investigation of the notion of a UC and of an unrealizable core for LTL.  ...  Two examples are found in verification algorithms using counterexample guided abstraction refinement (CEGAR) (e.g., [CTVW03] ) and in SMT (e.g., [WW99] ).  ...  Maler for providing the freedom to pursue this work. Finally, the author thanks the Provincia Autonoma di Trento for support (project EMTELOS).  ... 
doi:10.1016/j.scico.2010.11.004 fatcat:sk5dpnkl65f3lnutkh2ez5qgcm
« Previous Showing results 1 — 15 out of 169 results