Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code

Development of energy and performance-efficient embedded software is increasingly relying on application of complex transformations on the critical parts of the source code. Designers applying such nontrivial source code transformations are often faced with the problem of ensuring functional equival...

Full description

Saved in:
Bibliographic Details
Published in:Design, Automation and Test in Europe pp. 1310 - 1315
Main Authors: Shashidhar, K. C., Bruynooghe, Maurice, Catthoor, Francky, Janssens, Gerda
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 01.01.2005
IEEE
Series:ACM Conferences
Subjects:
Application software
Circuit simulation
Design optimization
Digital circuits
Embedded software
Feedback
Information systems > Information storage systems > Record storage systems
Mobile computing
Optimizing compilers
Program processors
Signal processing algorithms
Software and its engineering > Software notations and tools > Compilers
Theory of computation > Formal languages and automata theory > Formalisms > Algebraic language theory
Theory of computation > Semantics and reasoning > Program reasoning > Program analysis
Theory of computation > Semantics and reasoning > Program reasoning > Program verification
Theory of computation > Semantics and reasoning > Program semantics
Theory of computation > Semantics and reasoning > Program semantics > Algebraic semantics
ISBN:9780769522883, 0769522882
ISSN:1530-1591
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Development of energy and performance-efficient embedded software is increasingly relying on application of complex transformations on the critical parts of the source code. Designers applying such nontrivial source code transformations are often faced with the problem of ensuring functional equivalence of the original and transformed programs. Currently they have to rely on incomplete and time-consuming simulation. Formal automatic verification of the transformed program against the original is instead desirable. This calls for equivalence checking tools similar to the ones available for comparing digital circuits. We present such a tool to compare array-intensive programs related through a combination of important global transformations like expression propagations, loop and algebraic transformations. When the transformed program fails to pass the equivalence check, the tool provides specific feedback on the possible locations of errors.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780769522883
0769522882
ISSN:1530-1591
DOI:10.1109/DATE.2005.163