Antonina Nepeivoda

According to our database, Antonina Nepeivoda authored at least 9 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2025

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version).

Antonina Nepeivoda, Ilya Afanasyev

CoRR, October, 2025

2024

Word Equations as Abstract Domain for String Manipulating Programs.

Antonina Nepeivoda

Proceedings of the Formal Methods in Computer-Aided Design, 2024

2021

Program Specialization as a Tool for Solving Word Equations.

Antonina Nepeivoda

Proceedings of the 9th International Workshop on Verification and Program Transformation, 2021

2018

Supercompiling String Programs Using Word Equations as Constraints.

Antonina Nepeivoda

CoRR, 2018

2016

Ping-pong protocols as prefix grammars: Modelling and verification via program transformation.

Antonina Nepeivoda

J. Log. Algebraic Methods Program., 2016

Turchin's Relation for Call-by-Name Computations: A Formal Approach.

Antonina Nepeivoda

Proceedings of the Fourth International Workshop on Verification and Program Transformation, 2016

2014

Turchin's Relation and Subsequence Relation in Loop Approximation.

Antonina Nepeivoda

Proceedings of the PSI 2014. Ershov Informatics Conference, 2014

Verification of Multi-Party Ping-Pong Protocols via Program Transformation.

Antonina Nepeivoda

Proceedings of the VPT 2014. Second International Workshop on Verification and Program Transformation, 2014

2013

Ping-Pong Protocols as Prefix Grammars and Turchin Relation.

Antonina Nepeivoda

Proceedings of the First International Workshop on Verification and Program Transformation, 2013