Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (t...
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...