Equational Verification of Cache Blocking in LU Decomposition using Kleene Algebra with Tests
| dc.contributor.author | Barth, Adam | en_US |
| dc.contributor.author | Kozen, Dexter | en_US |
| dc.date.accessioned | 2007-04-09T19:57:21Z | |
| dc.date.available | 2007-04-09T19:57:21Z | |
| dc.date.issued | 2002-10-24 | en_US |
| dc.description.abstract | In a recent paper of Mateev et al. (2001), a new technique for program analysis called fractal symbolic analysis was introduced and applied to verify the correctness of a series of source-level transformations for cache blocking in LU decomposition with partial pivoting. It was argued in that paper that traditional techniques are inadequate because the transformations break definition-use dependencies. We show how the task can be accomplished purely equationally using Kleene algebra with tests. | en_US |
| dc.format.extent | 160496 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR2002-1865 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5848 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Equational Verification of Cache Blocking in LU Decomposition using Kleene Algebra with Tests | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1