Segment Abstraction for Worst-Case Execution Time Analysis
Abstract elided by the publisher.
Related papers
- Path-Sensitive Abstract Interpretation for WCET Estimation PLDI 2026
- Relational cost analysis POPL 2017
- A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models CGO 2009
- Quantitative abstraction refinement POPL 2013
- Stop and go: understanding yieldpoint behavior ISMM 2015
- Training of deep learning pipelines on memory-constrained GPUs via segmented fused-tiled execution CC 2022
- Non-polynomial Worst-Case Analysis of Recursive Programs TOPLAS 2019
- Non-polynomial Worst-Case Analysis of Recursive Programs CAV 2017