Title: Equivalence checking of static affine programs using widening to handle recurrences
Authors: Verdoolaege, Sven ×
Janssens, Gerda
Bruynooghe, Maurice #
Issue Date: 26-Jun-2009
Publisher: Springer
Host Document: Lecture Notes in Computer Science vol:5643 pages:599-613
Conference: Computer Aided Verification CAV 09 edition:21 location:Grenoble, France date:June 26-July 2 2009
Abstract: Designers often apply manual or semi-automatic loop and
data transformations on array and loop intensive programs to
improve performance. The transformations should preserve the
functionality, however, and this paper presents an automatic
method for constructing equivalence proofs for the class of static affine
programs. The equivalence checking is performed on a dependence
graph abstraction and uses a new approach based on widening to
handle recurrences. Unlike transitive closure based
approaches, this widening approach can also handle non-uniform
recurrences. The implementation is publicly available and is
the first of its kind to fully support commutative operations.
Description: Acceptance rate 27%
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
text.pdfMain article Published 246KbAdobe PDFView/Open
cav2009-verdoolaege.pdfpresentation Published 821KbAdobe PDFView/Open
handouts4.psHand-outs Published 684KbPostscriptView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science