Students have enthusiastically taken to online programming lessons and contests.
Unfortunately, they tend to struggle due to lack of personalized feedback. There is an urgent …

We present a fast algorithm for syntax-guided synthesis of inductive invariants which
combines enumerative learning with inductive-subset extraction, leverages …

We introduce a framework allowing domain experts to manipulate computational terms in
the interest of deriving better, more efficient implementations. It employs deductive …

In this paper, we propose an automated approach to finding correct and efficient
memoization algorithms from a given declarative specification. This problem has two major …

We present AUTOGEN---an algorithm that for a wide class of dynamic programming (DP)
problems automatically discovers highly efficient cache-oblivious parallel recursive divide …

Algorithms in new application areas like machine learning and network analysis use"
irregular" data structures such as graphs, trees and sets. Writing efficient parallel code in …

Intermediate data structures are a common cause of inefficiency in functional programming.
Fusion attempts to eliminate intermediate data structures by combining adjacent data …

Online streaming algorithms, tailored for continuous data processing, offer substantial
benefits but are often more intricate to design than their offline counterparts. This paper …

Iterative wavefront algorithms for evaluating dynamic programming recurrences exploit
optimal parallelism but show poor cache performance. Tiled-iterative wavefront algorithms …

We present Autogen—an algorithm that for a wide class of dynamic programming (DP)
problems automatically discovers highly efficient cache-oblivious parallel recursive divide …