skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
The Duality in Computing SSA Programs and Control Dependency
Masud, Abu Naser
IEEE transactions on software engineering, 2023-04, Vol.49 (4), p.1766-1781
[Periódico revisado por pares]
New York: IEEE
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
The Duality in Computing SSA Programs and Control Dependency
Autor:
Masud, Abu Naser
Assuntos:
<
;
named-content xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" content-type="math" xlink:type="simple">
;
<
;
named-content content-type="math" xlink:type="simple">
;
<
;
inline-formula>
;
<
;
tex-math notation="LaTeX">
;
phi<
;
/tex-math>
;
<
;
/inline-formula>
;
<
;
/named-content>
;
<
;
mml:math>
;
<
;
mml:mi>
;
ϕ<
;
/mml:mi>
;
<
;
/mml:math>
;
<
;
inline-graphic xlink:href="masud-ieq3-3192249.gif" xlink:type="simple"/>
;
<
;
/named-content>
;
function
;
Algorithms
;
Apexes
;
Approximation algorithms
;
Benchmark testing
;
Computation
;
Computational modeling
;
control dependency
;
duality
;
Duality theorem
;
f function
;
nontermination
;
Optimization
;
Optimization techniques
;
Program processors
;
Software algorithms
;
SSA program
;
strong control closure
;
Technological innovation
;
weak control closure
É parte de:
IEEE transactions on software engineering, 2023-04, Vol.49 (4), p.1766-1781
Descrição:
Control dependency (CD) and Static Single Assignment (SSA) form are the basis of many program analyses, transformation, and optimization techniques, and these are implemented and used by modern compilers such as GCC and LLVM. Most state-of-the-art algorithms approximate these computations by using postdominator relations and dominance frontiers (DF) respectively for efficiency reasons which have been used for over three decades. Dominator-based SSA transformation and control dependencies exhibit a non-dual relationship. Recently, it has been shown that DF-based SSA computation is grossly imprecise, and Weak and Strong Control Closure (WCC and SCC) have wider applicability in capturing control dependencies than postdominator-based CD computation. Our main contribution in this article is the proof of duality between the generation of <inline-formula><tex-math notation="LaTeX">\phi</tex-math> <mml:math><mml:mi>ϕ</mml:mi></mml:math><inline-graphic xlink:href="masud-ieq1-3192249.gif"/> </inline-formula> functions and the computation of weakly deciding (WD) vertices which are the most computationally expensive part of SSA program construction and WCC/SCC computation respectively. We have provided a duality theorem and its constructive proof by means of an algorithm that can compute both the <inline-formula><tex-math notation="LaTeX">\phi</tex-math> <mml:math><mml:mi>ϕ</mml:mi></mml:math><inline-graphic xlink:href="masud-ieq2-3192249.gif"/> </inline-formula> functions and the WD vertices seamlessly. We have used this algorithm to compute SSA programs and WCC, and performed experiments on real-world industrial benchmarks. The practical efficiency of our algorithm is (i) almost equal to the best state-of-the-art algorithm in computing WCC, and (ii) closer to (but not as efficient as) the DF-based algorithms in computing SSA programs. Moreover, our algorithm achieves the ultimate precision in computing WCC and SSA programs with respect to the inputs of these algorithms and obtains wider applicability in the WCC computation (handling nonterminating programs).
Editor:
New York: IEEE
Idioma:
Inglês
Links
View record from Swedish Publication Index
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
Anterior
Resultado
7
Avançar
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript