Set Constraints, Pattern Match Analysis, and SMT

TRENDS IN FUNCTIONAL PROGRAMMING, TFP 2019（2020）

引用 1|浏览0

暂无评分

摘要

Set constraints provide a highly general way to formulate program analyses. However, solving arbitrary boolean combinations of set constraints is \(\mathsf {NEXPTIME}\)-hard. Moreover, while theoretical algorithms to solve arbitrary set constraints exist, they are either too complex to realistically implement or too slow to ever run.

查看译文

关键词

Program analysis,SMT,Pattern-matching,Set constraints

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要