Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Global value numbering"'
Autor:
Yonghyun Kim, Sang-Hoon Park, Joonwon Choi, June-Young Lee, Chung-Kil Hur, Mark Dongyeon Shin, Sungkeun Cho, Kwangkeun Yi, Jeehoon Kang, Youngju Song, Yoonseung Kim
Publikováno v:
PLDI
Production compilers such as GCC and LLVM are large complex software systems, for which achieving a high level of reliability is hard. Although testing is an effective method for finding bugs, it alone cannot guarantee a high level of reliability. To
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a403c957d9ae8ac180ec9b64d533d97
https://doi.org/10.1145/3296979.3192377
https://doi.org/10.1145/3296979.3192377
Autor:
Rekha R. Pai
Publikováno v:
Computer Languages, Systems & Structures. 46:167-181
Detection of redundant expressions in a program based on values is a well researched problem done with a view to eliminate redundancies so as to improve run-time efficiency of the program. The problem entails detection of equivalent expressions in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23ff0ab10036051c40cbfc2b40e1a9fc
https://doi.org/10.1016/j.cl.2016.07.006
https://doi.org/10.1016/j.cl.2016.07.006
Autor:
John Regehr, David Majnemer, Chung-Kil Hur, Youngju Song, Sanjoy Das, June-Young Lee, Yoonseung Kim, Nuno P. Lopes
Publikováno v:
PLDI
A central concern for an optimizing compiler is the design of its intermediate representation (IR) for code. The IR should make it easy to perform transformations, and should also afford efficient and precise static analysis. In this paper we study a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d3ca145decda41d0404d74e54da4682
https://doi.org/10.1145/3062341.3062343
https://doi.org/10.1145/3062341.3062343
Autor:
N. K. Muhsina, Nabizath Saleena
Publikováno v:
2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT).
The methods for redundancy detection can be classified as lexical approaches and value based approaches. Lexical approaches discover redundancy among lexically identical expressions. Value based approaches discovers redundancy among expressions compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d528a8af668ebdc89132abc9920c8316
https://doi.org/10.1109/icecct.2017.8117820
https://doi.org/10.1109/icecct.2017.8117820
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
Publikováno v:
ASPLOS
Alias analysis is a critical component in many compiler optimizations. A promising approach to reduce the complexity of alias analysis is to use speculation. The approach consists of performing optimizations assuming the alias relationships that are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29393586757ce01afee53ed4171d36f5
https://doi.org/10.1145/2499368.2451136
https://doi.org/10.1145/2499368.2451136
Autor:
Nabizath Saleena, C M Akhila
Publikováno v:
2016 IEEE Annual India Conference (INDICON).
We present an algorithm for value based redundancy detection in Static Single Assignment(SSA) code. For this, we adopted the idea of Global Value Numbering from the Simple Algorithm for GVN (Saleena and Paleri, 2014). The novel approach is to make us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11ee44fcf840f4a74bfc9f56e2798369
https://doi.org/10.1109/indicon.2016.7839019
https://doi.org/10.1109/indicon.2016.7839019
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
Autor:
Nabizath Saleena, Vineeth Paleri
Publikováno v:
Journal of Information Processing Systems.
Global value numbering (GVN) is a method for detecting equivalent expressions in programs. Most of the GVN algorithms concentrate on detecting equalities among variables and hence, are limited in their ability to identify value-based redundancies. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6643103bd230cdb0a715fb13ed259e60
https://doi.org/10.3745/jips.02.0014
https://doi.org/10.3745/jips.02.0014