A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
In this paper, we take a novel approach that addresses all three limitations to provide an automatic bug checker to verify any iteration reordering transformations on affine programs, including non-affine ... Guaranteeing the correctness of program transformations is essential, and to date three main approaches have been developed: proof of equivalence of affine programs, matching the execution traces of programs ... Department of Energy's (DOE) Office of Science, Office of Advanced Scientific Computing Research, under awards 63823, 66905, and DE-SC0014135, and the U.S. ...doi:10.1145/2837614.2837656 dblp:conf/popl/BaoKPRS16 fatcat:dmeyobfderamrl6heu2vs6zu3i
This paper considers the correctness of domain-specific compilers for tensor programming languages through the study of Halide, a popular representative. ... It describes a translation validation algorithm for affine Halide specifications, independently of the scheduling language. ... Bao et al.  propose a dynamic approach, dubbed PolyCheck, to the problem. ...doi:10.1145/3527328 fatcat:sm4gpdt64jfhvmmd6eelsf6rt4
FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach. ... This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. ... Specifically, compiler transformed programs can harbor bugs, as shown in the work on Polycheck  . ...arXiv:2004.04359v4 fatcat:ksfofxi7qrdrrfkgazvxr5kn54