Sciweavers

POPL
2007
ACM
14 years 8 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
POPL
2007
ACM
14 years 8 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
POPL
2007
ACM
14 years 8 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
POPL
2007
ACM
14 years 8 months ago
Specialization of CML message-passing primitives
Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous ope...
John H. Reppy, Yingqi Xiao
POPL
2007
ACM
14 years 8 months ago
Manticore: a heterogeneous parallel language
The Manticore project is an effort to design and implement a new functional language for parallel programming. Unlike many earlier parallel languages, Manticore is a heterogeneous...
Matthew Fluet, Mike Rainey, John H. Reppy, Adam Sh...
POPL
2007
ACM
14 years 8 months ago
Data parallel Haskell: a status report
We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original p...
Manuel M. T. Chakravarty, Roman Leshchinskiy, Simo...
POPL
2007
ACM
14 years 8 months ago
SAC: off-the-shelf support for data-parallelism on multicores
The advent of multicore processors has raised new demand for harnessing concurrency in the software mass market. We summarise our previous work on the data parallel, functional ar...
Clemens Grelck, Sven-Bodo Scholz
POPL
2007
ACM
14 years 8 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
POPL
2007
ACM
14 years 8 months ago
A proposal for parallel self-adjusting computation
We present an overview of our ongoing work on parallelizing self-adjusting-computation techniques. In self-adjusting computation, programs can respond to changes to their data (e....
Matthew Hammer, Umut A. Acar, Mohan Rajagopalan, A...
POPL
2007
ACM
14 years 8 months ago
Implementing deterministic declarative concurrency using sieves
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a s...
Sam Lindley