[1] J.W. de Bakker and J.N. Kok. Towards a topological treatment of streams and functions on streams. In W. Brauer, editor, Proc. 12th Int. Coll. Automata, Languages and Programming (ICALP 85), number 194 in Lecture Notes in Computer Science, pages 140-148. Springer Verlag, 1985.
[ bib ]
[2] J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog, and J.I. Zucker. Contrasting themes in the semantics of imperative concurency. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Current Trends in Concurrency, number 224 in Lecture Notes in Computer Science, pages 51-121. Springer Verlag, 1986.
[ bib ]
[3] J.N. Kok. Denotational semantics of nets with nondeterminism. In B. Robinet and R. Wilhelm, editors, European Symposium on Programming (ESOP 86), number 206 in Lecture Notes in Computer Science, pages 237-249. Springer Verlag, 1986.
[ bib ]
[4] P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Operational semantics for a parallel object-oriented language. In Conference Record of the 13th Symposium on Principles of Programming Languages (POPL 86), pages 194-208, St. Petersburg, Florida, 1986.
[ bib ]
[5] J.N. Kok. A fully abstract semantics for data flow nets. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Proc. Parallel Architectures and Languages Europe (PARLE), number 259 in Lecture Notes in Computer Science, pages 351-368. Springer Verlag, 1987.
[ bib ]
[6] P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Two equivalent branching time semantics for communicating systems. Technical report, Philips Research Laboratories, Eindhoven, 1987.
[ bib ]
[7] J.N. Kok. A compositional semantics for concurrent prolog. In R. Cori and M. Wirsing, editors, Proc. 5th Theoretical Aspects of Computer Science (STACS 88), number 294 in Lecture Notes in Computer Science, pages 373-388. Springer Verlag, 1988.
[ bib ]
[8] J.N. Kok and J.J.M.M. Rutten. Contractions in comparing concurrency semantics. In T. Lepistö and A. Salomaa, editors, Proc. 15th Int. Coll. Automata, Languages and Programming (ICALP 88), number 317 in Lecture Notes in Computer Science, pages 317-332. Springer Verlag, 1988.
[ bib ]
[9] J.W. de Bakker and J.N. Kok. Uniform abstraction, atomicity and contractions in the comparative semantics of concurrent prolog. In Proc. Fifth Generation Computer Systems (FGCS 88), pages 347-355, Tokyo, Japan, 1988. Ohmsa ltd and Springer Verlag.
[ bib ]
[10] J.N. Kok. Data flow semantics. Technical Report CS-R8835, Centre for Mathematics and Computer Science, Amsterdam, 1988.
[ bib ]
[11] B. Jonsson and J.N. Kok. Comparing two fully abstract dataflow models. In Odijk, Rem, and Syre, editors, Proc. Parallel Architectures and Languages Europe (PARLE), number 379 in Lecture Notes in Computer Science, pages 217-235. Springer Verlag, 1989.
[ bib ]
[12] J.N. Kok. An iterative metric fully abstract semantics for nondeterministic dataflow. In Kreczmar and Mirkowska, editors, Proceedings Mathematical Foundations of Computer Science (MFCS), number 379 in Lecture Notes in Computer Science, pages 321-331. Springer Verlag, 1989.
[ bib ]
[13] J.N. Kok. Semantic Models for Parallel Computation in Data Flow, Logic- and Object-Oriented Programming. PhD thesis, Free University, Amsterdam, The Netherlands, 1989.
[ bib ]
[14] P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Denotational semantics for a parallel object-oriented language. Information and Computation, 83(2):152-206, 1989.
[ bib ]
[15] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Control flow versus logic: a denotational and a declarative model for guarded horn clauses. In Kreczmar and Mirkowska, editors, Proceedings Mathematical Foundations of Computer Sciece (MFCS 89), number 379 in Lecture Notes in Computer Science, pages 165-176. Springer Verlag, 1989.
[ bib ]
[16] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Semantic models for a version of parlog. In G. Levi and M. Martelli, editors, Proceedings International Conference on Logic Programming (ICLP 89), pages 621-637. MIT Press, 1989.
[ bib ]
[17] P. Knijnenburg and J.N. Kok. A compositional semantics for the finite failures of a language with atomized statements. In P.M.G. Apers, D. Bosman, and J. van Leeuwen, editors, Proceedings Computer Science in the Netherlands (CSN 89), pages 285-305, 1989.
[ bib ]
[18] J.N. Kok. Metric semantics for the input/output behaviour of sequential programs. In Liber Amicorum: J.W. de Bakker, 25 jaar semantiek, pages 307-319. CWI, 1989.
[ bib ]
[19] J.N. Kok. Specialization in logic programming: from horn clause logic to prolog and concurrent prolog. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Proceedings REX workshop on Refinement, number 430 in Lecture Notes in Computer Science, pages 401-413. Springer Verlag, 1990.
[ bib ]
[20] J.W. de Bakker and J.N. Kok. Comparative semantics for concurrent prolog. Theoretical Computer Sciene, 8(72), 1990.
[ bib ]
[21] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. From failure to succes: Comparing a denotational and declarative semantics for horn clause logic. In Kwiatkowska and Shields, editors, Proceedings BCS-FACS workshop on semantics for Concurrency, Workshops in Computing, pages 38-60. Springer Verlag, 1990.
[ bib ]
[22] J.N. Kok. On logic programming and the refinement calculus: Semantics based program transformations. Technical Report RUU-CS-90-39, Utrecht University, 1990.
[ bib ]
[23] J.N. Kok and J.J.M.M. Rutten. Contractions in comparing concurrency semantics. Theoretical Computer Science, 76(3):179-222, 1990.
[ bib ]
[24] B. Jonsson and J.N. Kok. Towards a complete hierarchy of compositional dataflow models. In Meyer and Ito, editors, Proc. Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 204-226. Springer Verlag, 1991.
[ bib ]
[25] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm for asynchronous communication. In Baeten and Groote, editors, Proceedings Concur 91, number 527 in Lecture Notes in Computer Science, pages 111-127. Springer Verlag, 1991.
[ bib ]
[26] P. Knijnenburg and J.N. Kok. On the semantics of atomized statements: the parallel-choice option. In Budach, editor, Proceedings FCT 91, number 529 in Lecture Notes in Computer Science, pages 297-307. Springer Verlag, 1991.
[ bib ]
[27] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Semantic models for concurrent logic languages. Theoretical Computer Science, 86(1):3-34, 1991.
[ bib ]
[28] P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Denotational semantics of a parallel object-oriented language. In J.W. de Bakker and J.J.M.M. Rutten, editors, Ten years of Concurrency Semantics, pages 218-271. World Scientific, 1992.
[ bib ]
[29] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. From failure to succes: Comparing a denotational and a declarative semantics for horn clause logic. In J.W. de Bakker and J. Rutten, editors, Ten years of Concurrency Semantics, pages 373-396. World Scientific, 1992.
[ bib ]
[30] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. From failure to success: comparing a denotational and a declarative semantics for horn clause logic. Theoretical Computer Science, 101:239-263, 1992.
[ bib ]
[31] J.N. Kok. Traces, histories and streams in the semantics of data flow. International Journal of High Speed Computing, 5(2):225-242, 1993. Special Issue on Massive Parallellism: Hardware, Programming and Applications. Also available as report on computer science 91 of Å bo Akademi.
[ bib ]
[32] J.N. Kok. Current trends in the semantics of dataflow. In M. Droste and Y. Gurevich, editors, Semantics of Programming Languages and Model Theory, volume 5 of Algebra, Logic and Applications, pages 245-268. Gordon and Breach Science Publishers, 1993.
[ bib ]
[33] R.T. Udink and J.N. Kok. On the relation between unity properties and sequences of states. In J.W de Bakker, G. Rozenberg, and W.P. de Roever, editors, Proceedings Rex workshop on Semantics: Foundations and Applications, number 666 in Lecture Notes in Computer Science, pages 594-609. Springer Verlag, 1993.
[ bib ]
[34] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. On blocks: Locality and asynchronous communication. In J.W de Bakker, G. Rozenberg, and W.P. de Roever, editors, Proceedings Rex workshop on Semantics: Foundations and Applications, number 666 in Lecture Notes in Computer Science, pages 73-91. Springer Verlag, 1993.
[ bib ]
[35] M. Bonsangue and J.N. Kok. Semantics, orderings and recursion in the weakest precondition calculus. In J.W de Bakker, G. Rozenberg, and W.P. de Roever, editors, Proceedings Rex workshop on Semantics: Foundations and Applications, number 666 in Lecture Notes in Computer Science, pages 91-110. Springer Verlag, 1993.
[ bib ]
[36] R.T. Udink and J.N. Kok. The relation between unity properties and sequences of states -some obserations. Information Processing Letters, 47:307-311, 1993.
[ bib ]
[37] R.T. Udink and J.N. Kok. Two fully abstract models for unity. In Proceedings Concur 93, number 715 in Lecture Notes in Computer Science, pages 339-352. Springer Verlag, 1993.
[ bib ]
[38] M. Bonsangue and J.N. Kok. Isomorphisms between predicate and state transformers. In Proceedings Mathematical Foundations of Computer Science (MFCS), number 711 in Lecture Notes in Computer Science, pages 301-311. Springer Verlag, 1993. Extended version available as RUU-CS-93-09.
[ bib ]
[39] P. Knijnenburg and J.N. Kok. Divergence models for atomized statements and parallel choice. In Proceedings ISTCS, pages 231-240. IEEE Computer Society Press, 1993.
[ bib ]
[40] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. A paradigm for asynchronous communication and its application to concurrent constraint programming. In K.R. Apt, J.W. de Bakker, and J.J.M.M. Rutten, editors, Logic programming languages: constraints, functions, and objects, Logic Programming Series, pages 82-114. MIT Press, 1993.
[ bib ]
[41] F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Non-monotonic concurrent constraint programming. In D. Miller, editor, International Logic Programming Symposium. MIT Press, 1993.
[ bib ]
[42] M. Bonsangue and J.N. Kok. Relating multifunctions and predicate transformers through closure operators. In M. Hagiya and J.C. Mitchell, editors, Proceedings Theoretical Aspects of Computer Software, number 789 in Lecture Notes in Computer Science, pages 822-843. Springer Verlag, 1994.
[ bib ]
[43] M.M. Bonsangue and J.N. Kok. The weakest precondition calculus: Recursion and duality. Formal Aspects of Computing, 6(A):788-800, 1994. Full version in Formal Aspects of Computing, 6(E), pp. 71-100, December 1994.
[ bib ]
[44] R.T. Udink, J.N. Kok, and T. Herman. Progress for local variables in unity. In E.-R. Olderog, editor, IFIP working conference on Programming Concepts, Methods and Calculi, volume A-56 of IFIP Transactions, pages 127-146. North-Holland, 1994.
[ bib ]
[45] M. Bonsangue, B. Jacobs, and J.N. Kok. Duality beyond sober spaces: Topological spaces and observation frames. Theoretical Computer Science, 151(1):79-124, 1995.
[ bib ]
[46] M.M. Bonsangue, E.P. de Vink, and J.N. Kok. Metric predicate transformers: Towards a notion of refinement for concurrency. In I. Lee and S.A. Smolka, editors, Proceedings of 6th international conference Concur 95: Concurrency theory, number 962 in Lecture Notes in Computer Science, pages 363 - 377, Philadelphia, PA, USA, 1995.
[ bib ]
[47] R.T. Udink and J.N. Kok. Impunity: Unity with procedures and local variables. In Mathematics of Program Construction '95, Lecture Notes in Computer Science. Springer Verlag, 1995.
[ bib ]
[48] H. Goeman, J.N. Kok, K. Sere, and R. Udink. Coordination in the impunity framework. In Proceedings of COORDINATION, Lecture Notes in Computer Science. Springer-Verlag, 1995.
[ bib ]

This file has been generated by bibtex2html 1.52