Finding basic block and variable correspondence

  • Authors:
  • Iman Narasamdya;Andrei Voronkov

  • Affiliations:
  • University of Manchester;University of Manchester

  • Venue:
  • SAS'05 Proceedings of the 12th international conference on Static Analysis
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Having in mind the ultimate goal of translation validation for optimizing compilers, we propose a new algorithm for solving the problem of finding basic block and variable correspondence between two (low-level) programs generated by a compiler from the same source using different optimizations. The essence of our technique is interpretation of the two programs on random inputs and comparing the histories of value changes for variables. We describe an architecture of a system for finding basic block and variable correspondence and provide experimental evidence of its usefulness.