Dead code elimination based pointer analysis for multithreaded programs

DOI10.1016/J.JOEMS.2011.12.011zbMATH Open1259.68024arXiv1212.5089OpenAlexW2038144554MaRDI QIDQ1939745FDOQ1939745

Authors: Mohamed A. El-Zawawy 

Publication date: 5 March 2013

Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Abstract: This paper presents a new approach for optimizing multitheaded programs with pointer constructs. The approach has applications in the area of certified code (proof-carrying code) where a justification or a proof for the correctness of each optimization is required. The optimization meant here is that of dead code elimination. Towards optimizing multithreaded programs the paper presents a new operational semantics for parallel constructs like join-fork constructs, parallel loops, and conditionally spawned threads. The paper also presents a novel type system for flow-sensitive pointer analysis of multithreaded programs. This type system is extended to obtain a new type system for live-variables analysis of multithreaded programs. The live-variables type system is extended to build the third novel type system, proposed in this paper, which carries the optimization of dead code elimination. The justification mentioned above takes the form of type derivation in our approach.

Full work available at URL: https://arxiv.org/abs/1212.5089

Recommendations

• scientific article; zbMATH DE number 1834570
• Eliminating partially dead code in explicitly parallel programs
• Program and proof optimizations with type systems
• A shared-variable concurrency analysis of multi-threaded object-oriented programs
• Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures

zbMATH Keywords

flow-sensitive pointer analysis of multithreaded programsmultitheaded programs with pointer constructs

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• An axiomatic basis for computer programming
• Simple relational correctness proofs for static analyses and program transformations
• From flow logic to static type systems for coordination languages
• Program and proof optimizations with type systems
• Title not available (Why is that?)
• Programming Languages and Systems
• Type systems equivalent to data-flow analyses for imperative languages
• Title not available (Why is that?)
• Semi-sparse flow-sensitive pointer analysis

Cited In (2)

• Eliminating dead code on recursive data.
• Title not available (Why is that?)

This page was built for publication: Dead code elimination based pointer analysis for multithreaded programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939745)