The Experts below are selected from a list of 366120 Experts worldwide ranked by ideXlab platform
Hong Mei - One of the best experts on this subject based on the ideXlab platform.
-
summary based context sensitive data Dependence Analysis in presence of callbacks
Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
-
POPL - Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
Hao Tang - One of the best experts on this subject based on the ideXlab platform.
-
summary based context sensitive data Dependence Analysis in presence of callbacks
Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
-
POPL - Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
Xiaoyin Wang - One of the best experts on this subject based on the ideXlab platform.
-
summary based context sensitive data Dependence Analysis in presence of callbacks
Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
-
POPL - Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
Lu Zhang - One of the best experts on this subject based on the ideXlab platform.
-
summary based context sensitive data Dependence Analysis in presence of callbacks
Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
-
POPL - Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
Bing Xie - One of the best experts on this subject based on the ideXlab platform.
-
summary based context sensitive data Dependence Analysis in presence of callbacks
Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
-
POPL - Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015Co-Authors: Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, Hong MeiAbstract:Building a summary for library code is a common approach to speeding up the Analysis of client code. In presence of callbacks, some reachability relationships between library nodes cannot be obtained during library-code summarization. Thus, the library code may have to be analyzed again during the Analysis of the client code with the library summary. In this paper, we propose to summarize library code with tree-adjoining-language (TAL) reachability. Compared with the summary built with context-free-language (CFL) reachability, the summary built with TAL reachability further contains conditional reachability relationships. The conditional reachability relationships can lead to much lighter Analysis of the library code during the client code Analysis with the TAL-reachability-based library summary. We also performed an experimental comparison of context-sensitive data-Dependence Analysis with the TAL-reachability-based library summary and context-sensitive data-Dependence Analysis with the CFL-reachability-based library summary using 15 benchmark subjects. Our experimental results demonstrate that the former has an 8X speed-up over the latter on average.
