( en | de | ru )

 

Disambiguation of "Stark, Eugene W."

Author of the publication

copydeleteadd this publication to your clipboard
A Proof Technique for Rely/Guarantee Properties.

. FSTTCS, volume 206 of Lecture Notes in Computer Science, page 369-391. Springer, (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Emil W Stark

Eugene Brand

Eugene Zhang

Eugene Warvariv

Eugene Shalygin

 

Other publications of authors with the same name

Category Theory with Adjunctions and Limits.. Arch. Formal Proofs, (2016)Monoidal Categories.. Arch. Formal Proofs, (2017)Compostional Relational Semantics for Indeterminate Dataflow Networks.. Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science, page 52-74. Springer, (1989)A Process-Algebraic Language for Probabilistic I/O Automata., , and . CONCUR, volume 2761 of Lecture Notes in Computer Science, page 189-203. Springer, (2003)Computations, Residuals, and the POwer of Indeterminancy., and . ICALP, volume 317 of Lecture Notes in Computer Science, page 439-454. Springer, (1988)Stability and Sequentiality in Dataflow Networks., , and . ICALP, volume 443 of Lecture Notes in Computer Science, page 308-321. Springer, (1990)Composition and Behaviors of Probabilistic I/O Automata., , and . Theor. Comput. Sci., 176 (1-2): 1-38 (1997)Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata., and . LICS, page 466-477. IEEE Computer Society, (1998)Operational semantics of a focusing debugger., and . MFPS, volume 1 of Electronic Notes in Theoretical Computer Science, page 13-31. Elsevier, (1995)On the Relations Computable by a Class of Concurrent Automata.. POPL, page 329-340. ACM Press, (1990)