The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Code generation in the polyhedral model is easier than you think
Bastoul, C. (2004) · Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004. · doi:10.1109/pact.2004.1342537 · Cited by 447
Self-citationBlocking and array contraction across arbitrarily nested loops using affine partitioning
Lim, A. W., Liao, S.-W., & Lam, M. S. (2001) · Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming · doi:10.1145/379539.379586 · Cited by 142
Cited by
POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATION
GROSSER, T., GROESSLINGER, A., & LENGAUER, C. (2012) · Parallel Processing Letters · doi:10.1142/s0129626412500107 · Cited by 355
A practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375595 · Cited by 248
Metadata
- Authors
- Girbal, S., Vasilache, N., Bastoul, C., Cohen, A., Parello, D., Sigler, M., & Temam, O.
- Venue
- International Journal of Parallel Programming
- Published
- 2006-06
- Volume
- 34
- Issue
- 3
- Pages
- 261-317
- ISSN
- 0885-7458 (ISSN-L)
- 1573-7640
- OpenAlex
- W2071110673
- Cited by
- 215
- References
- 2
- FWCI
- 18.77
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies. https://app.cochat.ai/papers/10.1007/s10766-006-0012-3
- The paper
- Girbal, S., Vasilache, N., Bastoul, C., Cohen, A., Parello, D., Sigler, M., & Temam, O. (2006). Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies. International Journal of Parallel Programming. https://doi.org/10.1007/s10766-006-0012-3
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
