Eugene W. Stark

Rank/Position Title:

Professor

Home Page:

http://www.cs.sunysb.edu/~stark

Date of original appointment to this faculty, followed by dates and ranks of advancement:

• Assistant Professor, 1984
• Associate Professor, 1990
• Professor, 2002

Degrees:

Conferences, workshops, and professional development:

• High-Confidence Embedded Systems review and workshop, held at University of Pennsylvania, May 1-2, 2004.
• CONCUR'03 International Conference on Concurrency Theory, Marseille, France, September 2003.
• TACAS 2003, Tools and Algorithms for the Construction and Analysis of Systems, Warsaw, Poland, April, 2003.
• Microsoft Faculty Summit, Redmond, Washington, July 2003.
• "Personalizing a High-Enrollment Class", workshop given by Prof. Tom Liao, SUNY Stony Brook, April 17, 2002.
• "Weighted Automata: Theory and Applications", Dresden University of Technology, March 4-8, 2002.

Other related computing experience:

• 1997, Parker-Bertea Corp., Gull Electronic Systems Division, Hauppauge , NY . Taught a ten-week graduate course "Concepts in Computer Science", to engineers wishing to learn more about Computer Science and Software Technology.
• 1994, Long Island Lighting Corp., Hicksville , NY . Taught a thirteen-week course in C programming to a group of primarily COBOL programmers.
• Summer 1989, Visiting Assistant Professor, University of Bordeaux I, Bordeaux , France (1 month).
• Summer 1977, Hardware Designer, Bell Telephone Laboratories, Murray Hill , New Jersey .
• Summer 1976, Programmer, Bell Telephone Laboratories, Murray Hill , New Jersey .
• Summer 1975, Programmer, General Electric Electronics Laboratory, Syracuse , NY .

Department, college, and/or university committee membership:

• Honors College Advisory Committee
• CEAS Committee on Academic Standing and Appeals_

Principal publications of the last five years.

• E. Stark, ``Formally Specifying CARA in Java,'' International Journal on Software Tools for Technology Transfer, 5, 4 (2004), pp.331-350.
• E. Stark, ``On Behavior Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation,'' Journal of Automata, Languages, and Combinatorics, 8 (2003).
• E. Stark, S. Smolka, ``A Complete Axiom System for Finite-State Probabilistic Processes,'' in Gordon Plotkin (ed.), Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, April 2000.
• E. Stark, R. Cleaveland, S. Smolka, ``A Process-Algebraic Language for Probabilistic I/O Automata,'' Proc. CONCUR 03, Marseille, France, September, 2003, Roberto M. Amadio and Denis Lugiez (eds.), Springer LNCS 2761, 2003, pp. 189-203.
• D. Zhang, R. Cleaveland, E. Stark, ``The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems,'' Proceedings of the Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003), Springer LNCS 2619, April, 2003, pp. 431-436.
• ``Compositional Performance Analysis using Probabilistic I/O Automata,'' abstract of invited talk given at CONCUR 2000, Springer LNCS 1877, August 2000, pp. 25-28.
• Y. Dong, S. A. Smolka, E. W. Stark, and S. White, ``Practical Considerations in Protocol Verification: The E-2C Case Study'', Proceedings of the Fifth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS '99), October 1999.
• E. Stark, G. Pemmasani, ``Implementation of a Compositional Performance Analysis Algorithm for Probabilistic I/O Automata,'' Proceedings of 7th International Workshop on Process Algebra and Performance Modeling (PAPM'99), Prensas Universitarias de Zaragoza, Zaragoza, Spain, September, 1999, pp. 3-24.
• Yifei Dong, Xiaoqun Du, Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, Scott A. Smolka, Oleg Sokolsky, Eugene W. Stark and David S. Warren, ``Fighting Livelock in the i-protocol: A Comparative Study of Verification Tools,'' Proceedings of the Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), 1999.

Other scholarly activity: grants, sabbaticals, software development, etc.:

• NSF Grant EIA9818342, "A Cluster-based Network Memory Server", Tzi-cker Chiueh and eight co-PIs, $140,000 from 1999 to 2004.
• ARO Grant DAAD190110003, "An Integrated Environment for Control Software Engineering," W. Rance Cleaveland, Scott A. Smolka, and Eugene W. Stark, co-PIs, $365,000 from Fall 2000 to Fall 2004.
• ARO Grant DAAD 190110019, "Advanced Formal Methods for Reliable Systems Engineering," W. Rance Cleaveland, Scott A. Smolka, and Eugene W. Stark, co-PIs, $408,000 from Fall 2000 to Fall 2004.
• NSF Grant CCR9988155, "Compositional Techniques for Verification and Performance Analysis of Reactive Probabilistic systems, "$248,495 from September 2000, to July 2004.

Scientific, professional, and honor societies of which you are a member:

ACM, Tau Beta Pi, Eta Kappa Nu

Honors and awards:

• Stony Brook Faculty Senate Fellowship: Academy of Teacher/Scholars, 2000-2003.
• 2000 Computer Science Dept. award for Excellence in Undergraduate Teaching.
• 1997 Finalist: Long Island Software Awards

Courses taught this and last academic year term-by-term

Academic advising:

• As a member of the Honors College Advisory Committee, I advise approximately 10-15 undergraduate Honors College students. I meet with these students at least once per semester, and additionally, if necessary.
• I recently supervised the Senior Project of Honors College undergraduate student Melisa Dolabela, who graduated in December, 2003.
• I am currently supervising the Senior Project of Honors College undergraduate student Ahmet Burukan, who will graduate in May, 2005.
• I am currently serving as advisor for one Ph.D. student: Wenxin Song.
• Assigned advisor for 18 undergraduate students during 2004/2005 academic year.

Brief description of major research and scholarly activities:

• Compositional analysis techniques for networks of probabilistic automata.
• Tools for specification and analysis of reactive systems.
• Probabilistic process algebra.
• Implementation of a prototype cluster-based network memory server.