default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugene W. Stark
Person information
- affiliation: Stony Brook University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Eugene W. Stark:
Enriched Category Basics. Arch. Formal Proofs 2024 (2024)- [j14]Eugene W. Stark:
Residuated Transition Systems II: Categorical Properties. Arch. Formal Proofs 2024 (2024) - 2022
- [j13]Eugene W. Stark:
Residuated Transition Systems. Arch. Formal Proofs 2022 (2022) - 2020
- [j12]Eugene W. Stark:
Bicategories. Arch. Formal Proofs 2020 (2020)
2010 – 2019
- 2017
- [j11]Eugene W. Stark:
Monoidal Categories. Arch. Formal Proofs 2017 (2017) - 2016
- [j10]Eugene W. Stark:
Category Theory with Adjunctions and Limits. Arch. Formal Proofs 2016 (2016)
2000 – 2009
- 2006
- [c24]Eugene W. Stark, Rance Cleaveland, Scott A. Smolka:
Probabilistic I/O Automata: Theories of Two Equivalences. CONCUR 2006: 343-357 - 2004
- [j9]Eugene W. Stark:
Formally specifying CARA in Java. Int. J. Softw. Tools Technol. Transf. 5(4): 331-350 (2004) - 2003
- [j8]Eugene W. Stark:
On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation. J. Autom. Lang. Comb. 8(2): 361-395 (2003) - [c23]Eugene W. Stark, Rance Cleaveland, Scott A. Smolka:
A Process-Algebraic Language for Probabilistic I/O Automata. CONCUR 2003: 189-203 - [c22]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 - 2000
- [c21]Eugene W. Stark, Scott A. Smolka:
A complete axiom system for finite-state probabilistic processes. Proof, Language, and Interaction 2000: 571-596 - [c20]Eugene W. Stark:
Compositional Performance Analysis Using Probabilistic I/O Automata. CONCUR 2000: 25-28
1990 – 1999
- 1999
- [c19]Yifei Dong, Scott A. Smolka, Eugene W. Stark, Stephanie M. White:
Practical Considerations in Protocol Verification: The E-2C Case Study. ICECCS 1999: 153- - [c18]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
- [c17]Eugene W. Stark:
Fibrational Semantics of Dataflow Networks. CONCUR 1998: 597-612 - [c16]Eugene W. Stark, Scott A. Smolka:
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata. LICS 1998: 466-477 - 1997
- [j7]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
- [j6]Eugene W. Stark:
An Algebra of Dataflow Networks. Fundam. Informaticae 22(1/2): 167-185 (1995) - [c15]Karen L. Bernstein, Eugene W. Stark:
Formally Defining Debuggers: A Comparison of Three Approaches. AADEBUG 1995: 261-275 - [c14]Karen L. Bernstein, Eugene W. Stark:
Operational semantics of a focusing debugger. MFPS 1995: 13-31 - 1994
- [c13]Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark:
Composition and Behaviors of Probabilistic I/O Automata. CONCUR 1994: 513-528 - 1992
- [c12]Eugene W. Stark:
A Calculus of Dataflow Networks (Extended Abstract). LICS 1992: 125-136 - 1991
- [c11]Eugene W. Stark:
Dataflow Networks are Fibrations. Category Theory and Computer Science 1991: 261-281 - 1990
- [c10]Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark:
Stability and Sequentiality in Dataflow Networks. ICALP 1990: 308-321 - [c9]Eugene W. Stark:
On the Relations Computable by a Class of Concurrent Automata. POPL 1990: 329-340
1980 – 1989
- 1989
- [j5]Nancy A. Lynch, Eugene W. Stark:
A Proof of the Kahn Principle for Input/Output Automata. Inf. Comput. 82(1): 81-92 (1989) - [j4]Eugene W. Stark:
Concurrent Transition Systems. Theor. Comput. Sci. 64(3): 221-269 (1989) - [c8]Eugene W. Stark:
Compostional Relational Semantics for Indeterminate Dataflow Networks. Category Theory and Computer Science 1989: 52-74 - [c7]Eugene W. Stark:
Connections between a Concrete and an Abstract Model of Concurrent Systems. Mathematical Foundations of Programming Semantics 1989: 53-79 - 1988
- [j3]Eugene W. Stark:
Proving Entailment Between Conceptual State Specifications. Theor. Comput. Sci. 56: 135-154 (1988) - [c6]Prakash Panangaden, Eugene W. Stark:
Computations, Residuals, and the POwer of Indeterminancy. ICALP 1988: 439-454 - [c5]Prabhakaran Raman, Eugene W. Stark:
Fully Distributed, AND/OR-Parallel Execution of Logic Problems. ICLP/SLP 1988: 1188-1203 - 1987
- [c4]Eugene W. Stark:
Concurrent Transition System Semantics of Process Networks. POPL 1987: 199-210 - 1986
- [j2]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) - [c3]Eugene W. Stark:
Proving Entailment Between Conceptual State Specifications. ESOP 1986: 197-209 - 1985
- [c2]Eugene W. Stark:
A Proof Technique for Rely/Guarantee Properties. FSTTCS 1985: 369-391 - 1983
- [c1]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
- [j1]Eugene W. Stark:
Semaphore primitives and starvation-free mutual exclusion. J. ACM 29(4): 1049-1072 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 20:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
