Ping-Pong Protocols as Prefix Grammars and Turchin Relation. - Antonina Nepeivoda (VPT@CAV, 2013)

Verification of Multi-Party Ping-Pong Protocols via Program Transformation. - Antonina Nepeivoda (VPT@CAV, 2014)

Turchin's Relation and Subsequence Relation in Loop Approximation. - Antonina Nepeivoda (Ershov Memorial Conference (Posters), 2014)

Turchin's Relation for Call-by-Name Computations: A Formal Approach. - Antonina Nepeivoda (VPT@ETAPS, 2016)

Ping-pong protocols as prefix grammars: Modelling and verification via program transformation. - Antonina Nepeivoda (J. Log. Algebraic Methods Program., 2016)

Supercompiling String Programs Using Word Equations as Constraints. - Antonina Nepeivoda (CoRR, 2018)

Program Specialization as a Tool for Solving Word Equations. - Antonina Nepeivoda (VPT@ETAPS, 2021)

Word Equations as Abstract Domain for String Manipulating Programs. - Antonina Nepeivoda (FMCAD, 2024)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version). - Antonina Nepeivoda; Ilya Afanasyev 001 (CoRR, 2025)