paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Refinement Types for Visualization

面向可视化的精化类型
ASE Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering2024匹配度 2/10 · 该论文属于类型系统与程序合成方向,使用精化类型和双向类型检查加速可视化合成,但未涉及用户核心关注的 ML/Agent 静态分析、LLM 与静态分析/形式化验证交叉、浮点程序分析或贝叶斯程序分析。引用 2 inbox
Jingtao Xia, Junrui Liu, Nicholas Brown, Yanju Chen, Yu Feng
crossref: 2026-09-12

AI 速览

一句话:提出基于精化类型的可视化合成范式,并用轻量级双向类型检查剪枝,显著加速生成数据变换与可视化程序。

可视化在数据探索、验证与分享洞察中至关重要。本文提出基于精化类型的可视化合成新范式:除输入输出示例外,用户可用精化类型注解约束示例可视化中的有效值范围,或表达不同可视化组件间的复杂交互。系统输出同时包含数据变换程序和可视化程序,且保证符合精化类型规约。为缓解合成过程的可扩展性挑战,作者引入一种利用轻量级双向类型检查来剪枝搜索空间的合成算法。实验表明,与先前工作相比,该算法带来显著加速。

问题
在可视化合成中,如何利用精化类型作为可选规约,约束示例可视化中的值范围以及不同可视化组件间的复杂交互,并合成满足规约的数据变换与可视化程序。
方法
提出基于精化类型的可视化合成范式,并设计一种使用轻量级双向类型检查剪枝搜索空间的合成算法,同时生成数据变换与可视化程序。
评估
通过实验评估该合成算法,并与先前工作对比,结果显示其带来显著的速度提升。
原文摘要(Abstract)

Visualizations have become crucial in the contemporary data-driven world as they aid in exploring, verifying, and sharing insights obtained from data. In this paper, we propose a new paradigm of visualization synthesis based on refinement types. Besides input-output examples, users can optionally use refinement-type annotations to constrain the range of valid values in the example visualization or to express complex interactions between different visual components. Our system's outputs include both data transformation and visualization programs that are consistent with refinement-type specifications. To mitigate the scalability challenge during the synthesis process, we introduce a new visualization synthesis algorithm that uses lightweight bidirectional type checking to prune the search space. As we demonstrate experimentally, this new synthesis algorithm results in significant speed-up compared to prior work.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot8372,
  title = {Refinement Types for Visualization},
  author = {Jingtao Xia and Junrui Liu and Nicholas Brown and Yanju Chen and Yu Feng},
  booktitle = {ASE},
  year = {2024},
  doi = {10.1145/3691620.3695550}
}