Code generation in the polyhedral model is easier than you think
Open accessThe DOI matches its Crossref record; 28 of the 30 references it cites were found in a registry or an index.
Abstract
Many advances in automatic parallelization and optimization have been achieved through the polyhedral model. It has been extensively shown that this computational model provides convenient abstractions to reason about and apply program transformations. Nevertheless, the complexity of code generation has long been a deterrent for using polyhedral representation in optimizing compilers. First, code generators have a hard time coping with generated code size and control overhead that may spoil theoretical benefits achieved by the transformations. Second, this step is usually time consuming, hampering the integration of the polyhedral framework in production compilers or feedback-directed, iterative optimization schemes. Moreover, current code generation algorithms only cover a restrictive set of possible transformation functions. This paper discusses a general transformation framework able to deal with nonunimodular, noninvertible, nonintegral or even nonuniform functions. It presents several improvements to a state-of-the-art code generation algorithm. Two directions are explored: generated code size and code generator efficiency. Experimental evidence proves the ability of the improved method to handle real-life problems.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Dataflow analysis of array and scalar references
Feautrier, P. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01407931 · Cited by 567
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
Feautrier, P. (1992) · International Journal of Parallel Programming · doi:10.1007/bf01407835 · Cited by 555
The Structure of Computers and Computations
Kuck, D. L. (1978) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 492
Parametric integer programming
Feautrier, P. (1988) · RAIRO - Operations Research · doi:10.1051/ro/1988220302431 · Cited by 378
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
Feautrier, P. (1992) · International Journal of Parallel Programming · doi:10.1007/bf01379404 · Cited by 368
Scanning polyhedra with DO loops
Ancourt, C., & Irigoin, F. (1991) · Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/109625.109631 · Cited by 315
A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
WILDE, D. K. (2000) · Parallel Algorithms and Applications · doi:10.1080/01495730008947354 · Cited by 198
Generation of Efficient Nested Loops from Polyhedra
Quilleré, F., Rajopadhye, S., & Wilde, D. (2000) · International Journal of Parallel Programming · doi:10.1023/a:1007554627716 · Cited by 161
Research works printed but not linked: 2
- le fur, 1994, Parcours de polye?dres parame?tre?s avec l'e?limination de Fourier-Motzkin, Technical Report, 2358
- slama, 2000, Vers l'extension du mode?le polye?drique aux transformations irre?gulie?res, CARI'5 International Conference on African Research in Computer Science
Cited by
Items 301–400 of 457
Extracting Coarse–Grained Parallelism for Affine Perfectly Nested Quasi–uniform Loops
Bielecki, W., & Kraska, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31464-3_31 · Cited by 2
Temporal blocking of finite-difference stencil operators with sparse “off-the-grid” sources
Bisbas, G., Luporini, F., Louboutin, M., Nelson, R. B., Gorman, G., & Kelly, P. H. J. (2021) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps49936.2021.00058 · Cited by 2
Accelerating OpenVX through Halide and MLIR
Songlin, W., Wang, X.-Y., Peng, M.-Y., & Liao, S.-W. (2023) · Journal of Signal Processing Systems · doi:10.1007/s11265-022-01826-8 · Cited by 2
Towards a Tighter Integration of Generated and Custom-Made Hardware
Devos, H., Meeus, W., & Stroobandt, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12133-3_44 · Cited by 2
Model Transformations for the Compilation of Multi-processor Systems-on-Chip
Piel, É., Marquet, P., & Dekeyser, J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88643-3_13 · Cited by 2
Locality Optimization for Data Parallel ProgramsPreprint
Hielscher, E., Rubinsteyn, A., & Shasha, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.1835 · Cited by 2
Introducing Molly: Distributed Memory Parallelization with LLVMPreprint
Kruse, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.2088 · Cited by 2
Verification of Program Parallelization
Darabi, S. (2018) · doi:10.3990/1.9789036544849 · Cited by 2
Ramon-Cortes, C., Amela, R., Ejarque, J., Clauss, P., & Badia, R. M. (2018) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · doi:10.48550/arxiv.1810.11268 · Cited by 2
Automatic Performance Optimization of Stencil Codes
Kronawitter, S. (2019) · OPUS (University of Passau) · Cited by 4
Devos, H., Meeus, W., & Stroobandt, D. (2009) · Design, Automation, and Test in Europe · Cited by 2
Nardi, L. (2011) · theses.fr (ABES) · doi:10.70675/6be115cdz7feez4742zacaazb342745e8be1 · Cited by 2
High level synthesis:performance analysis and code optimization
Hendriks, J. (2012) · TU/e Research Portal · Cited by 2
Compiler transformation to generate hybrid sparse computations
Zhang, H., Venkat, A., & Hall, M. W. (2016) · doi:10.5555/3018843.3018849 · Cited by 1
Efficiency of Various Tiling Strategies for the Zuker Algorithm Optimization
Błaszyński, P., Pałkowski, M., Bielecki, W., & Poliwoda, M. (2024) · Mathematics · doi:10.3390/math12050728 · Cited by 1
Effects Dependence Graph: A Key Data Concept for C Source-to-Source Compilers
Lossing, N., Guillou, P., & Irigoin, F. (2016) · IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM) · doi:10.1109/scam.2016.20 · Cited by 1
Polyhedral model based application source codes analysis for ASIP design
Li, X., Zhou, W., & Liu, D. (2012) · International Conference on Systems and Informatics (ICSAI) · doi:10.1109/icsai.2012.6223169 · Cited by 1
A Polyhedral Modeling Based Source-to-Source Code Optimization Framework for GPGPU
Wang, C., Kang, K., Zhu, M., & Deng, Y. S. (2012) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2012.256 · Cited by 1
A Case Study of Implementing Supernode Transformations
Steinbrecher, J., Philippidis, C. J., & Shang, W. (2013) · International Journal of Parallel Programming · doi:10.1007/s10766-013-0248-7 · Cited by 1
Automatic Hybrid OpenMP + MPI Program Generation for Dynamic Programming Problems
Vandenberg, D. R., & Stout, Q. F. (2011) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster.2011.28 · Cited by 1
Leveraging GPUs using cooperative loop speculation
Samadi, M., Hormati, A. H., Lee, J., & Mahlke, S. A. (2014) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2579617 · Cited by 1
Automatic Generation of Communications for Redundant Multi-dimensional Data Parallel Redistributions
Ancourt, C., Petrisor, T., Irigoin, F., & Lenormand, E. (2013) · doi:10.1109/hpcc.and.euc.2013.116 · Cited by 1
Highly Efficient Performance Portable Tracking of Evolving Surfaces
Yu, W. B., Franchetti, F., Hoe, J. C., & Chen, T. (2012) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2012.36 · Cited by 1
An Efficient Framework for Multi-dimensional Tuning of High Performance Computing Applications
Cong, G., Wen, H.-F., Chung, I., Klepacki, D. J., Murata, H., & Negishi, Y. (2012) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2012.124 · Cited by 1
Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures
Größlinger, A. (2008) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagsemproc.07361.5 · Cited by 1
Polyhedral Model Based Data Locality Optimization for Embedded Applications
Xinyu, Y., & Li, Y. (2010) · IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/greencom-cpscom.2010.120 · Cited by 1
On supernode transformations and multithreading for the longest common subsequence problem
Steinbrecher, J., & Shang, W. (2012) · Cited by 1
Explicitly isolating data and computation in high level synthesis: the role of polyhedral framework
Cattaneo, R., Pallotta, G., Sciuto, D., & Santambrogio, M. D. (2015) · International Conference on ReConFigurable Computing and FPGAs (ReConFig) · doi:10.1109/reconfig.2015.7393304 · Cited by 1
A Quick Tour of High-Level Synthesis Solutions for FPGAs
Hannig, F. (2016) · Springer eBooks · doi:10.1007/978-3-319-26408-0_3 · Cited by 1
Loop Nest Tiling for Image Processing and Communication Applications
Bielecki, W., & Pałkowski, M. (2016) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-48429-7_28 · Cited by 1
New solutions for system-level and high-level synthesis (Invited paper)
Zuo, W., Zheng, H., Guruman, S. T., Rupnow, K., & Chen, D. (2014) · International Symposium on Integrated Circuits · doi:10.1109/isicir.2014.7029582 · Cited by 1
Polygonal Iteration Space Partitioning
Shivam, A., Nicolau, A. E., Veidenbaum, A. V., Furnari, M. M., & Cammarota, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-52709-3_11 · Cited by 1
Bielecki, W. (2015) · PRZEGLĄD ELEKTROTECHNICZNY · doi:10.15199/48.2015.11.41 · Cited by 1
In search of a map: using program slicing to discover potential parallelism in recursive functions
Barwell, A. D., & Hammond, K. (2017) · doi:10.1145/3122948.3122951 · Cited by 1
K-DT: a formal system for the evaluation of linear data dependence testing techniques
Zhao, J., & Zhao, R. (2017) · The Journal of Supercomputing · doi:10.1007/s11227-017-2187-3 · Cited by 1
Semi-Automatic Generation of Adaptive Codes
Schmitt, M., Sabater, C., & Bastoul, C. (2017) · HAL · Cited by 1
Self-citationLebedev, A. S. (2017) · IEEE International Conference on Application of Information and Communication Technologies (AICT) · doi:10.1109/icaict.2017.8686931 · Cited by 1
Array dataflow analysis for polyhedral X10 programs
Yuki, T., Feautrier, P., Rajopadhye, S. V., & Saraswat, V. (2013) · ACM SIGPLAN Notices · doi:10.1145/2517327.2442520 · Cited by 1
Compiler Transformation to Generate Hybrid Sparse Computations
Zhang, H., Venkat, A., & Hall, M. W. (2016) · Irregular Applications: Architectures and Algorithms · doi:10.1109/ia3.2016.011 · Cited by 1
Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs
Rodríguez-Iglesias, A., Tongli, S. T., Tucker, E., Pouchet, L.-N., Rodríguez, G., & Touriño, J. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3729335 · Cited by 1
PolyMorphous: An MLIR-Based Polyhedral Compiler with Loop Transformation Primitives
Zhao, J., Vahabpour, S. A., Yue, X., Wang, K.-T. A., & Abdelrahman, T. S. (2025) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps64566.2025.00041 · Cited by 1
CART: Constant Aspect Ratio Tiling
Iooss, G., Rajopadhye, S. V., Alias, C., Zou, Y., Iooss, G., Rajopadhye, S., Alias, C., Zou, Y., Constant, C., Ra, A., et al. (2014) · Cited by 1
Extracting representative loop statement instances of synchronization-free slices
Bielecki, W., Pałkowski, M., & Beletska, A. (2009) · Pomiary Automatyka Kontrola · Cited by 1
A domain specific interconnect for reconfigurable computing
Rajopadhye, S. V., Gupta, G., & Renganarayana, L. (2008) · ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) · doi:10.1145/1375657.1375669 · Cited by 1
Burtscher, M., Kim, B.-D., Diamond, J., McCalpin, J. D., Koesterke, L., & Browne, J. C. (2010) · Cited by 1
Automatic parallelization experiments on 16PE NOC based MPSOC
Tian, G., & Hammami, O. (2009) · IEEE International Conference on ASIC (ASICON) · doi:10.1109/asicon.2009.5351532 · Cited by 1
A Compiler Framework for Optimization of Affine Loop Nests for General Purpose Computations on GPUs
Baskaran, M. M., Bondhugula, U. K. R., Krishnamoorthy, S., Ramanujam, J., Rountev, A., & Sadayappan, P. (2015) · Cited by 1
A Conservative Approach to Handle Full Functions in the Polyhedral Model
Benabderrahmane, M.-W., Bastoul, C., Pouchet, L.-N., & Cohen, A. (2008) · HAL · Cited by 1
Self-citationSynthesis and Exploration of Loop Accelerators for Systems-on-a-Chip
Dutta, H. (2011) · OPUS FAU (Kooperativer Bibliotheksverbund Berlin-Brandenburg (KOBV), on behalf of the Universitätsbibliothek Erlangen-Nürnberg) · Cited by 1
Data Reuse and Parallelism in Hardware Compilation
Liu, Q. (2008) · Spiral (Imperial College London) · doi:10.25560/4370 · Cited by 1
Mapping loop-based programs onto a multithreaded processor
Σαούγκος, Δ. (2014) · doi:10.12681/eadd/39700 · Cited by 1
Lazcano, R. (2020) · UPM Digital Archive (Technical University of Madrid) · doi:10.20868/upm.thesis.65813 · Cited by 1
SpComp: A Sparsity Structure-Specific Compilation of Matrix OperationsPreprint
Basak, B., Khedker, U. P., & Biswas, S. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2307.06109 · Cited by 1
Wang, X.-Y., Shen, J.-Y., & Liao, S.-W. (2023) · Research Square · doi:10.21203/rs.3.rs-3274775/v1 · Cited by 1
Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra
Upadrasta, R. (2013) · theses.fr (ABES) · doi:10.70675/746a08c2ze1b9z43bfz811dz8e4747dd502d · Cited by 3
Lattice QCD Optimization and Polytopic Representations of Distributed Memory
Kruse, M. (2014) · theses.fr (ABES) · doi:10.70675/a7d7eec2z9df5z421eza075z60a39e4c85af · Cited by 1
Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation
Baghdadi, R. (2015) · theses.fr (ABES) · doi:10.70675/eb0f178czd7a4z429cz8c3bz1c08386111b2 · Cited by 11
Detection of linear algebra operations in polyhedral programs
Iooss, G. (2016) · theses.fr (ABES) · doi:10.70675/3cde6274ze889z4b94zb3c6z60783d4685c6 · Cited by 1
Extending Polyhedral Techniques towards Parallel Specifications and Approximations
Isoard, A. (2016) · theses.fr (ABES) · doi:10.70675/9cd29c36zc5f0z45b8z910bz3521358ce9b5 · Cited by 1
Optimization techniques for fine-grained communication in PGAS environments
Alvanos, M. (2013) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-95212 · Cited by 1
A conversion of "while" and "do-while" loops to allow dependency analysis by existing tools
Poliwoda, M., & Błaszyński, P. (2010) · Pomiary Automatyka Kontrola
Accelerating molecular dynamics computing using iteration space slicing
Pałkowski, M. (2013) · Journal of Applied Computer Science
Explotando jerarquías de memoria distribuida/compartida con Hitmap
Moreton‐Fernandez, A. (2014) · University of Valladolid Documentary Repository (University of Valladolid)
Framework pour une exécution efficace sur systèmes GPU et CPU+GPU
Dollinger, J.-F. (2015) · theses.fr (ABES) · doi:10.70675/631d4ee5zcaabz4a0bzb254z6a4600d83b85
Contributions à la conception d'architectures matérielles dédiées
Derrien, S. (2011) · HAL
Automatyczne zrównoleglanie kodu aplikacji systemów wbudowanych
Pałkowski, M. (2010) · Pomiary Automatyka Kontrola
Wyznaczanie równoległości pętli programowych w aplikacjach dedykowanych dla procesorów graficznych
Bielecki, W., & Pałkowski, M. (2011) · Pomiary Automatyka Kontrola
Usage of the TRACO Compiler for Neural Network Parallelization
Pałkowski, M., & Bielecki, W. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07173-2_12
van Teijlingen, W. (2014) · Research Repository (Delft University of Technology)
Identifying hotspots in a program for data parallel architecture: an early experience
Sarkar, S., & Maltouf, M. F. (2012) · India Software Engineering Conference · doi:10.1145/2134254.2134277
SARA: StreAm register allocation
Raghavan, P., & Catthoor, F. (2009) · International Conference on Hardware/Software Codesign and System Synthesis · doi:10.1145/1629435.1629442
A Parallel for Loop Memory Template for a High Level Synthesis Compiler
Moore, C. T., Meeus, W., Devos, H., & Stroobandt, D. (2010) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd.2010.62
HYDA: A HYbrid Dependence Analysis for the adaptive optimisation of OpenCL kernels
Margiolas, C., & O’boyle, M. F. P. (2014) · doi:10.1145/2553062.2553069
Transparent and Efficient I/O for Statistical Computing
Zhang, Y. (2012) · DukeSpace (Duke University)
Iterative Optimization in the Polyhedral Model: One-Dimensional Scheduling Case
Pouchet, L.-N., Bastoul, C., & Cohen, A. (2006) · HAL
Self-citationAn Integrated Program Representation for Loop Optimizations
Yellareddy, G. (2011) · University Libraries (University of Maryland)
On Optimizing the Longest Common Subsequence Problem by Loop Unrolling Along Wavefronts
Steinbrecher, J., & Shang, W. (2012) · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · doi:10.1109/pdp.2012.49
Simdization transformation strategies
Westen, H. P. (2012) · Research Repository (Delft University of Technology)
Bielecki, W., & Drazkowski, R. (2005)
Programming NVIDIA cards by means of transitive closure based parallelization algorithms
Pałkowski, M., & Bielecki, W. (2012) · PRZEGLĄD ELEKTROTECHNICZNY
Hagemann, W. (2014) · MPG.PuRe (Max Planck Society) · doi:10.22028/d291-26630
A toolkit for building dynamic compilers for array-based languages targeting cpus and gpus
Garg, R. D. (2015) · eScholarship@McGill (McGill) · doi:10.82308/5113
Pragma Directed Shared Memory Centric Optimizations on GPUs
Li, J., Liu, L., Wu, Y., Liu, X.-H., Gao, Y., Feng, X., & Wu, C. (2016) · Journal of Computer Science and Technology · doi:10.1007/s11390-016-1624-8
The HtComp Research Project: An Overview
Cilardo, A. (2015) · International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) · doi:10.1109/3pgcic.2015.135
High-level synthesis for data-intensive applications
Devos, H., & Stroobandt, D. (2008) · Ghent University Academic Bibliography (Ghent University)
Indexed dependence metadata and its applications in software performance optimisation
Howes, L. (2010) · Spiral (Imperial College London) · doi:10.25560/5589
Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs
Bielecki, W., Pałkowski, M., & Klimek, T. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-32152-3_13
Ecient Looping Units for FPGAs
Kavvadias, N., & Masselos, K. (2010)
Design and evaluation of a Thread-Level Speculation runtime library
Estebanez, A. (2015) · UVaDOC UVaDOC University of Valladolid Documentary Repository (University of Valladolid) · doi:10.35376/10324/17459
An Iteration Space Visualizer for Polyhedral Loop Transformations in Numerical Programming
Pałkowski, M., & Bielecki, W. (2016) · Annals of Computer Science and Information Systems · doi:10.15439/2016f48
Separating implementation concerns in stencil computations for semiregular grids
Stone, A., Strout, M. M., Massey, D., Pallickara, S., & Randall, D. (2007) · Digital Collections of Colorado (Colorado State University) · doi:10.25675/3.021774
A metadata-enhanced framework for high performance visual effects
Cornwall, J. L. T. (2010) · Spiral (Imperial College London) · doi:10.25560/5854
Language and Compiler Parallelization Support for Hashtables
Suresh, A. (2012)
Combining the DKU Pattern with Polyhedral Optimization and Tiling
Kronawitter, S. (2013)
A Survey of Loop Parallelization: Models, Approaches, and Recent Developments
Hong, Y., Deng, H., & Zou, C. (2016) · International Journal of Grid and Distributed Computing · doi:10.14257/ijgdc.2016.9.11.12
An integrated compiler and runtime framework for sparse matrix codes
Venkat, A. (2018) · J. Willard Marriott Library · doi:10.26053/0h-n2q9-he00
New Solutions for Cross-Layer System-Level and High-Level Synthesis
Zuo, W., Gurumani, S., Rupnow, K., & Chen, D. (2017) · Springer eBooks · doi:10.1007/978-3-319-54840-1_5
Metadata
- Authors
- Bastoul, C.
- Affiliations
- Université de Versailles Saint-Quentin-en-Yvelines (FR)
- Corresponding author
- Bastoul, C.
- ORCID
- Bastoul, C.
- Venue
- Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004.
- Publisher
- IEEE
- Published
- 2004-11-08
- Pages
- 7-16
- ISSN
- 1089-795X (ISSN-L)
- OpenAlex
- W2076485607
- Cited by
- 447
- References
- 30
- Citations by year
- 2026: 2 · 2025: 4 · 2024: 4 · 2023: 5 · 2022: 6 · 2021: 20 · 2020: 12 · 2019: 19 · 2018: 18 · 2017: 34 · 2016: 39 · 2015: 43 · 2014: 37 · 2013: 33 · 2012: 39
- FWCI
- 5.84
- Type
- conference paper
- Language
- en
- Open access
- green
- hal.science
- Licence
- other-oa
- Locations
- International Conference on Parallel Architectures and Compilation Techniques (PACT) (publishedVersion)
- HAL (submittedVersion, other-oa)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Keywords
- polyhedral models, code generation, program transformation, automatic parallelization, program size, optimizing compilers, feedback-directed 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
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.