Eliminating partially dead code in explicitly parallel programs

DOI10.1016/S0304-3975(97)00208-9MaRDI QIDQ1128737zbMATH OpenFDO

Authors Jens Knoop

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

parallelismshared memoryprogram optimizationinterleaving semanticspartial dead-code elimination

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Dead code elimination based pointer analysis for multithreaded programs
• Automatic storage management for parallel programs
• Run-time data-flow analysis.
• Compiler Construction
• Eliminating dead code on recursive data.

Cites work

• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 814824 (Why is no real title available?)
• Frameworks for abstract interpretation
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Monotone data flow analysis frameworks
• On theories with a combinatorial definition of 'equivalence'

Cited in

(4)

• Compiler Construction
• Dead code elimination based pointer analysis for multithreaded programs
• Eliminating dead code on recursive data.
• scientific article; zbMATH DE number 1301731 (Why is no real title available?)

This page was built for publication: Eliminating partially dead code in explicitly parallel programs

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