Eugene W. Stark

40 papers A* 6A 3B 8Journal 16Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	'Sets' Revisited: Working with a Large Category in Isabelle/HOL. Arch. Formal Proofs Eugene W. Stark
2024	J	`jnl`	Enriched Category Basics. Arch. Formal Proofs Eugene W. Stark
2024	J	`jnl`	Residuated Transition Systems II: Categorical Properties. Arch. Formal Proofs Eugene W. Stark
2022	J	`jnl`	Residuated Transition Systems. Arch. Formal Proofs Eugene W. Stark
2020	J	`jnl`	Bicategories. Arch. Formal Proofs Eugene W. Stark
2017	J	`jnl`	Monoidal Categories. Arch. Formal Proofs Eugene W. Stark
2016	J	`jnl`	Category Theory with Adjunctions and Limits. Arch. Formal Proofs Eugene W. Stark
2006	B	`conf`	Probabilistic I/O Automata: Theories of Two Equivalences. CONCUR Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
2004	J	`jnl`	Formally specifying CARA in Java. Int. J. Softw. Tools Technol. Transf. Eugene W. Stark
2003	B	`conf`	A Process-Algebraic Language for Probabilistic I/O Automata. CONCUR Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
2003	J	`jnl`	On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation. J. Autom. Lang. Comb. Eugene W. Stark
2003	A	`conf`	The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems. TACAS Dezhuang Zhang, Rance Cleaveland, Eugene W. Stark
2000	—	`conf`	A complete axiom system for finite-state probabilistic processes. Proof, Language, and Interaction Eugene W. Stark, Scott A. Smolka
2000	B	`conf`	Compositional Performance Analysis Using Probabilistic I/O Automata. CONCUR Eugene W. Stark
1999	A	`conf`	Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools. TACAS Yifei Dong, Xiaoqun Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Oleg Sokolsky, Eugene W. Stark, David Scott Warren
1999	B	`conf`	Practical Considerations in Protocol Verification: The E-2C Case Study. ICECCS Yifei Dong, Scott A. Smolka, Eugene W. Stark, Stephanie M. White
1998	A*	`conf`	Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata. LICS Eugene W. Stark, Scott A. Smolka
1998	B	`conf`	Fibrational Semantics of Dataflow Networks. CONCUR Eugene W. Stark
1997	J	`jnl`	Composition and Behaviors of Probabilistic I/O Automata. Theor. Comput. Sci. Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
1995	J	`jnl`	An Algebra of Dataflow Networks. Fundam. Informaticae Eugene W. Stark
1995	—	`conf`	Formally Defining Debuggers: A Comparison of Three Approaches. AADEBUG Karen L. Bernstein, Eugene W. Stark
1995	B	`conf`	Operational semantics of a focusing debugger. MFPS Karen L. Bernstein, Eugene W. Stark
1994	B	`conf`	Composition and Behaviors of Probabilistic I/O Automata. CONCUR Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
1992	A*	`conf`	A Calculus of Dataflow Networks (Extended Abstract) LICS Eugene W. Stark
1991	—	`conf`	Dataflow Networks are Fibrations. Category Theory and Computer Science Eugene W. Stark
1990	A*	`conf`	On the Relations Computable by a Class of Concurrent Automata. POPL Eugene W. Stark
1990	A*	`conf`	Stability and Sequentiality in Dataflow Networks. ICALP Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark
1989	J	`jnl`	A Proof of the Kahn Principle for Input/Output Automata Inf. Comput. Nancy A. Lynch, Eugene W. Stark
1989	—	`conf`	Compostional Relational Semantics for Indeterminate Dataflow Networks. Category Theory and Computer Science Eugene W. Stark
1989	J	`jnl`	Concurrent Transition Systems. Theor. Comput. Sci. Eugene W. Stark
1989	B	`conf`	Connections between a Concrete and an Abstract Model of Concurrent Systems. Mathematical Foundations of Programming Semantics Eugene W. Stark
1988	A*	`conf`	Computations, Residuals, and the POwer of Indeterminancy. ICALP Prakash Panangaden, Eugene W. Stark
1988	—	`conf`	Fully Distributed, AND/OR-Parallel Execution of Logic Problems. ICLP/SLP Prabhakaran Raman, Eugene W. Stark
1988	J	`jnl`	Proving Entailment Between Conceptual State Specifications. Theor. Comput. Sci. Eugene W. Stark
1987	A*	`conf`	Concurrent Transition System Semantics of Process Networks. POPL Eugene W. Stark
1986	A	`conf`	Proving Entailment Between Conceptual State Specifications. ESOP Eugene W. Stark
1986	J	`jnl`	Reaching approximate agreement in the presence of faults. J. ACM Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl
1985	—	`conf`	A Proof Technique for Rely/Guarantee Properties. FSTTCS Eugene W. Stark
1983	—	`conf`	Reaching Approximate Agreement in the Presence of Faults. Symposium on Reliability in Distributed Software and Database Systems Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl
1982	J	`jnl`	Semaphore primitives and starvation-free mutual exclusion. J. ACM Eugene W. Stark