Finding basic block and variable correspondence

Iman Narasamdya; Andrei Voronkov

doi:10.1007/11547662_18

Finding basic block and variable correspondence

Iman Narasamdya
, Andrei Voronkov

Research output: Chapter in Book/Conference proceeding › Conference contribution

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. © Springer-Verlag Berlin Heidelberg 2005.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\|Lect. Notes Comput. Sci.
Publisher	Springer Nature
Pages	251-267
Number of pages	16
Volume	3672
ISBN (Print)	3540285849, 9783540285847
DOIs	https://doi.org/10.1007/11547662_18
Publication status	Published - 2005
Event	12th International Symposium on Static Analysis, SAS 2005 - London Duration: 1 Jul 2005 → … http://dblp.uni-trier.de/db/conf/sas/sas2005.html#NarasamdyaV05http://dblp.uni-trier.de/rec/bibtex/conf/sas/NarasamdyaV05.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/sas/NarasamdyaV05

Publication series

Name	Lecture Notes in Computer Science

Conference

Conference	12th International Symposium on Static Analysis, SAS 2005
City	London
Period	1/07/05 → …
Internet address	http://dblp.uni-trier.de/db/conf/sas/sas2005.html#NarasamdyaV05http://dblp.uni-trier.de/rec/bibtex/conf/sas/NarasamdyaV05.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/sas/NarasamdyaV05

Access to Document

10.1007/11547662_18

Cite this

@inproceedings{bd8c7117982d45e0a6dbc0b80a4103a6,

title = "Finding basic block and variable correspondence",

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2005.",

author = "Iman Narasamdya and Andrei Voronkov",

year = "2005",

doi = "10.1007/11547662\_18",

language = "English",

isbn = "3540285849",

volume = "3672",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature",

pages = "251--267",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",

address = "United States",

note = "12th International Symposium on Static Analysis, SAS 2005 ; Conference date: 01-07-2005",

url = "http://dblp.uni-trier.de/db/conf/sas/sas2005.html\#NarasamdyaV05http://dblp.uni-trier.de/rec/bibtex/conf/sas/NarasamdyaV05.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/sas/NarasamdyaV05",

}

Narasamdya, I & Voronkov, A 2005, Finding basic block and variable correspondence. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 3672, Lecture Notes in Computer Science, Springer Nature, pp. 251-267, 12th International Symposium on Static Analysis, SAS 2005, London, 1/07/05. https://doi.org/10.1007/11547662_18

Finding basic block and variable correspondence. / Narasamdya, Iman; Voronkov, Andrei.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. Vol. 3672 Springer Nature, 2005. p. 251-267 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Conference proceeding › Conference contribution

TY - GEN

T1 - Finding basic block and variable correspondence

AU - Narasamdya, Iman

AU - Voronkov, Andrei

PY - 2005

Y1 - 2005

N2 - 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. © Springer-Verlag Berlin Heidelberg 2005.

AB - 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. © Springer-Verlag Berlin Heidelberg 2005.

U2 - 10.1007/11547662_18

DO - 10.1007/11547662_18

M3 - Conference contribution

SN - 3540285849

SN - 9783540285847

VL - 3672

T3 - Lecture Notes in Computer Science

SP - 251

EP - 267

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.

PB - Springer Nature

T2 - 12th International Symposium on Static Analysis, SAS 2005

Y2 - 1 July 2005

ER -

Finding basic block and variable correspondence

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this