Technical Reports by Eugene W. Stark

(NOTE: Access to full versions of papers currently submitted for publication may be limited to people at SUNY Stony Brook.)

I have viewable electronic versions of all my papers since I began preparing them in TeX in late 1984. I have sources to some of my pre-1984 papers, but in that period I used the "R" typesetting program, so those papers are probably no longer compilable or viewable. I have tried to include in the list the "final" version of each listed paper. Every so often I make an attempt to collect earlier versions (for example conference publications that were later superseded by journal versions) and add them to the list below.

• Residuated Transition Systems
  (March 6, 2022, Archive of Formal Proofs)
  • View online at www.isa-afp.org.
  • View BibTeX entry.

• Bicategories
  (January 6, 2020, Archive of Formal Proofs)
  • View online at www.isa-afp.org.
  • View BibTeX entry.

• Monoidal Categories
  (May 4, 2017, Archive of Formal Proofs)
  • View online at www.isa-afp.org.
  • View BibTeX entry.

• Category Theory with Adjunctions and Limits
  (June 26, 2016, Archive of Formal Proofs)
  • View online at www.isa-afp.org.
  • View BibTeX entry.

• An Efficient Representation for Large Arrays of Rational Expressions
  (October 1, 2010, unpublished)
  • View abstract.
  • View BibTeX entry.
  • Read report

• A Cartesian Bicategory of Nondeterministic Arrows betweeen Domains
  (February 6, 2010, unpublished)
  • View abstract.
  • View BibTeX entry.
  • Read report

• A BDD Representation for Positive Equational Formulas
  (July 2, 2008, unpublished)
  • View abstract.
  • View BibTeX entry.
  • Read report (PDF).

• Probabilistic I/O Automata: Theories of Two Equivalences
  (June 8, 2006, Proc. CONCUR'06)
  • View abstract.
  • View BibTeX entry.
  • Read report (PDF, June 8, 2006, unpublished full version with proofs.)

• Linear Decision Diagrams
  (April 1, 2004, unpublished)
  • View abstract.
  • View BibTeX entry.
  • Read report (PDF).

• Compositional Calculation of Steady-State Probabilities
  (January 19, 2003, unpublished)
  • View abstract.
  • View BibTeX entry.
  • Read report (Postscript version).

• The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems
  (January 17, 2003, Proc. TACAS'03)
  • View abstract.
  • View BibTeX entry.
  • Read report (Postscript version).

• A Process-Algebraic Language for Probabilistic I/O Automata
  (September, 2003, Proc. CONCUR'03)
  • View abstract.
  • View BibTeX entry.
  • Read report (PDF).

• On Behavior Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation
  (April 13, 2003, Journal of Automata, Languages and Combinatorics)
  • View abstract.
  • View BibTeX entry.
  • Read report (Postscript version).

• Formally Specifying CARA in Java
  (August 25, 2003, Software Tools for Technology Transfer, 5, 4 (2004), pp. 331-350.)
  • View abstract.
  • View BibTeX entry.
  • Read report (PDF).

• Compositional Performance Analysis using Probabilistic I/O Automata (August, 2000, slides for invited talk given at CONCUR'00)
  • View talk abstract (Postscript version).
  • View talk slides (Postscript version).
  • View BibTeX entry.

• A Complete Axiom System for Finite-State Probabilistic Processes
  (December 19, 1996, in Gordon Plotkin (ed.) Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, April 2000.)
  • View abstract.
  • Read report (Postscript version).
  • Get BibTeX entry.

• Implementation of a Compositional Performance Analysis Algorithm for Probabilistic I/O Automata
  (June 8, 1999, Proc. PAPM99, September, 1999)
  • View abstract.
  • Read report (Postscript version).
  • Get BibTeX entry.

• Fighting Livelock in the i-protocol: A Comparative Study of Verification Tools
  (October 5, 1998, Proc. TACAS'99, 1999)
  • View abstract.
  • Read report (Postscript version).
  • Get BibTeX entry.

• Fibrational Semantics of Dataflow Networks
  (June 4, 1998, Proc. CONCUR'98, September 1998)
  • View abstract.
  • Read report (Postscript version).
  • Get BibTeX entry.

• Compositional Analysis of Expected Delays for Probabilistic I/O Automata
  (December 5, 1997, Proc. LICS'98, June 1998)
  • View abstract.
  • Read report (Postscript, December 5, 1997, unpublished full version with proofs).
  • Read report (Postscript, April 13, 1998, published conference version).
  • Get BibTeX entry.

• A Distributed Shared Memory Facility for FreeBSD
  (December 9, 1996, Proc. Usenix '97, January, 1997)
  • View abstract.
  • Read report (HTML version).
  • Read usenix.org version (HTML version).
  • Read report (Postscript version).
  • Get BibTeX entry.

• Debugging Type Errors (Full version)
  (November 8, 1995)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• On Formally Defining Debuggers
  (2nd International Workshop on Automated and Algorithmic Debugging, May, 1995)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Operational Semantics of a Focusing Debugger (Full version)
  (November 19, 1994, MFPS'95, March, 1995)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Composition and Behaviors of Probabilistic I/O Automata
  (CONCUR'94, TCS 176 1997)
  • View abstract.
  • Read CONCUR'94 conference version (Postscript).
  • Read 1997 TCS journal version (Postscript).
  • Get BibTeX entry.

• An Algebra of Dataflow Networks
  (October, 1993, Fundamenta Informaticae, 22, 1/2, Jan/Feb 1995)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• A Calculus of Dataflow Networks
  (February, 1992, LICS 92, June, 1992)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• A Simple Generalization of Kahn's Principle to Indeterminate Dataflow Networks
  (July, 1990, Semantics for Concurrency, Leicester, 1990, Springer-Verlag)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Dataflow Networks are Fibrations
  (February, 1990, CTCS'91, Springer LNCS 530, September 1991)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Stability and Sequentiality in Dataflow Networks
  (November, 1989, ICALP'90, Springer LNCS 443, 1990)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Connections between a Concrete and an Abstract Model of Concurrent Systems
  (November, 1989, MFPS'89, Springer LNCS 442)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• On the Relations Computable by a Class of Concurrent Automata
  (October, 1989, POPL'90, 1990)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Compositional Relational Semantics for Indeterminate Dataflow Networks
  (May, 1989, CTCS'89, Springer LNCS 389)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• A Proof of the Kahn Principle for Input/Output Automata
  (June, 1988, Information and Computation 82, 1, July 1989)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Computations, Residuals, and the Power of Indeterminacy
  (March, 1988, ICALP'88, Springer LNCS 317)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Fully Distributed, And/Or Parallel Execution of Logic Programs
  (February, 1988, Fifth Int'l Logic Programming Conference, Seattle, 1988)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Concurrent Transition Systems
  (July, 1987, TCS 64, 1989, pp. 221-269)
  • View abstract.
  • Read report.
  • Get BibTeX entry.

• Concurrent Transition System Semantics of Process Networks
  (January, 1987, Proceedings of the 1987 SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 199-210)
  • Read report.
  • Get BibTeX entry.

• Proving Entailment Between Conceptual State Specifications
  (January, 1988, Theoretical Computer Science 56,1, pp. 135-154.)
  • Read report.
  • Read conference version (March, 1986, Proceedings of the 1986 European Symposium on Programming, Saarbruecken, West Germany, Springer LNCS 213, pp. 197-209)
  • Get BibTeX entry.

• A Proof Technique for Rely/Guarantee Properties
  (December, 1985, Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, Springer LNCS 206, pp. 369-391)
  • Read report.
  • Read revised version (June, 1986, unpublished).
  • Get BibTeX entry.

• Reaching Approximate Agreement in the Presence of Faults
  (July, 1986, Journal of the ACM, 33,3, pp. 499-516)
  • Read report.
  • Get BibTeX entry.

• Foundations of a Theory of Specification for Distributed Systems
  (August, 1984, MIT LCS TR-342)
  • Read report.
  • Get BibTeX entry.

• Semaphore Primitives and Starvation-Free Mutual Exclusion
  (Journal of the ACM, 29,4 (October, 1982), pp. 1049-1072)
  • Get BibTeX entry.