Dead code elimination based pointer analysis for multithreaded programs
From MaRDI portal
Publication:1939745
DOI10.1016/j.joems.2011.12.011zbMath1259.68024arXiv1212.5089OpenAlexW2038144554MaRDI QIDQ1939745
Publication date: 5 March 2013
Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.5089
flow-sensitive pointer analysis of multithreaded programsmultitheaded programs with pointer constructs
Cites Work
- Unnamed Item
- Unnamed Item
- Type systems equivalent to data-flow analyses for imperative languages
- Program and proof optimizations with type systems
- From flow logic to static type systems for coordination languages
- Simple relational correctness proofs for static analyses and program transformations
- Semi-sparse flow-sensitive pointer analysis
- Programming Languages and Systems
- An axiomatic basis for computer programming
This page was built for publication: Dead code elimination based pointer analysis for multithreaded programs