Eliminating partially dead code in explicitly parallel programs

DOI10.1016/S0304-3975(97)00208-9zbMath0902.68037MaRDI QIDQ1128737

Jens Knoop

Publication date: 13 August 1998

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

zbMATH Keywords

parallelisminterleaving semanticsshared memoryprogram optimizationpartial dead-code elimination

Mathematics Subject Classification ID

Theory of software (68N99)

Cites Work

• Monotone data flow analysis frameworks
• Frameworks for abstract interpretation
• On theories with a combinatorial definition of 'equivalence'
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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