Eugene W. Stark

According to our database, Eugene W. Stark authored at least 34 papers between 1982 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

Residuated Transition Systems.

Eugene W. Stark

Arch. Formal Proofs, 2022

2020

Bicategories.

Eugene W. Stark

Arch. Formal Proofs, 2020

2017

Monoidal Categories.

Eugene W. Stark

Arch. Formal Proofs, 2017

2016

Category Theory with Adjunctions and Limits.

Eugene W. Stark

Arch. Formal Proofs, 2016

2006

Probabilistic I/O Automata: Theories of Two Equivalences.

Eugene W. Stark, Rance Cleaveland, Scott A. Smolka

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2004

Formally specifying CARA in Java.

Eugene W. Stark

Int. J. Softw. Tools Technol. Transf., 2004

2003

On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation.

Eugene W. Stark

J. Autom. Lang. Comb., 2003

The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems.

Dezhuang Zhang, Rance Cleaveland, Eugene W. Stark

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

A Process-Algebraic Language for Probabilistic I/O Automata.

Eugene W. Stark, Rance Cleaveland, Scott A. Smolka

Proceedings of the CONCUR 2003, 2003

2000

Compositional Performance Analysis Using Probabilistic I/O Automata.

Eugene W. Stark

Proceedings of the CONCUR 2000, 2000

A complete axiom system for finite-state probabilistic processes.

Eugene W. Stark, Scott A. Smolka

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools.

Yifei Dong, Xiaoqun Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Oleg Sokolsky, Eugene W. Stark, David Scott Warren

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1999

Practical Considerations in Protocol Verification: The E-2C Case Study.

Yifei Dong, Scott A. Smolka, Eugene W. Stark, Stephanie M. White

Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (ICECCS '99), 1999

1998

Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata.

Eugene W. Stark, Scott A. Smolka

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Fibrational Semantics of Dataflow Networks.

Eugene W. Stark

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997

Composition and Behaviors of Probabilistic I/O Automata.

Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark

Theor. Comput. Sci., 1997

1995

An Algebra of Dataflow Networks.

Eugene W. Stark

Fundam. Informaticae, 1995

Operational semantics of a focusing debugger.

Karen L. Bernstein, Eugene W. Stark

Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

Formally Defining Debuggers: A Comparison of Three Approaches.

Karen L. Bernstein, Eugene W. Stark

Proceedings of the Second International Workshop on Automated Debugging, 1995

1992

A Calculus of Dataflow Networks (Extended Abstract)

Eugene W. Stark

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

Dataflow Networks are Fibrations.

Eugene W. Stark

Proceedings of the Category Theory and Computer Science, 1991

1990

On the Relations Computable by a Class of Concurrent Automata.

Eugene W. Stark

Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

Stability and Sequentiality in Dataflow Networks.

Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

A Proof of the Kahn Principle for Input/Output Automata

Nancy A. Lynch, Eugene W. Stark

Inf. Comput., July, 1989

Concurrent Transition Systems.

Eugene W. Stark

Theor. Comput. Sci., 1989

Connections between a Concrete and an Abstract Model of Concurrent Systems.

Eugene W. Stark

Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

Compostional Relational Semantics for Indeterminate Dataflow Networks.

Eugene W. Stark

Proceedings of the Category Theory and Computer Science, 1989

1988

Proving Entailment Between Conceptual State Specifications.

Eugene W. Stark

Theor. Comput. Sci., 1988

Fully Distributed, AND/OR-Parallel Execution of Logic Problems.

Prabhakaran Raman, Eugene W. Stark

Proceedings of the Logic Programming, 1988

Computations, Residuals, and the POwer of Indeterminancy.

Prakash Panangaden, Eugene W. Stark

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

Concurrent Transition System Semantics of Process Networks.

Eugene W. Stark

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

1986

Reaching approximate agreement in the presence of faults.

Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl

J. ACM, 1986

1985

A Proof Technique for Rely/Guarantee Properties.

Eugene W. Stark

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

1982

Semaphore primitives and starvation-free mutual exclusion.

Eugene W. Stark

J. ACM, 1982