“A little disappointing to see the links to his favourite paper going to paywalls. Here are arxiv/free links: 39 page JFP version: http://arxiv.org/pdf/1107.3539v1.pdf 12 pager from ICFP: http://arxiv.org/pdf/1007.4446.pdf 8 page CACM highlight: http://www.ccs.neu.edu/home/dvanhorn/pubs/vanhorn-might-cacm11.pdf”
Abstracting Abstract Machines
We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine's machine, and the stack-inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack-inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“This was posted once before by HN user 'ingve' but didn't get much attention [1]. Though the most recent and largest (39 pages) JFP paper, "Systematic Abstraction of Abstract Machines", is probably the best version to read, the earlier "Abstracting Abstract Machines" may also be helpful. There's also a CACM highlight version of "Abstracting Abstract Machi…”