Efficient symbolic analysis for parallelizing compilers and performance estimators

DOI10.1023/A:1008013906463zbMath0905.68037OpenAlexW1560642162MaRDI QIDQ1264541

Thomas Fahringer

Publication date: 11 January 1999

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008013906463

zbMATH Keywords

symbolic analysis

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of software (68N99)

Related Items (1)

Development and performance analysis of real-world applications for distributed and parallel architectures

This page was built for publication: Efficient symbolic analysis for parallelizing compilers and performance estimators