Filters








22 Hits in 2.2 sec

SyGuS-Comp 2018: Results and Analysis [article]

Rajeev Alur and Dana Fisman and Saswat Padhi and Rishabh Singh and Abhishek Udupa
2019 arXiv   pre-print
In the 5th SyGuS-Comp, five solvers competed on over 1600 benchmarks across various tracks. This paper presents and analyses the results of this year's (2018) SyGuS competition.  ...  The Syntax-Guided Synthesis competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platform for evaluating  ...  We assume that most readers of this report would already be familiar with the SyGuS problem and the SyGuS-Comp tracks, and thus refer unfamiliar readers to the report on last year's competition [2] .  ... 
arXiv:1904.07146v1 fatcat:y4pfmmxarffktbnln4pbmptxia

LoopInvGen: A Loop Invariant Generator based on Precondition Inference [article]

Saswat Padhi and Rahul Sharma and Todd Millstein
2019 arXiv   pre-print
This not only enables a less onerous and more expressive approach, but also appears to be significantly faster than the existing tools over the SyGuS-COMP 2018 benchmarks from the INV track.  ...  Instead, we start with no initial features, and use program synthesis techniques to grow the set on demand.  ...  ACKNOWLEDGMENT We thank the organizers of SyGuS-Comp for making all the solvers and benchmarks publicly available.  ... 
arXiv:1707.02029v4 fatcat:mywfv2j3x5c7vdkxpvq67cjx5e

Program Synthesis for Program Analysis

Cristina David, Pascal Kesseli, Daniel Kroening, Matt Lewis
2018 ACM Transactions on Programming Languages and Systems  
Our experimental results show that our program synthesiser compares positively with specialised tools in each area as well as with general-purpose synthesisers. analysis problems.  ...  and non-termination proving, refactoring).  ...  We ran the resulting prover on 50 programs from the loop-acceleration and loops directories in SV-COMP 2016 [78] .  ... 
doi:10.1145/3174802 fatcat:iop4bqbtardarc7kuxxud6sudq

Machine Learning and Formal Method (Dagstuhl Seminar 17351)

Sanjit A. Seshia, Zhu, Xianjin (Jerry), Andreas Krause, Susmit Jha, Marc Herbstritt
2018 Dagstuhl Reports  
and control theory).  ...  This report documents the program and the outcomes of Dagstuhl Seminar 17351 "Machine Learning and Formal Methods".  ...  Some open problems and potential connections to Formal Methods are discussed.  ... 
doi:10.4230/dagrep.7.8.55 dblp:journals/dagstuhl-reports/SeshiaZKJ17 fatcat:pw2cuxb3e5eephkw4khs3fnkae

Overfitting in Synthesis: Theory and Practice [chapter]

Saswat Padhi, Todd Millstein, Aditya Nori, Rahul Sharma
2019 Lecture Notes in Computer Science  
We also propose a novel single-threaded technique called hybrid enumeration that interleaves different grammars and outperforms the winner of the 2018 SyGuS competition (Inv track), solving more problems  ...  We formally define this phenomenon and prove no-free-lunch theorems for SyGuS, which reveal a fundamental tradeoff between synthesizer performance and grammar expressiveness.  ...  We thank Guy Van den Broeck and the anonymous reviewers for helpful feedback for improving this work, and the organizers of the SyGuS competition for making the tools and benchmarks publicly available.  ... 
doi:10.1007/978-3-030-25540-4_17 fatcat:vx462tsefraydnwm7c2tkti24i

On Scaling Data-Driven Loop Invariant Inference [article]

Sahil Bhatia, Saswat Padhi, Nagarajan Natarajan, Rahul Sharma, Prateek Jain
2020 arXiv   pre-print
In this paper, we study these scalability issues and address them in our tool oasis that improves the scale of data-driven invariant inference and outperforms state-of-the-art systems on benchmarks from  ...  Out of these 403 instances, 276 were published by Si et al. [2018] and 127 were part of the SyGuS-Comp'18.  ...  CVC4 and LoopInvGen are respectively the winners of the invariant-synthesis (Inv) track of SyGuS-Comp'19 [syg 5 14] and SyGuS-Comp'18 [Alur et al. 2019] .  ... 
arXiv:1911.11728v2 fatcat:qtqbwjoln5f6fnetgf7u5gp24i

Overfitting in Synthesis: Theory and Practice (Extended Version) [article]

Saswat Padhi, Todd Millstein, Aditya Nori, Rahul Sharma
2019 arXiv   pre-print
We also propose a novel single-threaded technique called hybrid enumeration that interleaves different grammars and outperforms the winner of the 2018 SyGuS competition (Inv track), solving more problems  ...  We formally define this phenomenon and prove no-free-lunch theorems for SyGuS, which reveal a fundamental tradeoff between synthesizer performance and grammar expressiveness.  ...  We thank Guy Van den Broeck and the anonymous reviewers for helpful feedback for improving this work, and the organizers of the SyGuS competition for making the tools and benchmarks publicly available.  ... 
arXiv:1905.07457v3 fatcat:yx5vqaecubdf5oceg5ftxmj47u

TOOLympics 2019: An Overview of Competitions in Formal Methods [chapter]

Ezio Bartocci, Dirk Beyer, Paul E. Black, Grigory Fedyukovich, Hubert Garavel, Arnd Hartmanns, Marieke Huisman, Fabrice Kordon, Julian Nagele, Mihaela Sighireanu, Bernhard Steffen, Martin Suda (+3 others)
2019 Msphere  
Scientific results have to be reproducible, and powerful computers are becoming cheaper and cheaper, thus, these competitions are becoming an important means for advancing research in verification technology  ...  TOOLympics 2019 is an event to celebrate the achievements of the various competitions, and to understand their commonalities and differences.  ...  ., ARCH-COMP [1] , ICLP Comp, MaxSAT Evaluation, Reactive Synthesis Competition [57] , QBFGallery [73] , and SyGuS-Competition.  ... 
doi:10.1007/978-3-030-17502-3_1 fatcat:ry2mnbgxijbw7c2flufmx25wpq

The three pillars of machine programming

Justin Gottschlich, Armando Solar-Lezama, Nesime Tatbul, Michael Carbin, Martin Rinard, Regina Barzilay, Saman Amarasinghe, Joshua B. Tenenbaum, Tim Mattson
2018 Proceedings of the 2nd ACM SIGPLAN International Workshop on Machine Learning and Programming Languages - MAPL 2018  
These techniques have made tremendous progress in recent years; for example, in the domain of bit-level manipulation, the most recent winner of the Syntax Guided Synthesis competition (SyGuS Comp) was  ...  However, complete codebases may not always be available, and running whole program analysis may not always be feasible.  ... 
doi:10.1145/3211346.3211355 dblp:conf/pldi/GottschlichSTCR18 fatcat:jfoym7vygbarll7wdwude3crry

The Three Pillars of Machine Programming [article]

Justin Gottschlich, Armando Solar-Lezama, Nesime Tatbul, Michael Carbin, Martin Rinard, Regina Barzilay, Saman Amarasinghe, Joshua B Tenenbaum, Tim Mattson
2021 arXiv   pre-print
Those pillars are: (i) intention, (ii) invention, and(iii) adaptation. Intention emphasizes advancements in the human-to-computer and computer-to-machine-learning interfaces.  ...  Invention emphasizes the creation or refinement of algorithms or core hardware and software building blocks through machine learning (ML).  ...  These techniques have made tremendous progress in recent years; for example, in the domain of bit-level manipulation, the most recent winner of the Syntax Guided Synthesis competition (SyGuS Comp) was  ... 
arXiv:1803.07244v3 fatcat:omlg3emt3fd7ricvr25erjei4i

Program Verification via Predicate Constraint Satisfiability Modulo Theories [article]

Hiroshi Unno and Yuki Satake and Tachio Terauchi and Eric Koskinen
2020 arXiv   pre-print
We have implemented the proposed framework and obtained promising results on diverse verification problems that are beyond the scope of the previous verification frameworks based on CHCs.  ...  It extends CLP with arbitrarily nested inductive and co-inductive predicates and is equi-expressive as first-order fixpoint logic.  ...  We compare PCSat with the state-of-the-art SyGuS (syntax-guided synthesis) solver LoopIn-vGen [Padhi et al. 2019] which is the winner of the Inv Track of SyGuS-Comp 2018.  ... 
arXiv:2007.03656v1 fatcat:lxrru6gt7rgknnc35mrv5iqzda

Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints [article]

Adithya Murali, Lucas Peña, Eion Blanchard, Christof Löding, P. Madhusudan
2022 arXiv   pre-print
Recursively defined linked data structures embedded in a pointer-based heap and their properties are naturally expressed in pure first-order logic with least fixpoint definitions (FO+lfp) with background  ...  We implement our procedures and evaluate them extensively over theorems involving heap data structures that require inductive proofs, demonstrating the effectiveness of our methodology.  ...  Completeness results in [Löding et al. 2018 ] directly contribute to our completeness results in this paper, and the techniques outlined in [Löding et al. 2018 ] are directly implemented in our tool.  ... 
arXiv:2009.10207v3 fatcat:hn6nmx3ttzhldmzkm67rj2vwrq

Automated Lemma Synthesis in Symbolic-Heap Separation Logic [article]

Quang-Trung Ta, Ton Chanh Le, Siau-Cheng Khoo, Wei-Ngan Chin
2017 arXiv   pre-print
The experimental results show that our lemma-synthesis-assisted prover can prove many entailments that could not be handled by existing techniques.  ...  Mathematical induction and template-based constraint solving are two pillars of our framework.  ...  Publication date: January 2018.  ... 
arXiv:1710.09635v3 fatcat:dvehjb3w7ravbmd2izfryrtyle

Occam Learning Meets Synthesis Through Unification [article]

Ruyi Ji, Jingtao Xia, Yingfei Xiong, Zhenjiang Hu
2021 arXiv   pre-print
We evaluate PolyGen on the domains of CLIA and demonstrate that PolyGen significantly outperforms two state-of-the-art PBE solvers on CLIA, Eusolver and Euphony, on both generalizability and efficiency  ...  In this paper, we adopt a concept from the computational learning theory, Occam learning, and perform a comprehensive study on the framework of synthesis through unification (STUN), a state-of-the-art  ...  For example, the combinator for mss deals with 3 cases, corresponds to if-terms mss( 1 ), mss( 2 ) and mts( 1 ) + mps( 2 ) respectively. 2 There is also a CLIA track in SyGuS-Comp.  ... 
arXiv:2105.14467v1 fatcat:erdtvmn7jzanrpqbsadekfcra4

Dagstuhl Reports, Volume 7, Issue 8, August 2017, Complete Issue [article]

2018
The unique scientific atmosphere and the historic building provided not only all the room we needed for our program and the working groups, but also plenty of opportunities for continued discussions and  ...  We further thank Tamara Mchedlidze for helping us collecting the contributions and preparing this report.  ...  efforts over the past three years on defining the standardized interchange format built on top of SMT-LIB, repository of benchmarks from diverse applications, organization of the annual competition, SyGuS-COMP  ... 
doi:10.4230/dagrep.7.8 fatcat:gksmijgk5ff6reblxsqnt33aze
« Previous Showing results 1 — 15 out of 22 results