Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Equational Verification of Cache Blocking in LU Decomposition using Kleene Algebra with Tests
Authors: Barth, Adam
Kozen, Dexter
Keywords: computer science
technical report
Issue Date: 24-Oct-2002
Publisher: Cornell University
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.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File SizeFormat
2002-1865.ps156.73 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us