The DOI matches its Crossref record; 22 of the 23 references it cites were found in a registry or an index.
Sketching stencils
Abstract
Performance of stencil computations can be significantly improved through smart implementations that improve memory locality, computation reuse, or parallelize the computation. Unfortunately, efficient implementations are hard to obtain because they often involve non-traditional transformations, which means that they cannot be produced by optimizing the reference stencil with a compiler. In fact, many stencils are produced by code generators that were tediously handcrafted.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Bailey, D. H., Barszcz, E., Barton, J. T., Browning, D. S., Carter, R. L., Dagum, L., Fatoohi, R. A., Frederickson, P. O., Lasinski, T. A., Schreiber, R. S., et al. (1991) · The International Journal of Supercomputing Applications · doi:10.1177/109434209100500306 · Cited by 2,395
FFTW: an adaptive software architecture for the FFT
Frigo, M., & Johnson, S. G. (2002) · Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181) · doi:10.1109/icassp.1998.681704 · Cited by 1,801
A Multigrid Tutorial, Second Edition
Briggs, W. L., Henson, V. E., & McCormick, S. F. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719505 · Cited by 1,510
The Omega test: a fast and practical integer programming algorithm for dependence analysis
Pugh, W. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125848 · Cited by 750
Combinatorial sketching for finite programs
Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., & Saraswat, V. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168907 · Cited by 635
Self-citationDAG-aware AIG rewriting a fresh look at combinational logic synthesis
Mishchenko, A., Chatterjee, S., & Brayton, R. (2006) · Proceedings of the 43rd annual conference on Design automation - DAC '06 · doi:10.1145/1146909.1147048 · Cited by 490
Self-Adapting Linear Algebra Algorithms and Software
Demmel, J., Dongarra, J., Eijkhout, V., Fuentes, E., Petitet, A., Vuduc, R., Whaley, R. C., & Yelick, K. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840848 · Cited by 204
Spiral: A Generator for Platform-Adapted Libraries of Signal Processing Alogorithms
Püschel, M., Moura, J. M. F., Singer, B., Xiong, J., Johnson, J., Padua, D., Veloso, M., & Johnson, R. W. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004041291 · Cited by 180
Verification of Infinite State Systems by Compositional Model Checking
McMillan, K. L. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48153-2_17 · Cited by 176
Deciding Bit-Vector Arithmetic with Abstraction
Bryant, R. E., Kroening, D., Ouaknine, J., Seshia, S. A., Strichman, O., & Brady, B. A. (2007) · Springer eBooks · doi:10.1007/978-3-540-71209-1_28 · Cited by 152
Self-citation
Research works printed but not linked: 3
- W. L. Briggs , V. E. Henson , and S. F. McCormick . A Multigrid Tutorial . SIAM , 2000 . W. L. Briggs, V. E. Henson, and S. F. McCormick. A Multigrid Tutorial. SIAM, 2000.
- 10.5555/1763507.1763544 · doi:10.5555/1763507.1763544
- 10.1145/1168857.1168907 · DOI · Paper page
Cited by
Program synthesis by sketching
Bodík, R., & Solar-Lezama, A. (2008) · UC Berkeley · Cited by 388
Self-citationFrom program verification to program synthesis
Srivastava, S., Gulwani, S., & Foster, J. S. (2010) · Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1706299.1706337 · Cited by 267
Solar-Lezama, A. (2013) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-012-0249-7 · Cited by 226
Self-citationSynthesis of loop-free programs
Gulwani, S., Jha, S., Tiwari, A., & Venkatesan, R. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993506 · Cited by 237
Synthesis of loop-free programs
Gulwani, S., Jha, S., Tiwari, A., & Venkatesan, R. (2011) · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1993498.1993506 · Cited by 200
Metadata
- Authors
- Solar-Lezama, A., Arnold, G., Tancau, L., Bodik, R., Saraswat, V., & Seshia, S.
- Affiliations
- University of California, Berkeley (US)
- UC Berkeley, Berkeley, CA
- IBM (United States) (US)
- Venue
- Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2007-06-10
- Pages
- 167-178
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2293033107
- Cited by
- 149
- References
- 23
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 1 · 2023: 1 · 2022: 3 · 2021: 10 · 2020: 7 · 2019: 7 · 2018: 4 · 2017: 8 · 2016: 10 · 2015: 8 · 2014: 5 · 2013: 14 · 2012: 14
- FWCI
- 7.42
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
- Keywords
- stencil computations, code generation, memory locality, computation reuse, parallelization, compiler optimization
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: Sketching stencils. https://app.cochat.ai/papers/10.1145/1250734.1250754
- The paper
- Solar-Lezama, A., Arnold, G., Tancau, L., Bodik, R., Saraswat, V., & Seshia, S. (2007). Sketching stencils. Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/1250734.1250754
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.