CC 2018
20 papers
- A polyhedral compilation framework for loops with dynamic data-dependent bounds
- A session type provider: compile-time API generation of distributed protocols with refinements in F#
- An efficient data structure for must-alias analysis
- CAnDL: a domain specific language for compiler analysis
- Compiler and language design for quantum computing (keynote)
- Compiling for concise code and efficient I/O
- Computing partially path-sensitive MFP solutions in data flow analyses
- Efficient dynamic analysis for Node.js
- Fast and flexible instruction selection with constraints
- Finding missed compiler optimizations by differential testing
- Generalized profile-guided iterator recognition
- Modeling the conflicting demands of parallelism and Temporal/Spatial locality in affine scheduling
- PAYJIT: space-optimal JIT compilation and its practical implementation
- Parallel sparse flow-sensitive points-to analysis
- Polyhedral expression propagation
- Rethinking compilers in the rise of machine learning and AI (keynote)
- Semantic reasoning about the sea of nodes
- Tail call elimination and data representation for functional languages on the Java virtual machine
- Termination checking and task decomposition for task-based intermittent programs
- Towards a compiler analysis for parallel algorithmic skeletons