Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2006 | |
---|---|---|

33 | EE | Eugene W. Stark, Rance Cleaveland, Scott A. Smolka: Probabilistic I/O Automata: Theories of Two Equivalences. CONCUR 2006: 343-357 |

2004 | ||

32 | EE | Eugene W. Stark: Formally specifying CARA in Java. STTT 5(4): 331-350 (2004) |

2003 | ||

31 | EE | Eugene W. Stark, Rance Cleaveland, Scott A. Smolka: A Process-Algebraic Language for Probabilistic I/O Automata. CONCUR 2003: 189-203 |

30 | EE | Dezhuang Zhang, Rance Cleaveland, Eugene W. Stark: The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems. TACAS 2003: 431-436 |

29 | Eugene W. Stark: On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation. Journal of Automata, Languages and Combinatorics 8(2): 361-395 (2003) | |

2000 | ||

28 | EE | Eugene W. Stark: Compositional Performance Analysis Using Probabilistic I/O Automata. CONCUR 2000: 25-28 |

27 | Eugene W. Stark, Scott A. Smolka: A complete axiom system for finite-state probabilistic processes. Proof, Language, and Interaction 2000: 571-596 | |

1999 | ||

26 | EE | Yifei Dong, Scott A. Smolka, Eugene W. Stark, Stephanie M. White: Practical Considerations in Protocol Verification: The E-2C Case Study. ICECCS 1999: 153- |

25 | EE | 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. TACAS 1999: 74-88 |

1998 | ||

24 | EE | Eugene W. Stark: Fibrational Semantics of Dataflow Networks. CONCUR 1998: 597-612 |

23 | Eugene W. Stark, Scott A. Smolka: Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata. LICS 1998: 466-477 | |

1997 | ||

22 | EE | Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark: Composition and Behaviors of Probabilistic I/O Automata. Theor. Comput. Sci. 176(1-2): 1-38 (1997) |

1995 | ||

21 | Karen L. Bernstein, Eugene W. Stark: Formally Defining Debuggers: A Comparison of Three Approaches. AADEBUG 1995: 261-275 | |

20 | EE | Karen L. Bernstein, Eugene W. Stark: Operational semantics of a focusing debugger. Electr. Notes Theor. Comput. Sci. 1: (1995) |

19 | Eugene W. Stark: An Algebra of Dataflow Networks. Fundam. Inform. 22(1/2): 167-185 (1995) | |

1994 | ||

18 | EE | Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark: Composition and Behaviors of Probabilistic I/O Automata. CONCUR 1994: 513-528 |

1992 | ||

17 | Eugene W. Stark: A Calculus of Dataflow Networks (Extended Abstract) LICS 1992: 125-136 | |

1991 | ||

16 | Eugene W. Stark: Dataflow Networks are Fibrations. Category Theory and Computer Science 1991: 261-281 | |

1990 | ||

15 | EE | Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark: Stability and Sequentiality in Dataflow Networks. ICALP 1990: 308-321 |

14 | Eugene W. Stark: On the Relations Computable by a Class of Concurrent Automata. POPL 1990: 329-340 | |

1989 | ||

13 | Eugene W. Stark: Compostional Relational Semantics for Indeterminate Dataflow Networks. Category Theory and Computer Science 1989: 52-74 | |

12 | EE | Eugene W. Stark: Connections between a Concrete and an Abstract Model of Concurrent Systems. Mathematical Foundations of Programming Semantics 1989: 53-79 |

11 | Nancy A. Lynch, Eugene W. Stark: A Proof of the Kahn Principle for Input/Output Automata Inf. Comput. 82(1): 81-92 (1989) | |

10 | Eugene W. Stark: Concurrent Transition Systems. Theor. Comput. Sci. 64(3): 221-269 (1989) | |

1988 | ||

9 | EE | Prakash Panangaden, Eugene W. Stark: Computations, Residuals, and the POwer of Indeterminancy. ICALP 1988: 439-454 |

8 | Prabhakaran Raman, Eugene W. Stark: Fully Distributed, AND/OR-Parallel Execution of Logic Problems. ICLP/SLP 1988: 1188-1203 | |

7 | Eugene W. Stark: Proving Entailment Between Conceptual State Specifications. Theor. Comput. Sci. 56: 135-154 (1988) | |

1987 | ||

6 | Eugene W. Stark: Concurrent Transition System Semantics of Process Networks. POPL 1987: 199-210 | |

1986 | ||

5 | EE | Eugene W. Stark: Proving Entailment Between Conceptual State Specifications. ESOP 1986: 197-209 |

4 | EE | Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl: Reaching approximate agreement in the presence of faults. J. ACM 33(3): 499-516 (1986) |

1985 | ||

3 | EE | Eugene W. Stark: A Proof Technique for Rely/Guarantee Properties. FSTTCS 1985: 369-391 |

1983 | ||

2 | Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl: Reaching Approximate Agreement in the Presence of Faults. Symposium on Reliability in Distributed Software and Database Systems 1983: 145-154 | |

1982 | ||

1 | EE | Eugene W. Stark: Semaphore primitives and starvation-free mutual exclusion. J. ACM 29(4): 1049-1072 (1982) |

1 | Karen L. Bernstein | [20] [21] |

2 | Rance Cleaveland | [30] [31] [33] |

3 | Danny Dolev | [2] [4] |

4 | Yifei Dong | [25] [26] |

5 | Xiaoqun Du | [25] |

6 | Nancy A. Lynch | [2] [4] [11] |

7 | Prakash Panangaden | [9] [15] |

8 | Shlomit S. Pinter | [2] [4] |

9 | Y. S. Ramakrishna | [25] |

10 | C. R. Ramakrishnan | [25] |

11 | I. V. Ramakrishnan | [25] |

12 | Prabhakaran Raman | [8] |

13 | Vasant Shanbhogue | [15] |

14 | Scott A. Smolka | [18] [22] [23] [25] [26] [27] [31] [33] |

15 | Oleg Sokolsky | [25] |

16 | David Scott Warren | [25] |

17 | William E. Weihl | [2] [4] |

18 | Stephanie M. White | [26] |

19 | Sue-Hwey Wu | [18] [22] |

20 | Dezhuang Zhang | [30] |