Zobrazeno 1 - 10
of 384
pro vyhledávání: '"Global value numbering"'
Autor:
Das, Ankush, Lal, Akash
Precise analysis of pointer information plays an important role in many static analysis techniques and tools today. The precision, however, must be balanced against the scalability of the analysis. This paper focusses on improving the precision of st
Externí odkaz:
http://arxiv.org/abs/1702.05807
Autor:
Pai, Rekha R
Global Value Numbering (GVN) is an important static analysis to detect equivalent expressions in a program. We present an iterative data-flow analysis GVN algorithm in SSA for the purpose of detecting total redundancies. The central challenge is defi
Externí odkaz:
http://arxiv.org/abs/1504.03239
Autor:
Saleena, Nabizath, Paleri, Vineeth
Global Value Numbering(GVN) is a method for detecting redundant computations in programs. Here, we introduce the problem of Global Value Numbering in its original form, as conceived by Kildall(1973), and present an algorithm which is a simpler varian
Externí odkaz:
http://arxiv.org/abs/1303.1880
Autor:
Nabeezath, Saleena, Paleri, Vineeth
Global Value Numbering(GVN) is a popular method for detecting redundant computations. A polynomial time algorithm for GVN is presented by Gulwani and Necula(2006). Here we present two limitations of this GVN algorithm due to which detection of certai
Externí odkaz:
http://arxiv.org/abs/1302.6325
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Gulwani, Sumit, Necula, George C.
Publikováno v:
In Science of Computer Programming 2007 64(1):97-114
Autor:
K. A. Ansar, Nabizath Saleena
Publikováno v:
2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT).
Redundancy elimination is an important compiler optimization, which deals with the elimination of unnecessary reevaluations of the same computation. This optimization requires two passes — one pass to detect the redundant computations and the secon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e926212684467046c88424172bf68558
https://doi.org/10.1109/icecct.2017.8117875
https://doi.org/10.1109/icecct.2017.8117875
Autor:
Ankush Das, Akash Lal
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783319681665
ATVA
ATVA
Precise analysis of pointer information plays an important role in many static analysis tools. The precision, however, must be balanced against the scalability of the analysis. This paper focusses on improving the precision of standard context and fl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::468ae13c3c9134a9360d6738d8b17a1a
https://doi.org/10.1007/978-3-319-68167-2_2
https://doi.org/10.1007/978-3-319-68167-2_2
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
George C. Necula, Sumit Gulwani
Publikováno v:
Science of Computer Programming. 64:97-114
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non-deterministic and all program operators as uninterpreted. We show tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37a8305fba88a40b5fe5039b514d8924
https://doi.org/10.1016/j.scico.2006.03.005
https://doi.org/10.1016/j.scico.2006.03.005