Name
Abstract | ||
|---|---|---|
AbstractProgramming or scripting languages used in real-world systems are seldom designed with a formal semantics in mind from the outset. Therefore, developing well-founded analysis tools for these systems requires reverse-engineering a formal semantics as a first step. This can take months or years of effort. Can we (at least partially) automate this process? Though desirable, automatically reverse-engineering semantics rules from an implementation is very challenging, as found by Krishnamurthi, Lerner and Elberty. In this paper, we highlight that scaling methods with the size of the language is very difficult due to state space explosion, so we propose to learn semantics incrementally. We give a formalisation of Krishnamurthi et al.'s desugaring learning framework in order to clarify the assumptions necessary for an incremental learning algorithm to be feasible. We show that this reformulation allows us to extend the search space and express rules that Krishnamurthi et al. described as challenging, while still retaining feasibility. We evaluate enumerative synthesis as a baseline algorithm, and demonstrate that, with our reformulation of the problem, it is possible to learn correct desugaring rules for the example source and core languages proposed by Krishnamurthi et al., in most cases identical to the intended rules. In addition, with user guidance, our system was able to synthesize rules for desugaring list comprehensions and try/catch/finally constructs. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3485499 | Proceedings of the ACM on Programming Languages |
Keywords | DocType | Volume |
Programming language semantics, testing, enumerative synthesis | Journal | 5 |
Issue | Citations | PageRank |
OOPSLA | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sándor Bartha | 1 | 0 | 0.34 |
| James Cheney | 2 | 0 | 1.01 |
| Vaishak Belle | 3 | 154 | 24.68 |