Eliminating partially dead code in explicitly parallel programs

DOI10.1016/S0304-3975(97)00208-9zbMATH Open0902.68037MaRDI QIDQ1128737FDOQ1128737

Authors: Jens Knoop 

Publication date: 13 August 1998

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

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.

zbMATH Keywords

parallelismshared memoryprogram optimizationinterleaving semanticspartial dead-code elimination

Mathematics Subject Classification ID

Theory of software (68N99)

Cites Work

• On theories with a combinatorial definition of 'equivalence'
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monotone data flow analysis frameworks
• Title not available (Why is that?)
• Frameworks for abstract interpretation

Cited In (4)

• Compiler Construction
• Dead code elimination based pointer analysis for multithreaded programs
• Eliminating dead code on recursive data.
• Title not available (Why is that?)

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)