Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Dhananjay M. Dhamdhere"'
Publikováno v:
Computer Languages, Systems & Structures. 29:15-44
Tennenbaum's data flow analysis based formulation of type inferencing is termed bidirectional in the “Dragon Book”; however, it fails to qualify as a formal data flow framework and is not amenable to complexity analysis. Further, the types discov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2ebaaa162d65668d5013b7e6d3e638e
https://doi.org/10.1016/s1477-8424(03)00012-5
https://doi.org/10.1016/s1477-8424(03)00012-5
Publikováno v:
Information Processing Letters. 85:145-152
A slice of a program P with respect to a slicing criterion C ≡ ({var}, c_stmt) is a subset of the program which includes all statements that directly or indirectly affect the value of variable var in c_stmt [1,10–12]. A static slice includes all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73c69da6100c9e1c4dbca1fcb128d899
https://doi.org/10.1016/s0020-0190(02)00322-8
https://doi.org/10.1016/s0020-0190(02)00322-8
Publikováno v:
ACM SIGPLAN Notices. 34:47-57
Research in bidirectional data flow analysis seems to have come to a halt due to an impression that the case for bidirectional data flow analysis has been considerably weakened by a plethora of investigations based on decomposability of known bidirec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b473ee83d644fa4bf283ddd2c42fdd3c
https://doi.org/10.1145/606666.606676
https://doi.org/10.1145/606666.606676
Publikováno v:
ACM Transactions on Programming Languages and Systems. 16:1472-1511
The classical theory of data flow analysis, which has its roots in unidirectional flows, is inadequate to characterize bidirectional data flow problems. We present a generalized theory of bit vector data flow analysis which explains the known results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a521a88afb4315825a48580e63d82822
https://doi.org/10.1145/186025.186043
https://doi.org/10.1145/186025.186043
Publikováno v:
ACM SIGPLAN Notices. 27:212-223
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce443b01448a8cff6488b180e54094d4
https://doi.org/10.1145/143103.143135
https://doi.org/10.1145/143103.143135
Autor:
Dhananjay M. Dhamdhere
Publikováno v:
ACM Transactions on Programming Languages and Systems. 13:291-294
We present some modifications to Morel and Renvoise's algorithm for global optimization by suppression of partial redundancies. The modifications are motivated by the desire to (1) eliminate redundant code motion, and (2) extend the scope of optimiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e27fa07f00d15e68763ce0d164a9f448
https://doi.org/10.1145/103135.214520
https://doi.org/10.1145/103135.214520
Autor:
Dhananjay M. Dhamdhere
Publikováno v:
Computer Languages. 15:83-94
Complexity of the bi-directional data flow dependencies involved in code placement optimisation is believed to be high. Incorporation of the edge placement technique in a register assignment algorithm is shown to (a) enhance the profitability of opti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f67c92c0bee45ff6f64e272fe847ee7
https://doi.org/10.1016/0096-0551(90)90012-e
https://doi.org/10.1016/0096-0551(90)90012-e
Autor:
Dhananjay M. Dhamdhere
Publikováno v:
IndraStra Global.
Partial redundancy elimination (PRE) subsumes the classical optimizations of loop invariant movement and common subexpression elimination. The original formulation of PRE involved complex bi-directional data flows and had two major deficiencies---mis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ea198cd96180921d11cc2462c72f25a
http://dspace.library.iitb.ac.in/xmlui/handle/10054/5056
http://dspace.library.iitb.ac.in/xmlui/handle/10054/5056
Publikováno v:
IndraStra Global.
Compiler optimizations pose many problems to source-level debugging of an optimized program due to reordering, insertion, and deletion of code. On such problem is to determine whether the value of a varible is current at a breakpoint—that is, wheth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fe7898f788b87a702350b15be96889f
http://hdl.handle.net/10054/5055
http://hdl.handle.net/10054/5055
Publikováno v:
IndraStra Global.
This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate up to k site/link failures. The algorithm uses many features of the token based algorithm by Raymond and inherits many of its advantages, viz. s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09cf984cf79a727f4ab9615e5418b4e6