A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
Abstract elided by the publisher.
Related papers
- A Fresh Look at Optimizing Array Bound Checking PLDI 1990
- Probabilistic Resource-Aware Session Types POPL 2023
- Resilient Capacity-Aware Routing TACAS 2021
- HLIO: mixing static and dynamic typing for information-flow control in Haskell ICFP 2015
- WCET-aware static locking of instruction caches CGO 2012
- Run-time Complexity Bounds Using Squeezers ESOP 2021
- Runtime Complexity Bounds Using Squeezers TOPLAS 2022
- Bounded Sort Polymorphism with Elimination Constraints POPL 2026