A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal?

14 pages•Published: July 28, 2014

Abstract

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.

Keyphrases: program analysis, program specialization, program transformation, supercompilation, verification

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2014. Second International Workshop on Verification and Program Transformation, vol 28, pages 52-65.

Links:	https://easychair.org/publications/paper/5pd
	https://doi.org/10.29007/cj27

BibTeX entry

@inproceedings{VPT2014:Note_Program_Specialization._What,
  author    = {Alexei Lisitsa and Andrei Nemytykh},
  title     = {A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal?},
  booktitle = {VPT 2014. Second International Workshop on Verification and Program Transformation},
  editor    = {Alexei Lisitsa and Andrei Nemytykh},
  series    = {EPiC Series in Computing},
  volume    = {28},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/5pd},
  doi       = {10.29007/cj27},
  pages     = {52-65},
  year      = {2014}}

Download PDF Open PDF in browser