Sciweavers

POPL
2016
ACM
9 years 6 months ago
Unboundedness and downward closures of higher-order pushdown automata
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means th...
Matthew Hague, Jonathan Kochems, C.-H. Luke Ong
97
Voted
POPL
2016
ACM
9 years 6 months ago
Transforming spreadsheet data types using examples
Cleaning spreadsheet data types is a common problem faced by millions of spreadsheet users. Data types such as date, time, name, and units are ubiquitous in spreadsheets, and clea...
Rishabh Singh, Sumit Gulwani
178
Voted
POPL
2016
ACM
9 years 6 months ago
Automatic patch generation by learning correct code
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
POPL
2016
ACM
9 years 6 months ago
Sound type-dependent syntactic language extension
Syntactic language extensions can introduce new facilities into a programming language while requiring little implementation effort and modest changes to the compiler. It is typi...
Florian Lorenzen, Sebastian Erdweg
76
Voted
POPL
2016
ACM
9 years 6 months ago
Model checking for symbolic-heap separation logic with inductive predicates
We investigate the model checking problem for symbolic-heap separation logic with user-defined inductive predicates, i.e., the problem of checking that a given stack-heap memory ...
James Brotherston, Nikos Gorogiannis, Max I. Kanov...
POPL
2016
ACM
9 years 6 months ago
Printing floating-point numbers: a faster, always correct method
Floating-point numbers are an essential part of modern software, recently gaining particular prominence on the web as the exclusive numeric format of Javascript. To use floating-...
Marc Andrysco, Ranjit Jhala, Sorin Lerner
POPL
2016
ACM
9 years 6 months ago
Optimizing synthesis with metasketches
Many advanced programming tools—for both end-users and expert developers—rely on program synthesis to automatically generate implementations from high-level specifications. T...
James Bornholt, Emina Torlak, Dan Grossman, Luis C...
88
Voted
POPL
2016
ACM
9 years 6 months ago
String solving with word equations and transducers: towards a logic for analysing mutation XSS
We study the fundamental issue of decidability of satisfiability over string logics with concatenations and finite-state transducers as atomic operations. Although restricting t...
Anthony Widjaja Lin, Pablo Barceló
POPL
2016
ACM
9 years 6 months ago
Fully-abstract compilation by approximate back-translation
Dominique Devriese, Marco Patrignani, Frank Piesse...