3 citations · 4 across the 5 of their papers we have counts for
5 papers
Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
Antonina Nepeivoda, Ilya Afanasyev
We introduce a string-interval abstract domain, where string intervals are characterized by systems of word equations (encoding lower bounds on string values) and word disequalitie…
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…
On Solving Word Equations via Program Transformation
Antonina Nepeivoda
The paper presents an experiment of solving word equations via specialization of a configuration WE(R,E), where the program WE can be considered as an interpreter testing whether a…
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…
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…