Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code
No abstract available.
DOI 10.1007/978-3-642-35182-2_9
Related papers
- Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss TOPLAS 2014
- Analysing memory resource bounds for low-level programs ISMM 2008
- A fast and low-overhead technique to secure programs against integer overflows CGO 2013
- Unification-based pointer analysis with directional assignments PLDI 2000
- A concurrency-agnostic protocol for multi-paradigm concurrent debugging tools DLS 2017
- Execution vs. Parse-Based Language Servers: Tradeoffs and Opportunities for Language-Agnostic Tooling for Dynamic Languages DLS 2022
- Checking type safety of foreign function calls TOPLAS 2008
- Type-based amortized resource analysis with integers and arrays JFP 2015