Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Qirun Zhang"'
Autor:
Shuo Ding, Qirun Zhang
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:982-1002
Many problems in programming language theory and formal methods are undecidable, so they cannot be solved precisely. Practical techniques for dealing with undecidable problems are often based on decidable approximations. Undecidability implies that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6c535ccbccb6306ad4b9e50edfd6648
https://doi.org/10.1145/3571227
https://doi.org/10.1145/3571227
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:1556-1582
Given an edge-labeled graph, context-free language reachability (CFL-reachability) computes reachable node pairs by deriving new edges and adding them to the graph. The redundancy that limits the scalability of CFL-reachability manifests as redundant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4dcc994511af30bdec512f9ef97775d
https://doi.org/10.1145/3563343
https://doi.org/10.1145/3563343
Publikováno v:
ACM Transactions on Programming Languages & Systems. 2022, Vol. 44 Issue 2, p1-28. 28p.
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:1-29
Dyck-reachability is a fundamental formulation for program analysis, which has been widely used to capture properly-matched-parenthesis program properties such as function calls/returns and field writes/reads. Bidirected Dyck-reachability is a relaxa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d225b3d0b8409f0dc664c31698ff317
https://doi.org/10.1145/3498724
https://doi.org/10.1145/3498724
Publikováno v:
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e5255398c76464572b6f1bd52fdb504
https://doi.org/10.1145/3551349.3556970
https://doi.org/10.1145/3551349.3556970
Autor:
Qirun Zhang
Publikováno v:
Proceedings of the 2022 International Conference on Economics, Smart Finance and Contemporary Trade (ESFCT 2022) ISBN: 9789464630510
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6251ce749b54446e1562931a947815f
https://doi.org/10.2991/978-94-6463-052-7_21
https://doi.org/10.2991/978-94-6463-052-7_21
Autor:
Xuan Liu, Qirun Zhang
Publikováno v:
Management Studies. 9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28c209ab073edf46a65331acc7e02191
https://doi.org/10.17265/2328-2185/2021.04.003
https://doi.org/10.17265/2328-2185/2021.04.003
Type inference for dynamic programming languages such as Python is an important yet challenging task. Static type inference techniques can precisely infer variables with enough static constraints but are unable to handle variables with dynamic featur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ea51bfbdd4554358d33e56720bfe8a4
Publikováno v:
ASE
Programs are becoming increasingly complex and typically contain an abundance of unneeded features, which can degrade the performance and security of the software. Recently, we have witnessed a surge of debloating techniques that aim to create a redu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4ef34252ce614456b7f1172ae740496
https://doi.org/10.1145/3324884.3416644
https://doi.org/10.1145/3324884.3416644
Publikováno v:
ICSE (NIER)
Programs typically provide a broad range of features. Because different typologies of users tend to use only a subset of these features, and unnecessary features can harm performance and security, program debloating techniques, which can reduce the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bd4392cb2fc7ddbf646fa51221ef756
https://doi.org/10.1145/3377816.3381739
https://doi.org/10.1145/3377816.3381739