Eugene Stark is a Professor in the Department of Computer Science at Stony Brook University, affiliated with the College of Engineering and Applied Sciences. His work focuses on theoretical foundations and practical applications in systems and programming languages. Educational Background: He earned his Ph.D. in Computer Science from the Massachusetts Institute of Technology (MIT) in 1984. Research Interests: His primary areas include Operating Systems, Programming Language Semantics, Concurrency Theory, Distributed Algorithms Verification, and Functional Programming Languages. He explores formal methods to ensure correctness and efficiency in complex systems, leveraging category theory for rigorous semantic frameworks. His work often addresses challenges in indeterminate dataflow networks and probabilistic models. Publications Overview: Stark’s recent articles emphasize categorical structures (e.g., residuated transition systems, bicategories) and probabilistic I/O automata. They reflect a trajectory from foundational theory to tool development for concurrent system analysis. Academy of Teaching Scholars award Department Award for Undergraduate Teaching (2000) Advising & Grants: No formal advisees are listed in current records. His research projects include the Probabilistic I/O Automata framework, CARA Infusion Pump specifications, and SAMSON Network Memory Server initiatives. Grants and funding details are not explicitly mentioned. Labs/Teams: He is associated with the Laboratory for 體魯 Institute of (1988), though the lab name’s full English title remains unclear. Collaborations likely extend to interdisciplinary projects involving formal methods and systems engineering.









