Uniqueness and Completeness Analysis of Array Comprehensions
No abstract available.
Related papers
- A Comprehensive Approach to Array Bounds Check Elimination for Java CC 2002
- Interprocedural parallelization analysis in SUIF TOPLAS 2005
- Compilation of Haskell Array Comprehensions for Scientific Computing PLDI 1990
- Load-Reuse Analysis: Design and Evaluation PLDI 1999
- Symbolic heap abstraction with demand-driven axiomatization of memory invariants OOPSLA 2010
- Automatic Alignment of Array Data and Processes to Reduce Communication Time on DMPPs PPoPP 1995
- A completely unique account of enumeration ICFP 2022
- On minimizing materializations of array-valued temporaries TOPLAS 2006