Affiliation:
1. University of Maryland, USA
Abstract
In this functional pearl, we examine the use of definitional interpreters as a basis for abstract interpretation of higher-order programming languages. As it turns out, definitional interpreters, especially those written in monadic style, can provide a nice basis for a wide variety of collecting semantics, abstract interpretations, symbolic executions, and their intermixings.
But the real insight of this story is a replaying of an insight from Reynold's landmark paper,
Definitional Interpreters for Higher-Order Programming Languages
, in which he observes definitional interpreters enable the defined-language to inherit properties of the defining-language. We show the same holds true for definitional
abstract
interpreters. Remarkably, we observe that abstract definitional interpreters can inherit the so-called “pushdown control flow” property, wherein function calls and returns are precisely matched in the abstract semantics, simply by virtue of the function call mechanism of the defining-language.
The first approaches to achieve this property for higher-order languages appeared within the last ten years, and have since been the subject of many papers. These approaches start from a state-machine semantics and uniformly involve significant technical engineering to recover the precision of pushdown control flow. In contrast, starting from a definitional interpreter, the pushdown control flow property is inherent in the meta-language and requires no further technical mechanism to achieve.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Cross-Level Debugging for Static Analysers;Proceedings of the 16th ACM SIGPLAN International Conference on Software Language Engineering;2023-10-23
2. Initializing Global Objects: Time and Order;Proceedings of the ACM on Programming Languages;2023-10-16
3. Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters;Proceedings of the ACM on Programming Languages;2023-08-30
4. Grisette: Symbolic Compilation as a Functional Programming Library;Proceedings of the ACM on Programming Languages;2023-01-09
5. A Sound Definitional Interpreter for a Simply Typed Functional Language;Axioms;2022-12-30