| Title: | A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal? |
| Authors: | Alexei Lisitsa and Andrei Nemytykh |
| Proceedings: | VPT 2014 EasyChair Proceedings |
| Editors: | Alexei Lisitsa and Andrei Nemytykh |
| Keywords: | program specialization, supercompilation, program analysis, program transformation, verification |
| Abstract: | {Regular paper}
The paper presents two examples of non-traditional using of program specialization by Turchin's supercompilation method.
In both cases we are interested in syntactical properties of residual programs produced by supercompilation.
In the first example we apply supercompilation to a program encoding a word equation and as a result we obtain a program representing a graph
describing the solution set of the word equation.
The idea of the second example belongs to Alexandr V. Korlyukov. He considered an interpreter simulating the dynamic of the well known missionaries-cannibals puzzle. Supercompilation of the interpreter allows us to solve the puzzle.
The interpreter may also be seen as an encoding of a non-deterministic protocol. |
| Pages: | 14 |
| Talk: | Jul 17 12:15 |
| Paper: |  |