Eugene W. Stark
Address:
Telephone:
Birth:
Citizenship:
Dept. of Computer Science, SUNY at Stony Brook,
Stony Brook, NY 11794-4400 USA
(631) 632-8444/8470
July 10, 1959, Tarrytown, NY
USA
Education:
1984
1980
1977
Ph.D. in Computer Science, M.I.T. (thesis supervisor: Prof. N. A. Lynch)
S.M. in Electrical Engineering and Computer Science, M.I.T.
B.E.S. in Electrical Engineering, The Johns Hopkins University
Employment:
20021990-2002
1984-1990
1989
1979-1984
1977
1976
1975
Professor, Department of Computer Science, SUNY at Stony Brook
Associate Professor, Department of Computer Science, SUNY at Stony Brook
Assistant Professor, Department of Computer Science, SUNY at Stony Brook
Visiting Assistant Professor (Maı̂tre de Conférence Invité), University of
Bordeaux I, France (June, 1 mo.)
Research Assistant and Teaching Assistant, M.I.T. Laboratory for Computer
Science
Hardware Designer, Bell Telephone Laboratories, Murray Hill, NJ (summer)
Programmer, Bell Telephone Laboratories, Murray Hill, NJ (summer)
Programmer, General Electric Co. Electronics Laboratory, Syracuse, NY
(summer)
Consulting and
Industrial Interaction:
2003
Intelecom Systems, Inc., Ronkonkoma, NY. Served as an expert witness in
case before American Arbitration Association.
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.
1991
American Software Development Corp., West Babylon, NY. Identified and
implemented performance improvements in a construction project management system using C language, the X window system, and Informix database
system.
Major
Courses Taught:
CSE 113
CSE 219
CSE 230
Foundations of Computer Science (undergraduate level)
Computer Science III – Advanced Programming (undergraduate level)
Introduction to C and Unix (undergraduate level)
1
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
303
304
306
307
506
526
541
551
Grants:
Honors:
Stony Brook:
Introduction to the Theory of Computation (undergraduate level)
Compilers (undergraduate level)
Operating Systems (undergraduate level)
Principles of Programming Languages (undergraduate level)
Operating Systems (graduate level)
Principles of Programming Languages (graduate level)
Theoretical Foundations of Computer Science (graduate level)
Program Semantics and Verification (graduate level)
W. Rance Cleaveland, Scott A. Smolka, and Eugene W. Stark, “An
Integrated Environment for Control Software Engineering,” ARO Grant
DAAD190110003, three years, $365,000, from Fall 2000 to Fall 2004.
W. Rance Cleaveland, Scott A. Smolka, and Eugene W. Stark, “Advanced Formal Methods for Reliable Systems Engineering,” ARO Grant
DAAD190110019, three years, $365,000, from Fall 2000 to Fall 2004.
Eugene W. Stark and Scott A. Smolka, “Compositional Techniques for Verification and Performance Analysis of Reactive Probabilistic Systems,” NSF
Grant CCR-9988155, three-year continuing grant funded at $248,495, from
September 2000 to July 2004.
Eugene W. Stark, “Development of New Course: CSE 219 – Computer Science III,” Award from SUNY Stony Brook University Senate, “Academy of
Teacher/Scholars” program, 3 yr. appt. beginning Fall 2000, $5,000 stipend
plus $5,000 to the CS Department.
Tzi-cker Chiueh, David, S. Warren, I.V. Ramakrishnan, Larry D. Wittie,
Philip M. Lewis, Arie Kaufman, Eugene Stark, C.R. Ramakrishnan, and
Scott A. Smolka, ”A Cluster-based Network Memory Server,” NSF Grant
EIA9818342, $140,000, from 1999 to 2002.
S. Smolka, E. Stark, and S. White, “Compositional Analysis of Expected Delay
in Networks of Automata,” AFOSR Grant F49620-96-1-0087, three year grant
funded at $296,689, from March, 1996 to March, 1999.
E. Stark, “Dataflow Networks: Calculi, Axiomatics, and Algebraic Semantics,”
NSF Grant CCR-9320846, two-year continuing grant funded at $29,996 in 1994
and $29,996 in 1995.
E. Stark, “Relating Transition Structure to Behavior in Models of Process
Networks,” NSF Grant CCR-8902215, two-year grant funded at $112,517 in
1990.
E. Stark, “Concurrent Transition System Models of Process Networks,” NSF
Grant CCR-8702247, two-year continuing grant funded at $50,800 for FY87
and $52,532 for FY88.
A. Zorat, A. Giacalone, J. Hsiang, S. Smolka, M. Srivas, E. Stark, “Acquisition
of LISP Machines,” Equipment Grant funded by NSF for $121,796, June 1,
1985.
Academy of Teacher-Scholars: 2000-2003
2000 Computer Science Dept. award for Excellence in Undergraduate Teaching
Finalist: 1997 Long Island Software Awards
2
MIT:
NSF Graduate Fellow, 1977-1981
Johns Hopkins:
Departmental and General Honors, Tau Beta Pi, Eta Kappa Nu, Hodson
Scholarship
Member:
Assoc. for Computing Machinery (ACM)
Referee Activity:
Have served as a referee for ACM Trans. on Programming Languages and Systems, Acta Informatica, The Computer Journal, Distributed Computing, Formal Aspects of Computing, IBM Journal of Research and Development, Information and Computation, IEEE Transactions on Software Engineering, IEEE
Transactions on Computers, IEEE Transactions on Parallel and Distributed
Systems Information Processing Letters, International Journal of Foundations
of Computer Science, International Journal of Parallel Processing, Journal of
the ACM, Journal of the Automata, Languages, and Combinatorics, Journal
of Computer and System Sciences, Journal of Logic and Computation
SIAM Journal on Computing, and Theoretical Computer Science.
Reviewer for National Science Foundation. Program committee member for
CONCUR ’92, CONCUR ’95, CONCUR ’03, MFPS XV, MFPS XIX, MFPS
XX, ARTS 2004, WDS-Iasi’99. Textbook reviewer for Addison Wesley Longman, Oxford University Press, and Boyd & Fraser.
Seminars and
Invited Lectures:
“Performance Analysis for Probabilistic Input/Output Automata via Linear
Representations,” invited lecture presented at “Weighted Automata: Theory
and Applications,” Dresden, Germany, March, 2002.
“Compositional Performance Analysis using Probabilistic I/O Automata,” invited lecture presented at CONCUR 2000, University Park, PA, August, 2000.
“Composition and Behaviors of Probabilistic I/O Automata,” invited lecture
presented at Department of Mathematics, Technische Universitaet Dresden,
Dresden, Germany, May 13, 1996.
“Bifibrational Semantics of Process Networks,” invited lecture presented at
seminar “Seminar on Concurrency Theory,” International Conference and Research Center for Computer Science, Schloss Dagstuhl, Wadern, Germany,
May, 1996.
“Dataflow Algebra: A Tale of Two Monads,” presented at seminar “Semantics of Programming Languages and Algebra,” International Conference and
Research Center for Computer Science, Schloss Dagstuhl, Wadern, Germany,
June 11, 1993.
“Recent Advances in the Theory of Indeterminate Dataflow Networks,” invited
lecture for International Symposium on Lucid and Intensional Programming,
Kingston, Ontario, May, 1990.
“Some Algebraic Structures Related to Trace Theory and Concurrency,” presented at University of Bordeaux I, France, June 8, 1989.
“Compositional Relational Semantics for Indeterminate Dataflow Networks,”
presented at Oxford University, U.K., May 30, 1989.
3
“On the Relations Computed by a Class of Concurrent Automata,” presented
at Cornell University, Ithaca, NY, October 6, 1988.
“The Computation Category of a Concurrent Transition System,” presented
at Centre de Recherche en Informatique de Nancy, Nancy, France, March 21,
1986.
“Concurrent Transition System Semantics of Process Networks,” presented at
Carnegie-Mellon University, Pittsburgh, PA, December 1, 1986.
Graduate
Students:
Publications
In Refereed
Journals:
Eric Bachran (M.S. 1995), Karen Bernstein (DePaul University, Ph.D. 1996),
David Connelly (Sun Microsystems, M.S. 1991), Ho-Keun Kwok (M.S. 1986)
Jawahar Malhotra (Netscape Communications Corp., M.S. 1987), Prabhakaran Raman (M.S. 1988) Sue-Hwey Wu (Taiwan, Ph.D. 1996) Pedro Souto
(University of Porto, Ph.D. 1999), Wenxin Song (Ph.D. exp. 2006)
E. Stark, “Formally Specifying CARA in Java,” International Journal on Software Tool
nology 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,2 (2003), pp. 361–395.
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.
S.-H. Wu, S. Smolka, E. Stark, “Composition and Behaviors of Probabilistic
I/O Automata,” Theoretical Computer Science, 176 (1997), pp. 1-38.
E. Stark, “An Algebra of Dataflow Networks,” Fundamenta Informaticae,
22,1/2,(January/February, 1995), pp. 167-186.
N. A. Lynch, E. Stark, “A Proof of the Kahn Principle for Input/Output
Automata,” Information and Computation, 82, 1 (July, 1989), pp. 81-92.
E. Stark, “Concurrent Transition Systems,” Theoretical Computer Science, 64
(1989), pp. 221-269.
E. Stark, “Proving Entailment Between Conceptual State Specifications,”
Theoretical Computer Science, 56,1 (January, 1988), pp. 135-154.
D. Dolev, N. Lynch, S. Pinter, E. Stark, W. Weihl, “Reaching Approximate
Agreement in the Presence of Faults,” Journal of the Association for Computing Machinery, 33,3 (July, 1986) pp. 499-516.
4
Stark, E.W., “Semaphore Primitives and Starvation-Free Mutual Exclusion,”
Journal of the Association for Computing Machinery 29, 4 (Oct. 1982), pp.
1049-1072.
In Refereed
Conferences:
E. Stark, R. Cleaveland, S. Smolka, “A Process-Algebraic Language for Probabilistic I/O Automata,” Proc. CONCUR 03, Marseille, France, September,
2003 SPRINGER LNCS 2761, September, 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.
E. Stark, “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 Modelling
(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.
E. Stark, “Fibrational Semantics of Dataflow Networks,” Proc. CONCUR 98,
Nice, France, Springer LNCS 1466, September, 1998, pp. 597-612.
E. Stark, S. Smolka, “Compositional Analysis of Expected Delays in Networks
of Probabilistic I/O Automata,” Proc. 13th Annual Symposium on Logic in
Computer Science, Indianapolis, IN, June 1998, pp. 466-477.
P. Souto, E. Stark, “A Distributed Shared Memory Facility for FreeBSD,”
Proc. 1997 Usenix Technical Conference, Anaheim, CA, January 1997,
pp. 149-162.
5
K. Bernstein, E. Stark, “Operational Semantics of a Focusing Debugger,”
Proc. 11th Conference on Mathematical Foundations of Programming Semantics, New Orleans, LA, March, 1995, pp. 21-40.
K. Bernstein, E. Stark, “On Formally Defining Debuggers,” 2nd International
Workshop on Automated and Algorithmic Debugging, St. Malo, France, May,
1995.
S.-H. Wu, S. Smolka, E. Stark, “Composition and Behaviors of Probabilistic
I/O Automata,” Proc. CONCUR 94, B. Jonsson and J. Parrow, eds., Springer
LNCS 836, August, 1994, pp. 513-528.
E. Stark, “A Calculus of Dataflow Networks,” Proc. Seventh Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, June,
1992, pp. 125-136.
E. Stark, “Dataflow Networks are Fibrations,” Proc. Summer Conference on
Category Theory and Computer Science, Springer LNCS 530, pp. 261-281,
September, 1991.
E. Stark, “A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks (Extended Abstract),” Proceedings of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, U.K.,
Springer-Verlag, pp. 157-174, July, 1990.
P. Panangaden, V. Shanbhogue, E. Stark, “Stability and Sequentiality in
Dataflow Networks,” Proceedings of the 1990 International Conference on Automata, Languages, and Programming, Warwick, U.K., Springer LNCS 443,
pp. 308-321, July, 1990.
E. Stark, “On the Relations Computed by a Class of Concurrent Automata,”
Proceedings of the 1990 SIGACT-SIGPLAN Symposium on Principles of Programming Languages, January, 1990.
E. Stark, “Compositional Relational Semantics for Indeterminate Dataflow
Networks,” Proceedings of Summer Conference on Category Theory and Computer Science, Manchester, U.K., September, 1989, Springer LNCS 389,
pp. 52-74.
E. Stark, “Connections Between a Concrete and an Abstract Model of Concurrent Systems,” Proceedings of Fifth Conference on Mathematical Foundations of Program Semantics, New Orleans, LA, Springer LNCS 442, pp. 53-79,
March, 1989.
P. Raman, E. Stark, “Fully Distributed, AND/OR Parallel Execution of Logic
Programs (extended abstract),” Proceedings of Fifth International Logic Programming Conference, Seattle, WA, August, 1988.
6
P. Panangaden, E. Stark, “Computations, Residuals, and the Power of Indeterminacy,” Proceedings of the 1988 International Conference on Automata,
Languages, and Programming, Springer LNCS 317, pp. 439-454, July, 1988.
E. Stark, “Concurrent Transition System Semantics of Process Networks,”
Proceedings of the 1987 SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 199-210, January, 1987.
E. Stark, “Proving Entailment Between Conceptual State Specifications,” Proceedings of the 1986 European Symposium on Programming, Saarbrücken,
West Germany, March 17-19, 1986, Springer LNCS 213, pp. 197-209.
E. Stark, “A Proof Technique for Rely/Guarantee Properties,” Proceedings of
the Fifth Conference on Foundations of Software Technology and Theoretical
Computer Science, New Delhi, India, December 16-18, 1985, Springer LNCS
206, pp. 369-391.
D. Dolev, N. Lynch, S. Pinter, E. Stark, W. Weihl, “Reaching Approximate
Agreement in the Presence of Faults,” Proceedings of 3rd Annual IEEE Symposium on Reliability in Distributed Software and Database Systems, Clearwater,
FL, October, 1983, pp. 145-154.
Unpublished
Technical Reports: E. Stark, W. Song, “Linear Decision Diagrams,” SUNY at Stony Brook,
Dept. of Computer Science, 2004.
E. Stark, “Compositional Calculation of Steady-State Probabilities,” SUNY
at Stony Brook, Dept. of Computer Science, 2003.
K. Bernstein, E. Stark, “Debugging Type Errors (full version),”
http://bsd7.cs.sunysb.edu/ stark/REPORTS/debugtype.ps.gz, November, 1995.
K. Bernstein, E. Stark, “A Programming Environment for Debugging Type
Errors,” SUNY at Stony Brook, Dept. of Computer Science, 1996.
Stark, E.W., “Foundations of a Theory of Specification for Distributed
Systems,” M.I.T. Laboratory for Computer Science Technical Report
MIT/LCS/TR-342, August, 1984.
7