Eugene Stark's research interests have traditionally been in the general area of programming language theory, having to do particularly with programming language semantics and concurrency theory. He has also worked on specification and verification of distributed algorithms, and has been interested in functional programming languages. He has had an interest in operating systems going back to working on Unix in the 1970's, but has only a couple of published papers in that area. Since about 2016 he has worked on formalized mathematics using the Isabelle/HOL proof assistant. His work on that topic can mostly be found in the Archive of Formal Proofs.

• List of Eugene Stark's papers and technical reports