Reverse Template Processing using Abstract Interpretation
summary
A reverse-template engine converts templates into an ambiguous parser and an abstract semantics that returns all input databases that can produce a given output; it targets non‑injective, affine and erasing templates and proves soundness while giving up completeness. Key techniques are abstract interpretation, custom abstract domains with an intersection operation, and a forward completeness design that avoids fixpoints by ignoring non‑output elements in sequences. Implemented on industrial aeronautics templates, it recovers every template‑mentioned field precisely and performs efficiently thanks to abundant constant text.
AI-written summary · about
chapters (15)
- 0:00Reverse template processing intro
- 2:25Reverse template processing goals
- 3:49Motivations and applications
- 5:13Why exact reverse is hard
- 7:01Abstract interpretation for finite abstractions
- 9:33Parsing and abstract evaluation trees
- 11:28Constraint propagation and unification
- 13:14Abstract database representation
- 14:18Handling infinite sequences
- 15:52Precision loss and matching
- 17:16Industrial case study
- 18:44Performance and backtracking
- 20:29Formalization and theory
- 21:54Summary of contributions
- 22:16Q&A
