The 4 th Competition on Syntax-Guided Synthesis. Rajeev Alur, Dana Fisman, Rishabh Singh and Armando Solar-Lezama
|
|
- Sophia Hood
- 5 years ago
- Views:
Transcription
1 The 4 th Competition on Syntax-Guided Synthesis Rajeev Alur, Dana Fisman, Rishabh Singh and Armando Solar-Lezama
2 SyGuS Idea and Definition in a Nutshell
3 New Trends in Synthesis Turn off rightmost continuous 1 bits: > Specification S High Level WHAT Syntactic restrictions R on the solutions domain Synthesizer Use at most two of each of the following operators: &&, <<, Program P Low Level HOW
4 Syntax Guided Synthesis - Idea Motivation: Tractability Combine human expert insights with Specification S Synthesizer Program P Syntactic restrictions R computers exhaustiveness & rapidness Benefit progress SAT & SMT Solvers
5 Syntax-Guided Synthesis (SyGuS) Problem Fix a background theory T: fixes types and operations Function to be synthesized: name f along with its type General case: multiple functions to be synthesized f ϕ Theory T 0 t 1 + G Synthesizer Grammar Inputs to SyGuS problem: Specification ϕ Typed formula using symbols in T + symbol f Context-free grammar G Characterizing the set of allowed expressions [[ G ]] (in theory T) f 1f2 P f Computational problem: Find expression e in [[ G ]] such that ϕ[f/e] is valid (in theory T)
6 SyGuS-Comp17 The 5 th competition on Syntax Guided Synthesis
7 Solvers CVC Andrew Reynolds (Univ. of Iowa), Cesare Tinelli (Univ. of Iowa) and Clark Barrett (NYU) EUSolver Arjun Radhakrishna (MSR) and Abhishek Udupa (MSR) Euphony - Woosuk Lee (Penn), Arjun Radhakrishna (MSR) and Abhishek Udupa (MSR) DryadSynth - KangJing Huang, Xiaokang Qiu, and Yanjun Wang (all from Purdue Univ.) LoopInvGen - Saswat Padhi (UCLA) and Todd Millstein (UCLA) E3Sovler - Ammar Ben Khadra (University of Kaiserslautern)
8 Tracks General Inv CLIA PBE Strings PBE Bitvectors
9 Tracks Participation CVC4-2017: all 5 tracks EUSolver-2017: all 5 tracks Euphony: DryadSynth: LoopInvGen: E3Solver: all 5 tracks CLIA and INV tacks INV track PBE Bitvectors track
10 New Benchmarks Invariant Generation (7) by Saswat Padhi (UCLA) Program Repair (18) [FSE 2017, ISSTA 2017] by Xuan Bach D Le (SMU), David Lo (SMU) and Claire Le Goues (CMU) Crypto Circuits (214) [CAV 2016] by Chao Wang (USC) Instruction Selection (28) by Sebastian Buchwald and Andreas Fried (KIT)
11 Inv Track (74) Tight race! LoopInvGen 65/46 DryadSynth & CVC /38 65/37
12 CLIA Track (73) Winner of last year Last year 73/50 CVC /72 EUSolver /29 Outstanding improvement! Last year 37/11 Euphony 71/11
13 PBE Stings (108) CVC /49 Outstanding improvement! Last year solved 18 Euphony 78/66 EUSolver /23 Winner of last Last year solved 31 year
14 PBE Bitvectors (750) 100% solved! E3Solver 750/692 Euphony & EUSolver / /211 Winner of last Last year solved year 730
15 General Track (569) - Solved
16 General Track (569) - Fastest
17 General Track (569) EUSolver /276 CVC /236 Euphony 362/135
18 General Track Summary & Discussion EUSolver solved more benchmarks, and more benchmarks among the fastest CVC4 was second to solve more benchmarks and more benchmarks among the fastest. In term of categories o CVC4 won 6 categories: Arrays, Let & MP, HD, Integers, InvGen wbndints, InvGen wunbndints o EUSolver won 3 categories: Program Repair, ICFP, Crypto Crkts o Euphony won 2 categories: Multiple Functions, Compiler Optimizations
19 Expression Sizes Solver Sum ExprSize Max ExprSize Avrg ExprSize CVC EUSolver Euphony CVC generates quite big expressions
20 Timeline View Tracks 1 st 2 nd 3 rd 4 th Comp. Comp. Comp. Comp Tracks: General General CLIA Inv General CLIA Inv PBE Bitvectors PBE Strings General CLIA Inv PBE Bitvectors PBE Strings
21 Timeline View Solvers 1 st 2 nd 3 rd 4 th Comp. Comp. Comp. Comp Solvers: Enumerative Enumerative, Enumerative CVC Symbolic, Sketch Stochastic Alchemist SosyToast Sketch AC Stochastic Alchemist CS,CSDT (2) ICE CVC4 1.5 Sketch AC Stochastic Alchemist CS,CSDT (2) ICE CVC EUSolver EUSolver 2017 Euphony DryadSynth LoopInvGen E3Solver
22 General Track 1 st vs. 4 th Competitions 1 st 4 th
23 Timeline View Successes & Challenges 1 st 2 nd 3 rd 4 th Comp. Comp. Comp. Comp. Successes: Hackers Delight Arrays More benchs PBE-Stings Invariant Gen Max n <= 15 ICFP Crypto Crkts Faster Program Repair Expr Size Improv. Challenges: Arrays Let Let Let Max n>4 MultFunc MultFunc MultFunc Let ICFP CompOpt CompOpt MultFunc CompOpt PBE-Strings Instruction Selection
24 SyGuS-Comp17 Solvers Strategies
25 Solvers Strategies E3Solver presentation: Ammar Ben Khadra CVC42017 presentation: Andy Reynolds DryadSynth: Xiaokang Qiu LoopInvGen: on behalf of authors Euphony:... EUsolver:
Results and Analysis of SyGuS-Comp 15
Results and Analysis of SyGuS-Comp Rajeev Alur Dana Fisman University of Pennsylvania Rishabh Singh Microsoft Research Armando Solar-Lezama Massachusetts Institute of Technology Syntax-Guided Synthesis
More informationSyGuS-Comp 2016: Results and Analysis
SyGuS-Comp 6: Results and Analysis Rajeev Alur University of Pennsylvania Dana Fisman Ben-Gurion University Rishabh Singh Microsoft Research, Redmond Armando Solar-Lezama Massachusetts Institute of Technology
More informationSyntax-Guided Program Synthesis. Rajeev Alur. University of Pennsylvania
Syntax-Guided Program Synthesis Rajeev Alur University of Pennsylvania 1 Goal: Programming computers easier than communicating with people Can programming be liberated, period. David Harel, IEEE Computer,
More informationSyntax-Guided Program Synthesis. Rajeev Alur
Syntax-Guided Program Synthesis Rajeev Alur University of Pennsylvania 1 Goal: Programming computers easier than communicating with people Can programming be liberated, period. David Harel, IEEE Computer,
More informationSearch-based Program Synthesis
DOI:10.1145/3208071 A promising, useful tool for future programming development environments. BY RAJEEV ALUR, RISHABH SINGH, DANA FISMAN, AND ARMANDO SOLAR-LEZAMA Search-based Program Synthesis Writing
More informationSyntax-Guided Synthesis. Rajeev Alur. University of Pennsylvania
Syntax-Guided Synthesis Rajeev Alur University of Pennsylvania 1 Program Verification Specification S Program P Verifier Proof of correctness or Witness of a bug 2 Classical Program Synthesis Specification
More informationCOUNTEREXAMPLE-GUIDED MODEL SYNTHESIS
COUNTEREXAMPLE-GUIDED MODEL SYNTHESIS Mathias Preiner, Aina Niemetz and Armin Biere Johannes Kepler University Stanford University SMT Workshop July 22-23, 2017 Heidelberg, Germany Introduction Counterexample-Guided
More informationLEARNING TO INSTANTIATE QUANTIFIERS
LEARNING TO INSTANTIATE QUANTIFIERS Armin Biere 1 joint work with Mathias Preiner 1,2, Aina Niemetz 1,2 TACAS 17, SMT 17, PhD Thesis Mathias Preiner in 2017 1 Johannes Kepler University Linz 2 Stanford
More informationCOUNTEREXAMPLE-GUIDED MODEL SYNTHESIS
COUNTEREXAMPLE-GUIDED MODEL SYNTHESIS Mathias Preiner?y, Aina Niemetz?y and Armin Biere?? Johannes Kepler University y Stanford University SMT Workshop July 22-23, 2017 Heidelberg, Germany Introduction
More informationEECS 219C: Formal Methods Syntax-Guided Synthesis (selected/adapted slides from FMCAD 13 tutorial by R. Alur) Sanjit A. Seshia EECS, UC Berkeley
EECS 219C: Formal Methods Syntax-Guided Synthesis (selected/adapted slides from FMCAD 13 tutorial by R. Alur) Sanjit A. Seshia EECS, UC Berkeley Solving SyGuS Is SyGuS same as solving SMT formulas with
More informationarxiv: v1 [cs.pl] 22 May 2014
Language to Specify Syntax-Guided Synthesis Problems Mukund Raghothaman Abhishek Udupa Friday 7 th December, 2018 arxiv:1405.5590v1 [cs.pl] 22 May 2014 Abstract We present a language to specify syntax
More informationScaling Enumerative Program Synthesis via Divide and Conquer
Scaling Enumerative Program Synthesis via Divide and Conquer Rajeev Alur, Arjun Radhakrishna, and Abhishek Udupa University of Pennsylvania Abstract. Given a semantic constraint specified by a logical
More informationCOUNTEREXAMPLE-GUIDED MODEL SYNTHESIS
COUNTEREXAMPLE-GUIDED MODEL SYNTHESIS Mathias Preiner, Aina Niemetz and Armin Biere Institute for Formal Models and Verification (FMV) Johannes Kepler University, Linz, Austria http://fmv.jku.at/ TACAS
More informationLanguage to Specify Syntax-Guided Synthesis Problems
Language to Specify Syntax-Guided Synthesis Problems Mukund Raghothaman Abhishek Udupa Saturday 25 th January, 2014 1 Introduction We present a language to specify syntax guided synthesis (SyGuS) problems.
More informationSynthesis of Domain Specific Encoders for Bit- Vector Solvers
Synthesis of Domain Specific Encoders for Bit- Vector Solvers Jeevana Priya Inala! with Rohit Singh, Armando Solar-Lezama To appear at SAT 16 High-level constraint to CNF clauses SMT solver High-level
More informationSyntax-Guided Synthesis. Rajeev Alur. Marktoberdorf Summer School 2014
Syntax-Guided Synthesis Rajeev Alur Marktoberdorf Summer School 2014 1 Program Verification Specification S Program P Verifier Proof of correctness or Witness of a bug 2 Classical Program Synthesis Specification
More informationSynthesis through Unification
Synthesis through Unification Rajeev Alur 1, Pavol Černý2, and Arjun Radhakrishna 1 1 University of Pennsylvania 2 University of Colorado Boulder Abstract. Given a specification and a set of candidate
More informationAndrew Reynolds Liana Hadarean
425,7 3!7441$ 89028147 30,7 #0, 7 9 209.&8 3 $ Andrew Reynolds Liana Hadarean July 15, 2010 1 . 34 0/ 020398 University of Iowa Andrew Reynolds, Cesare Tinelli, Aaron Stump Liana Hadarean, Yeting Ge, Clark
More informationGenerating Small Countermodels. Andrew Reynolds Intel August 30, 2012
Generating Small Countermodels using SMT Andrew Reynolds Intel August 30, 2012 Acknowledgements Intel Corporation AmitGoel, Sava Krstic University of Iowa Cesare Tinelli, Francois Bobot New York University
More informationOptimizing Synthesis with Metasketches
Optimizing Synthesis Artifact with Metasketches * POPL * Consistent * Complete * Well Documented * Easy to Reuse * Evaluated * AEC * James Bornholt Emina Torlak Dan Grossman Luis Ceze University of Washington
More informationScaling Up DPLL(T) String Solvers Using Context-Dependent Simplification
Scaling Up DPLL(T) String s Using Context-Dependent Simplification Andrew Reynolds, Maverick Woo, Clark Barrett, David Brumley, Tianyi Liang, Cesare Tinelli CAV 2017 1 Importance of String s Automated
More informationType Assisted Synthesis of Programs with Algebraic Data Types
Type Assisted Synthesis of Programs with Algebraic Data Types Jeevana Priya Inala MIT Collaborators: Xiaokang Qiu (MIT), Ben Lerner (Brown), Armando Solar-Lezama (MIT) Example - Desugaring a simple language
More informationA Tour of CVC4. Tim King
A Tour of CVC4 Morgan Deters mdeters@cs.nyu.edu Cesare Tinelli cesare-tinelli@uiowa.edu Tim King tim.king@imag.fr Andrew Reynolds andrew.reynolds@epfl.ch Clark Barrett barrett@cs.nyu.edu ÉC O L E P O L
More informationPLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes
PLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes Jeevana Priya Inala MIT jinala@mit.edu Advisor: Armando Solar-Lezama 1. Problem and Motivation As programming languages
More informationCounterexample-Driven Genetic Programming
Counterexample-Driven Genetic Programming Iwo Błądek, Krzysztof Krawiec Institute of Computing Science, Poznań University of Technology Poznań, 12.12.2017 I. Błądek, K. Krawiec Counterexample-Driven Genetic
More informationFormally Certified Satisfiability Solving
SAT/SMT Proof Checking Verifying SAT Solver Code Future Work Computer Science, The University of Iowa, USA April 23, 2012 Seoul National University SAT/SMT Proof Checking Verifying SAT Solver Code Future
More informationLecture Notes: Program Synthesis
Lecture Notes: Program Synthesis 17-355/17-665/17-819O: Program Analysis (Spring 2018) Jonathan Aldrich and Claire Le Goues aldrich@cs.cmu.edu, clegoues@cs.cmu.edu Note: A complete, if lengthy, resource
More informationProgramming by Examples: Logical Reasoning meets Machine Learning
Programming by Examples: Logical Reasoning meets Machine Learning Sumit Gulwani Microsoft NAMPI Workshop July 2018 Joint work with many collaborators Example-based help-forum interaction 300_w30_aniSh_c1_b
More informationProgramming by Examples: PL meets ML
Programming by Examples: PL meets ML Summit on Machine Learning meets Formal Methods Sumit Gulwani Microsoft July 2018 Joint work with many collaborators Example-based help-forum interaction 300_w30_aniSh_c1_b
More informationDPLL(T ):Fast Decision Procedures
DPLL(T ):Fast Decision Procedures Harald Ganzinger George Hagen Robert Nieuwenhuis Cesare Tinelli Albert Oliveras MPI, Saarburcken The University of Iowa UPC, Barcelona Computer Aided-Verification (CAV)
More informationSynthesis of Fault-Attack Countermeasures for Cryptographic Circuits
Synthesis of Fault-Attack Countermeasures for Cryptographic Circuits Hassan Eldib, Meng Wu, and Chao Wang CAV, July 23, 2016 Cryptographic Algorithm: an example Plaintext Chip Ciphertext 0110 1001 1011
More informationUsing Program Synthesis for Program Analysis
Using Program Synthesis for Program Analysis Cristina David 1, Daniel Kroening 1, and Matt Lewis 1,2 1 University of Oxford 2 Improbable Worlds Ltd. Abstract. In this paper, we propose a unified framework
More informationSystematic Generation of Non-Equivalent Expressions for Relational Algebra
Systematic Generation of Non-Equivalent Expressions for Relational Algebra Kaiyuan Wang 1, Allison Sullivan 1, Manos Koukoutos 2, Darko Marinov 3, and Sarfraz Khurshid 1 1 University of Texas at Austin,
More informationData-Driven Precondition Inference with Learned Features
Data-Driven Precondition Inference with Learned Features Saswat Padhi Univ. of California, Los Angeles, USA padhi@cs.ucla.edu Rahul Sharma Stanford University, USA sharmar@cs.stanford.edu Todd Millstein
More informationRefutation-Based Synthesis in SMT
Noname manuscript No. (will be inserted by the editor) Refutation-Based Synthesis in SMT Andrew Reynolds Viktor Kuncak Cesare Tinelli Clark Barrett Morgan Deters Received: date / Accepted: date Abstract
More informationCVC4. 2 University of Iowa
CVC4 Clark Barrett 1, Christopher L. Conway 1, Morgan Deters 1, Liana Hadarean 1, Dejan Jovanović 1, Tim King 1, Andrew Reynolds 2, and Cesare Tinelli 2 1 New York University 2 University of Iowa Abstract.
More informationSynthesis for Automated Grading and Feedback EXCAPE NSF SITE VISIT AUGUST 2013
Synthesis for Automated Grading and Feedback EXCAPE NSF SITE VISIT AUGUST 2013 Sumit Gulwani Solar-Lezama Alur Seshia Hartmann Leverage Synthesis in Education Technology Computer aided approach to introduce
More informationAutograder RISHABH SINGH, SUMIT GULWANI, ARMANDO SOLAR-LEZAMA
Autograder RISHABH SINGH, SUMIT GULWANI, ARMANDO SOLAR-LEZAMA Test-cases based feedback Hard to relate failing inputs to errors Manual feedback by TAs Time consuming and error prone Feedback on Programming
More informationIntroduction to Sketching
Introduction to Sketching IAP 2008 Armando Solar-Lezama What is sketching? A program synthesis system - generates small fragments of code - checks their validity against a specification A programming aid
More informationEvaluating the SMT-LIB repository as a benchmark source for software verification
Erasusmus Mundus Summer School 30th June 2015 Evaluating the SMT-LIB repository as a benchmark source for software verification Andrew Healy, MSc Computer Science (by Research) Maynooth University, Ireland
More informationRefutation-based synthesis in SMT
DOI 10.1007/s10703-017-0270-2 Refutation-based synthesis in SMT Andrew Reynolds 1,2 Viktor Kuncak 1 Cesare Tinelli 2 Clark Barrett 3 Morgan Deters 4 Springer Science+Business Media New York 2017 Abstract
More informationASP modulo CSP: The clingcon system
1/22 ASP modulo CSP: The clingcon system Max Ostrowski and Torsten Schaub University of Potsdam 2/22 Outline 1 The clingcon System 2 Learning 3 Benchmarks 3/22 ASPmCSP solver The clingcon System ASP Answer
More informationDependently Typed Programming with Mutable State
Dependently Typed Programming with Mutable State Aaron Stump 1 Evan Austin 2 1 Computer Science The University of Iowa 2 Computer Science The University of Kansas U.S. National Science Foundation CAREER
More informationSMT-LIB for HOL. Daniel Kroening Philipp Rümmer Georg Weissenbacher Oxford University Computing Laboratory. ITP Workshop MSR Cambridge 25 August 2009
1 / 13 SMT-LIB for HOL Daniel Kroening Philipp Rümmer Georg Weissenbacher Oxford University Computing Laboratory ITP Workshop MSR Cambridge 25 August 2009 2 / 13 The SMT-LIB Standard SMT Satisfiability
More informationSymbolic Execu.on for Python Progress & Challenges. Maverick Woo
Symbolic Execu.on for Python Progress & Challenges Maverick Woo pooh@cmu.edu 2017-09-26 My Collaborators CMU Peter Chapman; now at Duolingo David Brumley University of Iowa Andrew Reynolds Tianyi Liang;
More informationSMT-Based Bounded Model Checking for Embedded ANSI-C Software. Lucas Cordeiro, Bernd Fischer, Joao Marques-Silva
SMT-Based Bounded Model Checking for Embedded ANSI-C Software Lucas Cordeiro, Bernd Fischer, Joao Marques-Silva b.fischer@ecs.soton.ac.uk Bounded Model Checking (BMC) Basic Idea: check negation of given
More informationProgramming by Examples: Applications, Algorithms, and Ambiguity Resolution
Programming by Examples: Applications, Algorithms, and Ambiguity Resolution Sumit Gulwani Microsoft Corporation, Redmond, WA, USA sumitg@microsoft.com Abstract. 99% of computer end users do not know programming,
More informationSMTCoq: A plug-in for integrating SMT solvers into Coq
SMTCoq: A plug-in for integrating SMT solvers into Coq Burak Ekici 1, Alain Mebsout 1, Cesare Tinelli 1, Chantal Keller 2, Guy Katz 3, Andrew Reynolds 1, and Clark Barrett 3 1 The University of Iowa, USA
More informationExCAPE. Expeditions in Computer Augmented Program Engineering
ExCAPE Expeditions in Computer Augmented Program Engineering Rajeev Alur, Ras Bodik, Jeff Foster, Bjorn Hartmann, Lydia Kavraki, Hadas Kress-Gazit, Stephane Lafortune, Boon Loo, P. Madhusudan, Milo Martin,
More informationGrowing Solver-Aided Languages with ROSETTE
Growing Solver-Aided Languages with ROSETTE Emina Torlak & Rastislav Bodik U.C. Berkeley ExCAPE June 10, 2013 solver-aided domain-specific language Solver-aided DSL (SDSL) Noun 1. A high-level language
More informationSciduction: Combining Induction, Deduction and Structure for Verification and Synthesis
Sciduction: Combining Induction, Deduction and Structure for Verification and Synthesis (abridged version of DAC slides) Sanjit A. Seshia Associate Professor EECS Department UC Berkeley Design Automation
More informationConnecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln CSE Technical reports Computer Science and Engineering, Department of 10-19-2016 Connecting Program Synthesis and Reachability:
More informationFinding heap-bounds for hardware synthesis
Finding heap-bounds for hardware synthesis B. Cook + A. Gupta # S. Magill* A. Rybalchenko # J. Simsa* S. Singh + V. Vafeiadis + *CMU # MPI-SWS + MSR Coding hardware in advanced languages Use of advanced
More informationOverview of the KeY System
22c181: Formal Methods in Software Engineering The University of Iowa Spring 2008 Overview of the KeY System Copyright 2007-8 Reiner Hähnle and Cesare Tinelli. Notes originally developed by Reiner Hähnle
More informationPKIND: A parallel k-induction based model checker
PKIND: A parallel k-induction based model checker Temesghen Kahsai The University of Iowa temesghen-kahsaiazene@uiowa.edu Cesare Tinelli The University of Iowa cesare-tinelli@uiowa.edu PKIND is a novel
More informationData-Driven Precondition Inference with Learned Features
Data-Driven Precondition Inference with Learned Features Saswat Padhi Univ. of California, Los Angeles, USA padhi@cs.ucla.edu Rahul Sharma Stanford University, USA sharmar@cs.stanford.edu Todd Millstein
More informationExCAPE Kick off Meeting. Leads: Stéphane Lafortune and Steve Zdancewic
Education and Outreach ExCAPE Kick off Meeting Monday June 4, 4:30 5:30pm Leads: Stéphane Lafortune and Steve Zdancewic Education and Outreach 2013 Summer School Programs for High SchoolStudents Students
More informationFrom OCL to Propositional and First-order Logic: Part I
22c181: Formal Methods in Software Engineering The University of Iowa Spring 2008 From OCL to Propositional and First-order Logic: Part I Copyright 2007-8 Reiner Hähnle and Cesare Tinelli. Notes originally
More information11th International Satisfiability Modulo Theories Competition (SMT-COMP 2016): Rules and Procedures
11th International Satisfiability Modulo Theories Competition (SMT-COMP 2016): Rules and Procedures Sylvain Conchon Paris-Sud University France Sylvain.Conchon@lri.fr Matthias Heizmann University of Freiburg
More information12th International Satisfiability Modulo Theories Competition (SMT-COMP 2017): Rules and Procedures
12th International Satisfiability Modulo Theories Competition (SMT-COMP 2017): Rules and Procedures Matthias Heizmann University of Freiburg Germany heizmann@informatik.uni-freiburg.de Tjark Weber Uppsala
More informationType- & Example-Driven Program Synthesis. Steve Zdancewic WG 2.8, August 2014
Type- & Example-Driven Program Synthesis Steve Zdancewic WG 2.8, August 2014 Joint work with Peter-Michael Osera CAVEATS Work in progress Similar work been done before This is our attempt to understand
More informationTurbo-Charging Lemmas on Demand with Don t Care Reasoning
Turbo-Charging Lemmas on Demand with Don t Care Reasoning Aina Niemetz, Mathias Preiner and Armin Biere Institute for Formal Models and Verification (FMV) Johannes Kepler University, Linz, Austria http://fmv.jku.at/
More informationScalable Synthesis with Symbolic Syntax Graphs
Scalable Synthesis with Symbolic Syntax Graphs Rohin Shah, Sumith Kulal, Ras Bodik UC Berkeley, IIT Bombay and UW 18 July 2018, Oxford UK [Solar-Lezama et al. ASPLOS06] Combinatorial Sketching for Finite
More informationProgram Synthesis for Forth Forth Day 2012
Program Synthesis for Forth Forth Day 2012 Computer Science UC Berkeley Ras Bodik Mangpo Phitchaya Phothilimthana Tikhon Jelvis Rohin Shah Synthesis with sketches Extend your language with two constructs
More informationSMT Solvers for Verification and Synthesis. Andrew Reynolds VTSA Summer School August 1 and 3, 2017
SMT Solvers for Verification and Synthesis Andrew Reynolds VTSA Summer School August 1 and 3, 2017 Acknowledgements Thanks to past and present members of development team of CVC4: Cesare Tinelli, Clark
More informationPrograms that write themselves: Program synthesis for the masses. Yu Feng UT Austin
Programs that write themselves: Program synthesis for the masses Yu Feng UT Austin New platforms impose demand for programming 2 New platforms impose demand for programming 2 New platforms impose demand
More informationSmall Formulas for Large Programs: On-line Constraint Simplification In Scalable Static Analysis
Small Formulas for Large Programs: On-line Constraint Simplification In Scalable Static Analysis Isil Dillig, Thomas Dillig, Alex Aiken Stanford University Scalability and Formula Size Many program analysis
More informationDecision Procedures in the Theory of Bit-Vectors
Decision Procedures in the Theory of Bit-Vectors Sukanya Basu Guided by: Prof. Supratik Chakraborty Department of Computer Science and Engineering, Indian Institute of Technology, Bombay May 1, 2010 Sukanya
More informationThe SMT-LIB Standard Version 2.0
The SMT-LIB Standard Version 2.0 Clark Barrett 1 Aaron Stump 2 Cesare Tinelli 2 1 New York University, barrett@cs.nyu.edu 2 University of Iowa, astump tinelli@cs.uiowa.edu Abstract The SMT-LIB initiative
More informationMachine Programming. Justin Gottschlich, Intel Labs. December 12 th, TVM Conference, University of Washington
Machine Programming Justin Gottschlich, Intel Labs December 12 th, 2018 TVM Conference, University of Washington Motivation We have a software programmer resource problem 2 Motivation We have a software
More informationBlock-wise abstract interpretation by combining abstract domains with SMT
Block-wise abstract interpretation by combining abstract domains with SMT Jiahong Jiang, Liqian Chen, Xueguang Wu, Ji Wang National University of Defense Technology, China 01/16/2017 VMCAI 2017 Overview
More informationConnecting Program Synthesis and Reachability:
Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation ThanhVu Nguyen 1,WestleyWeimer 2, Deepak Kapur 3, and Stephanie Forrest 3 1 University of Nebraska, Lincoln
More informationJPF SE: A Symbolic Execution Extension to Java PathFinder
JPF SE: A Symbolic Execution Extension to Java PathFinder Saswat Anand 1,CorinaS.Păsăreanu 2, and Willem Visser 2 1 College of Computing, Georgia Institute of Technology saswat@cc.gatech.edu 2 QSS and
More informationDeductive Methods, Bounded Model Checking
Deductive Methods, Bounded Model Checking http://d3s.mff.cuni.cz Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Deductive methods Pavel Parízek Deductive Methods, Bounded
More informationCuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers Isil Dillig, Thomas Dillig, and Alex Aiken Computer Science Department Stanford University Linear Arithmetic
More informationThe Sketching Approach to Program Synthesis
The Sketching Approach to Program Synthesis Armando Solar-Lezama Massachusetts Institute of Technology Abstract. Sketching is a new form of localized software synthesis that aims to bridge the gap between
More informationMotivation. CS389L: Automated Logical Reasoning. Lecture 17: SMT Solvers and the DPPL(T ) Framework. SMT solvers. The Basic Idea.
Motivation Lecture 17: SMT rs and the DPPL(T ) Framework şıl Dillig n previous lectures, we looked at decision procedures for conjunctive formulas in various first-order theories This lecture: How to handle
More informationThe University of Iowa. 22c181: Formal Methods in Software Engineering. Spring Course Overview
The University of Iowa 22c181: Formal Methods in Software Engineering Spring 2011 Course Overview Copyright 2010-11 Cesare Tinelli. These notes are copyrighted materials and may not be used in other course
More informationReading part: Design-Space Exploration with Alloy
Reading part: Design-Space Exploration with Alloy Ing. Ken Vanherpen Abstract In the growing world of MDE many tools are offered to describe a (part of a) system, constrain it, and check some properties
More informationModular Synthesis of Sketches Using Models
Modular Synthesis of Sketches Using Models Rohit Singh, Rishabh Singh, Zhilei Xu, Rebecca Krosnick and Armando Solar-Lezama March 10-11, 2014 Berkeley, CA, USA Rohit Singh., Rishabh Singh, Zhilei Xu, Armando
More informationAnalyzing Robustness of UML State Machines
Analyzing Robustness of UML State Machines Reinhard von Hanxleden Department of Computer Science and Applied Mathematics Real-Time Systems and Embedded Systems Group Christian-Albrecht Universität zu Kiel
More informationNetworked Systems. Boon Thau Loo. University of Pennsylvania. NSF ExCAPE Meeting 20 Aug 2013
Networked Systems Boon Thau Loo University of Pennsylvania NSF ExCAPE Meeting 20 Aug 2013 Outline Summary (activities over past year) Research highlights Conclusion Year 1 in Retrospect Original proposal
More informationPySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms
1/14 PySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms Marco Gario and Andrea Micheli gario@fbk.eu Fondazione Bruno Kessler (FBK) University of Trento 2015-05-04 Interaction
More informationModel Checking and Its Applications
Model Checking and Its Applications Orna Grumberg Technion, Israel Verification and Deduction Mentoring Workshop July 13, 2018 1 Personal data Ph.d. in (non-automated) verification Postdoc in Model Checking
More informationProgram Synthesis for Forth Forth Day 2012
Program Synthesis for Forth Forth Day 2012 Computer Science UC Berkeley Ras Bodik Mangpo Phitchaya Phothilimthana Tikhon Jelvis Rohin Shah Synthesis with sketches Extend your language with two constructs
More information22c:111 Programming Language Concepts. Fall Syntax III
22c:111 Programming Language Concepts Fall 2008 Syntax III Copyright 2007-08, The McGraw-Hill Company and Cesare Tinelli. These notes were originally developed by Allen Tucker, Robert Noonan and modified
More informationTemplate-based Circuit Understanding
Template-based Circuit Understanding Adrià Gascón 1 Pramod Subramanyan 2 Bruno Dutertre 1 Ashish Tiwari 1 Dejan Jovanović 1 Sharad Malik 2 1 SRI International 2 Princeton University Motivation Verify/reverse-engineer
More informationA Decision Procedure for (Co)datatypes in SMT Solvers. Andrew Reynolds Jasmin Christian Blanchette IJCAI sister conference track, July 12, 2016
A Decision Procedure for (Co)datatypes in SMT Solvers Andrew Reynolds Jasmin Christian Blanchette IJCAI sister conference track, July 12, 2016 Satisfiability Modulo Theories (SMT) Solvers Software Verification
More informationSynthesizing Data- Structure Manipula5ons with Natural Proofs
Synthesizing Data- Structure Manipula5ons with Natural Proofs Xiaokang Qiu (Joint work with Armando Solar- Lezama) Program Synthesis Building Reliable SoHware Program Verification Constraint Solving (Verifica5on
More informationddsmt: A Delta Debugger for the SMT-LIB v2 Format
ddsmt: A Delta Debugger for the SMT-LIB v2 Format Aina Niemetz and Armin Biere Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria http://fmv.jku.at/ Abstract Delta debugging
More informationDesign and Results of the 3rd Annual Satisfiability Modulo Theories Competition (SMT-COMP 2007)
International Journal on Artificial Intelligence Tools c World Scientific Publishing Company Design and Results of the 3rd Annual Satisfiability Modulo Theories Competition (SMT-COMP 2007) Clark Barrett
More informationProgramming with Constraint Solvers CS294: Program Synthesis for Everyone
Programming with Constraint Solvers CS294: Program Synthesis for Everyone Ras Bodik Emina Torlak Division of Computer Science University of California, Berkeley Today Today: we describe four programming
More informationGNATprove a Spark2014 verifying compiler Florian Schanda, Altran UK
1 GNATprove a Spark2014 verifying compiler Florian Schanda, Altran UK Tool architecture User view Source gnatprove Verdict 2 Tool architecture More detailed view... Source Encoding CVC4 gnat2why gnatwhy3
More informationversat: A Verified Modern SAT Solver
Computer Science, The University of Iowa, USA Satisfiability Problem (SAT) Is there a model for the given propositional formula? Model: assignments to the variables that makes the formula true. SAT if
More informationAutomata-based Model Counting for String Constraints. Abdulbaki Aydin, Lucas Bang, Tevfik Bultan
Automata-based Model Counting for String Constraints Abdulbaki Aydin, Lucas Bang, Tevfik Bultan https://vlab.cs.ucsb.edu Model Counting for String Constraints Automata-Based model Counter (ABC) 2 Can you
More informationThe Barcelogic SMT Solver
The Barcelogic SMT Solver Tool Paper Miquel Bofill 1, Robert Nieuwenhuis 2, Albert Oliveras 2, Enric Rodríguez-Carbonell 2, and Albert Rubio 2 1 Universitat de Girona 2 Technical University of Catalonia,
More informationWhat is a compiler? Xiaokang Qiu Purdue University. August 21, 2017 ECE 573
What is a compiler? Xiaokang Qiu Purdue University ECE 573 August 21, 2017 What is a compiler? What is a compiler? Traditionally: Program that analyzes and translates from a high level language (e.g.,
More informationQlose: Program Repair with Quantitative Objectives
Qlose: Program Repair with Quantitative Objectives Loris D Antoni 1, Roopsha Samanta 2, and Rishabh Singh 3 1 University of Wisconsin-Madison loris@cs.wisc.edu 2 IST Austria roopsha.samanta@ist.ac.at 3
More informationImproving Local Search for Bit-Vector Logics in SMT with Path Propagation
Improving Local Search for Bit-Vector Logics in SMT with Path Propagation Aina Niemetz, Mathias Preiner, Andreas Fröhlich and Armin Biere Institute for Formal Models and Verification (FMV) Johannes Kepler
More informationNEURO-SYMBOLIC PROGRAM SYNTHESIS
NEURO-SYMBOLIC PROGRAM SYNTHESIS Emilio Parisotto 1,2, Abdel-rahman Mohamed 1, Rishabh Singh 1, Lihong Li 1, Dengyong Zhou 1, Pushmeet Kohli 1 1 Microsoft Research, USA 2 Carnegie Mellon University, USA
More information