Sciweavers

72
Voted
OOPSLA
2015
Springer
9 years 11 months ago
Programming with enumerable sets of structures
We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of struc...
Ivan Kuraj, Viktor Kuncak, Daniel Jackson
68
Voted
OOPSLA
2015
Springer
9 years 11 months ago
Optimizing hash-array mapped tries for fast and lean immutable JVM collections
The data structures under-pinning collection API (e.g. lists, sets, maps) in the standard libraries of programming languages are used intensively in many applications. The standar...
Michael J. Steindorfer, Jurgen J. Vinju
74
Voted
OOPSLA
2015
Springer
9 years 11 months ago
Toward tool support for interactive synthesis
Syntax-guided synthesis searches for an implementation of a given specification by exploring large spaces of candidate programs. Sketches reduce these search spaces, making synth...
Shaon Barman, Rastislav Bodík, Satish Chand...
62
Voted
OOPSLA
2015
Springer
9 years 11 months ago
Disjointness domains for fine-grained aliasing
Aliasing is crucial for supporting useful implementation patterns, but it makes reasoning about programs difficult. To deal with this problem, numerous type-based aliasing contro...
Stephan Brandauer, Dave Clarke, Tobias Wrigstad
73
Voted
OOPSLA
2015
Springer
9 years 11 months ago
Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach
HTML5 applications normally have a large set of CSS (Cascading Style Sheets) rules for data display. Each CSS rule consists of a node selector and a declaration block (which assig...
Matthew Hague, Anthony Widjaja Lin, C.-H. Luke Ong