Adulate
发表于 2025-3-30 11:09:11
Beantwortung der Forschungsfragensed on Featherweight Scala. We evaluate our algorithms on a collection of Scala programs. Our results show that careful handling of complex Scala constructs greatly helps precision and that our most precise analysis generates call graphs with 1.1-3.7 times fewer nodes and 1.5-18.7 times fewer edges than a bytecode-based RTA analysis.
莎草
发表于 2025-3-30 12:57:18
http://reply.papertrans.cn/31/3004/300302/300302_52.png
树胶
发表于 2025-3-30 20:36:12
http://reply.papertrans.cn/31/3004/300302/300302_53.png
foppish
发表于 2025-3-31 00:12:35
http://reply.papertrans.cn/31/3004/300302/300302_54.png
有效
发表于 2025-3-31 03:39:17
http://reply.papertrans.cn/31/3004/300302/300302_55.png
Feature
发表于 2025-3-31 05:08:43
http://reply.papertrans.cn/31/3004/300302/300302_56.png
antidepressant
发表于 2025-3-31 12:58:04
http://reply.papertrans.cn/31/3004/300302/300302_57.png
VAN
发表于 2025-3-31 14:39:55
Constructing Call Graphs of Scala Programssed on Featherweight Scala. We evaluate our algorithms on a collection of Scala programs. Our results show that careful handling of complex Scala constructs greatly helps precision and that our most precise analysis generates call graphs with 1.1-3.7 times fewer nodes and 1.5-18.7 times fewer edges than a bytecode-based RTA analysis.
疲惫的老马
发表于 2025-3-31 19:01:12
Finding Reference-Counting Errors in Python/C Programs with Affine Analysisn Python/C interface code. Pungi transforms Python/C interface code into affine programs with respect to our proposed abstractions of reference counts. Our system performs static analysis on transformed affine programs and reports possible reference counting errors. Our prototype implementation found over 150 errors in a set of Python/C programs.
担心
发表于 2025-4-1 00:42:36
http://reply.papertrans.cn/31/3004/300302/300302_60.png