POPL 2016 - PDF Preprint Papers

POPL 2016 Annual Symposium on Principles of Programming Languages

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed POPL-2016 Paper

click to vote

POPL
2016
ACM

116views Programming Languages» more POPL 2016»

Automatic patch generation by learning correct code

2 years 11 months ago

Download people.csail.mit.edu

We present Prophet, a novel patch generation system that works with a set of successful human patches obtained from opensource software repositories to learn a probabilistic, appl...

Fan Long, Martin Rinard

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	116	Automatic patch generation by learning correct code	claim
2	85	Breaking through the normalization barrier: a self-interpreter for f-omega	claim
3	79	Fabular: regression formulas as probabilistic programming	claim
4	79	Transforming spreadsheet data types using examples	claim
5	77	Decidability of inferring inductive invariants	claim
6	74	Symbolic computation of differential equivalences	claim
7	74	Modelling the ARMv8 architecture, operationally: concurrency and ISA	claim
8	73	Combining static analysis with probabilistic models to enable market-scale Android inter-component analysis	claim
9	68	'Cause I'm strong enough: reasoning about consistency choices in distributed systems	claim
10	67	Example-directed synthesis: a type-theoretic interpretation	claim
11	67	Sound type-dependent syntactic language extension	claim
12	66	From MinX to MinC: semantics-driven decompilation of recursive datatypes	claim
13	66	Newtonian program analysis via tensor product	claim
14	66	Model checking for symbolic-heap separation logic with inductive predicates	claim
15	65	Learning programs from noisy data	claim
16	64	Binding as sets of scopes	claim
17	61	Printing floating-point numbers: a faster, always correct method	claim
18	59	A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions	claim
19	59	System f-omega with equirecursive types for datatype-generic programming	claim
20	57	Overhauling SC atomics in c11 and OpenCL	claim
21	56	Pushdown control-flow analysis for free	claim
22	55	Unboundedness and downward closures of higher-order pushdown automata	claim
23	51	Type theory in type theory using quotient inductive types	claim
24	51	Estimating types in binaries using predictive modeling	claim
25	51	A program logic for concurrent objects under fair scheduling	claim
26	51	Reducing crash recoverability to reachability	claim
27	50	Optimizing synthesis with metasketches	claim
28	49	Kleenex: compiling nondeterministic transducers to deterministic streaming transducers	claim
29	49	Dependent types and multi-monadic effects in F	claim
30	49	Fully-abstract compilation by approximate back-translation	claim
31	48	Memoryful geometry of interaction II: recursion and adequacy	claim
32	48	String solving with word equations and transducers: towards a logic for analysing mutation XSS	claim
33	47	Effects as sessions, sessions as effects	claim
34	46	PSync: a partially synchronous language for fault-tolerant distributed algorithms	claim
35	44	Is sound gradual typing dead?	claim
36	42	Taming release-acquire consistency	claim
37	41	Learning invariants using decision trees and implication counterexamples	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers