Curriculum vitæ

Contact Information

Email: anton@podkopaev.net
Github: anlun
Homepage: podkopaev.net

Research interests

Software verification, program language semantics, concurrency, weak memory models, functional programming.

Education

• Ph.D. in Computer Science, 2014 – 2018 [thesis, video] (all in Russian)
  • St. Petersburg State University, Russia
  • Thesis title: Operational methods in application to weak memory models
  • Area of study: Programming languages and software verification
• M.Sc. in mathematics and computer science, 2009 – 2014 [thesis, video] (all in Russian)
  • Dept. of Mathematics and Mechanics,
    St. Petersburg State University, Russia
  • GPA 4.85/5.0
  • Thesis title: Polynomial-Time Optimal Pretty-Printing Combinators with Choice
  • Adviser: prof. Dmitri Boulytchev
  • Area of study: Pretty printing and functional programming
• High school degree with specialization in physics and mathematics, 2005 – 2009
  • St. Petersburg Lyceum 239, Russia.

Employment

• Researcher at JetBrains Research, from June 2013.
• Docent at Higher School of Economics, from December 2018.
• Postdoctoral Researcher at MPI-SWS, July 2019 – October 2020.
• Lecturer at St. Petersburg Academic University, 2015 – 2018.
• Middle school teacher at St. Petersburg Lyceum 239, 2009 – 2011.
  • Topic: computer games programming class.

Internships

• MPI-SWS, May–August 2016; January, May, September–October 2017; September–October 2018.
  • Adviser: Viktor Vafeiadis.
  • Topic: Compilation correctness from C/C++11 atomics to hardware memory models.
• IMDEA Software Institute, June to August 2015.
  • Advisers: Ilya Sergey and Aleksandar Nanevski.
  • Topic: An operational semantics for the C/C++11 memory.

Selected publications

1. Bridging the Gap Between Programming Languages and Hardware Weak Memory Models
   A.Podkopaev, O.Lahav, V.Vafeiadis
   In POPL 2019.
2. Promising Compilation to ARMv8 POP
   A.Podkopaev, O.Lahav, V.Vafeiadis
   In ECOOP 2017.
3. Operational Aspects of C/C++ Concurrency
   A.Podkopaev, I.Sergey, A.Nanevski
   arXiv, 2016
4. Polynomial-Time Optimal Pretty-Printing Combinators with Choice
   A.Podkopaev, D.Boulytchev
   Proceedings of 9th International Andrei Ershov Memorial Conference on Perspectives of System Informatics (PSI 2014).

Teaching

• Semantics of Programming Languages, Lecturer
  Spring 2018, Higher School of Economics
• Compilers, Lecturer and Teaching Assistant
  Spring 2018, Computer Science Center
  Spring 2015, 2016, St. Petersburg ITMO University
  Fall 2015, St. Petersburg Academic University
• Software Engineering, Teaching Assistant
  Spring and Fall 2015, St. Petersburg State University

Technical skills

• Programming languages (strong knowledge): Java, Kotlin, Haskell, Racket, C++
• Proof assistants/dependently typed languages: Coq
• Other programming languages: OCaml, Python

Language Skills

• English (fluent)
• Russian (mother tongue)

References