3 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.PL2021★ 1 cited
Program Specialization as a Tool for Solving Word Equations
Antonina Nepeivoda
The paper focuses on the automatic generating of the witnesses for the word equation satisfiability problem by means of specializing an interpreter which tests whether a compositio…
cs.LO2018
Supercompiling String Programs Using Word Equations as Constraints
Antonina Nepeivoda
We describe a general parameterized scheme of program and constraint analyses allowing us to specify both the program specialization method known as Turchin's supercompilation and…
cs.PL2016★ 3 cited
Turchin's Relation for Call-by-Name Computations: A Formal Approach
Antonina Nepeivoda
Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on c…