中文
相关论文

相关论文: Pruning, Pushdown Exception-Flow Analysis

200 篇论文

Statically reasoning in the presence of and about exceptions is challenging: exceptions worsen the well-known mutual recursion between data-flow and control-flow analysis. The recent development of pushdown control-flow analysis for the…

编程语言 · 计算机科学 2013-02-13 Shuying Liang , Matthew Might , Thomas Gilray , David Van Horn

In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection push the boundaries of what we can learn about programs statically. This work illuminates and poses solutions to theoretical and practical…

编程语言 · 计算机科学 2014-06-20 J. Ian Johnson , Ilya Sergey , Christopher Earl , Matthew Might , David Van Horn

Modern programming languages, such as Java and C#, typically provide features that handle exceptions. These features separate error-handling code from regular source code and aim to assist in the practice of software comprehension and…

软件工程 · 计算机科学 2017-08-03 Guilherme B. de Pádua , Weiyi Shang

In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method reduces analysis times and boosts precision by orders…

编程语言 · 计算机科学 2012-07-10 Christopher Earl , Ilya Sergey , Matthew Might , David Van Horn

Combining local exceptions and first class continuations leads to programs with complex control flow, as well as the possibility of expressing powerful constructs such as resumable exceptions. We describe and compare games models for a…

计算机科学中的逻辑 · 计算机科学 2013-09-06 James Laird

Over the past decades, context sensitivity has been considered as one of the most effective ideas for improving the precision of pointer analysis for Java. However, despite great precision benefits, as each method is equivalently cloned and…

编程语言 · 计算机科学 2023-04-25 Wenjie Ma , Shengyuan Yang , Tian Tan , Xiaoxing Ma , Chang Xu , Yue Li

Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites---a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers's recent formulation of…

编程语言 · 计算机科学 2010-07-27 Christopher Earl , Matthew Might , David Van Horn

Traditional control-flow analysis (CFA) for higher-order languages, whether implemented by constraint-solving or abstract interpretation, introduces spurious connections between callers and callees. Two distinct invocations of a function…

编程语言 · 计算机科学 2016-03-23 Thomas Gilray , Steven Lyde , Michael D. Adams , Matthew Might , David Van Horn

A typical points-to analysis such as Andersen's or Steensgaard's may lose precision because it ignores the branching structure of the analyzed program. Moreover, points-to analysis typically focuses on objects only, not considering…

编程语言 · 计算机科学 2025-02-03 David Kozak , Codrut Stancu , Tomáš Vojnar , Christian Wimmer

Modern programming languages, such as Java and C#, typically provide features that handle exceptions. These features separate error-handling code from regular source code and are proven to enhance the practice of software reliability,…

软件工程 · 计算机科学 2017-04-05 Guilherme B. de Pádua , Weiyi Shang

We design a family of program analyses for JavaScript that make no approximation in matching calls with returns, exceptions with handlers, and breaks with labels. We do so by starting from an established reduction semantics for JavaScript…

编程语言 · 计算机科学 2011-12-21 David Van Horn , Matthew Might

Business process models describe the way of working in an organization. Typically, business process models distinguish between the normal flow of work and exceptions to that normal flow. However, they often present an idealized view. This…

软件工程 · 计算机科学 2017-06-27 Remco Dijkman , Geoffrey van IJzendoorn , Oktay Turetken , Meint de Vries

Two sinks drain precision from higher-order flow analyses: (1) merging of argument values upon procedure call and (2) merging of return values upon procedure return. To combat the loss of precision, these two sinks have been addressed…

编程语言 · 计算机科学 2011-11-10 Christopher Earl , Matthew Might , David Van Horn

Reliable numerical computations are central to scientific computing, but the floating-point arithmetic that enables large-scale models is error-prone. Numeric exceptions are a common occurrence and can propagate through code, leading to…

编程语言 · 计算机科学 2024-03-26 Taylor Allred , Xinyi Li , Ashton Wiersdorf , Ben Greenman , Ganesh Gopalakrishnan

Flow-matching models provide a powerful framework for various applications, offering efficient sampling and flexible probability path modeling. These models are characterized by flows with low curvature in learned generative trajectories,…

机器学习 · 计算机科学 2025-01-22 Zibin Wang , Zhiyuan Ouyang , Xiangyun Zhang

The strength of a dynamic language is also its weakness: run-time flexibility comes at the cost of compile-time predictability. Many of the hallmarks of dynamic languages such as closures, continuations, various forms of reflection, and a…

编程语言 · 计算机科学 2014-08-18 J. Ian Johnson , David Van Horn

There exist many techniques for automatically deriving parametric resource (or cost) bounds by analyzing the source code of a program. These techniques work effectively for a large class of programs and language features. However, non-local…

编程语言 · 计算机科学 2026-03-04 Ethan Chu , Yiyang Guo , Jan Hoffmann

Outlier detection (also known as anomaly detection or deviation detection) is a process of detecting data points in which their patterns deviate significantly from others. It is common to have outliers in industry applications, which could…

机器学习 · 计算机科学 2019-11-06 Kasra Babaei , ZhiYuan Chen , Tomas Maul

We present an alternative to reweighting techniques for modifying distributions to account for a desired change in an underlying conditional distribution, as is often needed to correct for mis-modelling in a simulated sample. We employ…

高能物理 - 唯象学 · 物理学 2023-05-01 Malte Algren , Tobias Golling , Manuel Guth , Chris Pollard , John Andrew Raine

Total Flow Analysis (TFA) is a method for conducting the worst-case analysis of time sensitive networks without cyclic dependencies. In networks with cyclic dependencies, Fixed-Point TFA introduces artificial cuts, analyses the resulting…

网络与互联网体系结构 · 计算机科学 2022-05-12 Stéphan Plassart , Jean-Yves Le Boudec
‹ 上一页 1 2 3 10 下一页 ›