NDLI: Optimizing synthesis with metasketches

Please wait, while we are loading the content...

Programming the world of uncertain things (keynote)

Breaking through the normalization barrier: a self-interpreter for f-omega

Temporal verification of higher-order functional programs

Query-guided maximum satisfiability

Fully-abstract compilation by approximate back-translation

Decidability of inferring inductive invariants

Dependent types and multi-monadic effects in F*

Automatic patch generation by learning correct code

Chapar: certified causally consistent distributed key-value stores

Principal type inference for GADTs

Combining static analysis with probabilistic models to enable market-scale Android inter-component analysis

SMO: an integrated approach to intra-array and inter-array storage optimization

Effects as sessions, sessions as effects

Modelling the ARMv8 architecture, operationally: concurrency and ISA

Newtonian program analysis via tensor product

Lattice-theoretic progress measures and coalgebraic model checking

Learning programs from noisy data

Synthesis of reactive controllers for hybrid systems (keynote)

Type theory in type theory using quotient inductive types

Scaling network verification using symmetry and surgery

String solving with word equations and transducers: towards a logic for analysing mutation XSS

Lightweight verification of separate compilation

The hardness of data packing

Fabular: regression formulas as probabilistic programming

Estimating types in binaries using predictive modeling

'Cause I'm strong enough: Reasoning about consistency choices in distributed systems

Abstracting gradual typing

Abstraction refinement guided by a learnt probabilistic model

PolyCheck: dynamic verification of iteration space transformations on affine programs

Monitors and blame assignment for higher-order session types

A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions

Casper: an efficient approach to call trace collection

Algorithms for algebraic path properties in concurrent systems of constant treewidth components

Optimizing synthesis with metasketches

Confluences in programming languages research (keynote)

System f-omega with equirecursive types for datatype-generic programming

Model checking for symbolic-heap separation logic with inductive predicates

Symbolic computation of differential equivalences

From MinX to MinC: semantics-driven decompilation of recursive datatypes

The complexity of interaction

Kleenex: compiling nondeterministic transducers to deterministic streaming transducers

Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs

A program logic for concurrent objects under fair scheduling

The gradualizer: a methodology and algorithm for generating gradual type systems

Learning invariants using decision trees and implication counterexamples

Printing floating-point numbers: a faster, always correct method

Environmental bisimulations for probabilistic higher-order languages

Overhauling SC atomics in C11 and OpenCL

Pushdown control-flow analysis for free

Memoryful geometry of Interaction II: recursion and adequacy

Maximal specification synthesis

A theory of effects and resources: adjunction models and polarised calculi

Reducing crash recoverability to reachability

Unboundedness and downward closures of higher-order pushdown automata

Sound type-dependent syntactic language extension

Transforming spreadsheet data types using examples

PSync: a partially synchronous language for fault-tolerant distributed algorithms

Is sound gradual typing dead?

Symbolic abstract data type inference

Taming release-acquire consistency

Binding as sets of scopes

Example-directed synthesis: a type-theoretic interpretation

Optimizing synthesis with metasketches

Content Provider	ACM Digital Library
Author	Torlak, Emina Grossman, Dan Ceze, Luis Bornholt, James
Abstract	Many advanced programming tools---for both end-users and expert developers---rely on program synthesis to automatically generate implementations from high-level specifications. These tools often need to employ tricky, custom-built synthesis algorithms because they require synthesized programs to be not only correct, but also optimal with respect to a desired cost metric, such as program size. Finding these optimal solutions efficiently requires domain-specific search strategies, but existing synthesizers hard-code the strategy, making them difficult to reuse. This paper presents metasketches, a general framework for specifying and solving optimal synthesis problems. metasketches make the search strategy a part of the problem definition by specifying a fragmentation of the search space into an ordered set of classic sketches. We provide two cooperating search algorithms to effectively solve metasketches. A global optimizing search coordinates the activities of local searches, informing them of the costs of potentially-optimal solutions as they explore different regions of the candidate space in parallel. The local searches execute an incremental form of counterexample-guided inductive synthesis to incorporate information sent from the global search. We present Synapse, an implementation of these algorithms, and show that it effectively solves optimal synthesis problems with a variety of different cost functions. In addition, metasketches can be used to accelerate classic (non-optimal) synthesis by explicitly controlling the search strategy, and we show that Synapse solves classic synthesis problems that state-of-the-art tools cannot. .
Starting Page	775
Ending Page	788
Page Count	14
File Format	PDF
ISBN	9781450335492
DOI	10.1145/2837614.2837666
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-01-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Program synthesis
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in