The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eugene W. Stark: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eugene W. Stark
    Semaphore primitives and starvation-free mutual exclusion. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1982, v:29, n:4, pp:1049-1072 [Journal]
  2. Karen L. Bernstein, Eugene W. Stark
    Formally Defining Debuggers: A Comparison of Three Approaches. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 1995, pp:261-275 [Conf]
  3. Eugene W. Stark
    Compositional Performance Analysis Using Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:25-28 [Conf]
  4. Eugene W. Stark
    Fibrational Semantics of Dataflow Networks. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:597-612 [Conf]
  5. Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
    A Process-Algebraic Language for Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:189-203 [Conf]
  6. Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
    Probabilistic I/O Automata: Theories of Two Equivalences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:343-357 [Conf]
  7. Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
    Composition and Behaviors of Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1994, pp:513-528 [Conf]
  8. Eugene W. Stark
    Compostional Relational Semantics for Indeterminate Dataflow Networks. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1989, pp:52-74 [Conf]
  9. Eugene W. Stark
    Dataflow Networks are Fibrations. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1991, pp:261-281 [Conf]
  10. Eugene W. Stark
    Proving Entailment Between Conceptual State Specifications. [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:197-209 [Conf]
  11. Eugene W. Stark
    A Proof Technique for Rely/Guarantee Properties. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:369-391 [Conf]
  12. Prakash Panangaden, Eugene W. Stark
    Computations, Residuals, and the POwer of Indeterminancy. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:439-454 [Conf]
  13. Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark
    Stability and Sequentiality in Dataflow Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:308-321 [Conf]
  14. Yifei Dong, Scott A. Smolka, Eugene W. Stark, Stephanie M. White
    Practical Considerations in Protocol Verification: The E-2C Case Study. [Citation Graph (0, 0)][DBLP]
    ICECCS, 1999, pp:153-0 [Conf]
  15. Prabhakaran Raman, Eugene W. Stark
    Fully Distributed, AND/OR-Parallel Execution of Logic Problems. [Citation Graph (0, 0)][DBLP]
    ICLP/SLP, 1988, pp:1188-1203 [Conf]
  16. Eugene W. Stark
    A Calculus of Dataflow Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:125-136 [Conf]
  17. Eugene W. Stark, Scott A. Smolka
    Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:466-477 [Conf]
  18. Eugene W. Stark
    Connections between a Concrete and an Abstract Model of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1989, pp:53-79 [Conf]
  19. Eugene W. Stark
    Concurrent Transition System Semantics of Process Networks. [Citation Graph (0, 0)][DBLP]
    POPL, 1987, pp:199-210 [Conf]
  20. Eugene W. Stark
    On the Relations Computable by a Class of Concurrent Automata. [Citation Graph (0, 0)][DBLP]
    POPL, 1990, pp:329-340 [Conf]
  21. Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl
    Reaching Approximate Agreement in the Presence of Faults. [Citation Graph (0, 0)][DBLP]
    Symposium on Reliability in Distributed Software and Database Systems, 1983, pp:145-154 [Conf]
  22. Yifei Dong, Xiaoqun Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Oleg Sokolsky, Eugene W. Stark, David Scott Warren
    Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools. [Citation Graph (0, 0)][DBLP]
    TACAS, 1999, pp:74-88 [Conf]
  23. Dezhuang Zhang, Rance Cleaveland, Eugene W. Stark
    The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:431-436 [Conf]
  24. Karen L. Bernstein, Eugene W. Stark
    Operational semantics of a focusing debugger. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:1, n:, pp:- [Journal]
  25. Eugene W. Stark
    An Algebra of Dataflow Networks. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:1/2, pp:167-185 [Journal]
  26. Nancy A. Lynch, Eugene W. Stark
    A Proof of the Kahn Principle for Input/Output Automata [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:1, pp:81-92 [Journal]
  27. Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl
    Reaching approximate agreement in the presence of faults. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:3, pp:499-516 [Journal]
  28. Eugene W. Stark
    On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:2, pp:361-395 [Journal]
  29. Eugene W. Stark
    Formally specifying CARA in Java. [Citation Graph (0, 0)][DBLP]
    STTT, 2004, v:5, n:4, pp:331-350 [Journal]
  30. Eugene W. Stark
    Proving Entailment Between Conceptual State Specifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:135-154 [Journal]
  31. Eugene W. Stark
    Concurrent Transition Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:3, pp:221-269 [Journal]
  32. Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
    Composition and Behaviors of Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:176, n:1-2, pp:1-38 [Journal]

  33. A complete axiom system for finite-state probabilistic processes. [Citation Graph (, )][DBLP]


Search in 0.214secs, Finished in 0.215secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002