For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.

Prof. dr. ir. C.A. (Kees) Middelburg

Faculty of Science
Informatics Institute
Photographer: L.S. van Eerten
Visiting address
  • Science Park 107
Postal address
  • Postbus 94323
    1090 GH Amsterdam
Contact details
  • Publications

    2021

    2020

    2019

    2018

    • Bergstra, J. A., & Middelburg, C. A. (2018). A Short Introduction to Program Algebra with Instructions for Boolean Registers. Computer Science Journal of Moldova, 26(3 (78)), 199-232. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2018). Instruction sequences expressing multiplication algorithms. Scientific Annals of Computer Science, 28(1), 39-66. https://doi.org/10.7561/SACS.2018.1.39 [details]

    2017

    2016

    2015

    2014

    2013

    2012

    2011

    2010

    2009

    • Bergstra, J. A., & Middelburg, C. A. (2009). Instruction sequences with dynamically instantiated instructions. Fundamenta Informaticae, 96(1-2), 27-48. https://doi.org/10.3233/FI-2009-165 [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Machine structure oriented control code logic. Acta Informatica, 46(5), 375-401. https://doi.org/10.1007/s00236-009-0099-2 [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Transmission protocols for instruction streams. In M. Leucker, & C. Morgan (Eds.), Theoretical Aspects of Computing - ICTAC 2009: 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009 : proceedings (pp. 127-139). (Lecture Notes in Computer Science; Vol. 5684). Berlin: Springer. https://doi.org/10.1007/978-3-642-03466-4_8 [details]

    2008

    2007

    2006

    2005

    • Bergstra, J. A., & Middelburg, C. A. (2005). A thread algebra with multi-level strategic interleaving. Lecture Notes in Computer Science, 3526, 25-48. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2005). Model theory for process algebra. Lecture Notes in Computer Science, 3838, 445-495. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2005). Process algebra for hybrid systems. Theoretical Computer Science, 335, 215-280. https://doi.org/10.1016/j.tcs.2004.04.019 [details]
    • Bergstra, J. A., & Middelburg, C. A. (2005). Strong splitting bisimulation equivalence. In J. L. Fiadeiro, N. Harman, M. Roggenbach, & J. Rutten (Eds.), Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings (pp. 85-99). (Lecture Notes in Computer Science; Vol. 3629). Springer. https://doi.org/10.1007/11548133_6 [details]
    • Bernardo, M., & Middelburg, C. A. (2005). Guest editors' introduction: Special issue on process algebra and system architecture. Journal of Logic and Algebraic Programming, 63(2), 175-176. https://doi.org/10.1016/j.jlap.2004.05.002

    2012

    • Bergstra, J. A., & Middelburg, C. A. (2012). Instruction Sequences for Computer Science. (Atlantis Studies in Computing; No. 2). Paris: Atlantis Press. [details]

    2011

    • Bergstra, J. A., & Middelburg, C. A. (2011). An application specific informal logic for interest prohibition theory. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2011). Interest prohibition and financial product innovation. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2011). On the behaviours produced by instruction sequences under execution. Ithaca, NY: arXiv.org. [details]

    2010

    • Bergstra, J. A., & Middelburg, C. A. (2010). On the definition of a theoretical concept of an operating system. Ithaca, NY: arXiv.org. [details]

    2009

    • Bergstra, J. A., & Middelburg, C. A. (2009). A process calculus with finitary comprehended terms. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Arithmetical meadows. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Autosolvability of halting problem instances for instruction sequences. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Functional units for natural numbers. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Indirect jumps improve instruction sequence performance. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Instruction sequence notations with probabilistic instructions. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Instruction sequence processing operators. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Inversive meadows and divisive meadows. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Meadow enriched ACP process algebras. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). On the expressiveness of single-pass instruction sequences. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Partial Komori fields and imperative Komori fields. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Thread extraction for polyadic instruction sequences. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2009). Timed tuplix calculus and the Wesseling and van den Bergh equation. Ithaca, NY: arXiv.org. [details]

    2008

    • Bergstra, J. A., & Middelburg, C. A. (2008). Data linkage algebra, data linkage dynamics, and priority rewriting. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2008). Data linkage dynamics with shedding. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2008). Instruction sequences and non-uniform complexity theory. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2008). Instruction sequences for the production of processes. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2008). Thread algebra for poly-threading. Ithaca, NY: arXiv.org. [details]

    2007

    • Bergstra, J. A., & Middelburg, C. A. (2007). A thread calculus with molecular dynamics. arXiv.org. http://arxiv.org/abs/0711.0840 [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). An Interface Group for Process Components. (PRG technical report). Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). Distributed strategic interleaving with load balancing. (Computer science reports; No. 0703). Eindhoven: Eindhoven University of Technology. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). Instruction Sequences with Dynamically Instantiated Instructions. (PRG technical report). Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). Instruction Sequences with Indirect Jumps. (PRG technical report). Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). Machine Structure Oriented Control Code Logic (Extended Version). (PRG technical report). Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). Machine structure oriented control code logic. (Computer science reports; No. 0710). Eindhoven: Eindhoven University of Technology. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). On the Operating Unit Size of Load/Store Architectures. (PRG technical report). Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2007). Program Algebra with a Jump-Shift Instruction. (PRG technical report). Ithaca, NY: arXiv.org. [details]

    2006

    • Bergstra, J. A., & Middelburg, C. A. (2006). A thread calculus with molecular dynamics. Eindhoven University of Technology, Department of Mathematics and Computing Science. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2006). Maurer computers for pipelined instruction processing. Eindhoven: Eindhoven University of Technology, Department of Mathematics and Computing Science. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2006). Parallel Processes with Implicit Computational Capital. Eindhoven: Eindhoven University of Technology, Department of Mathematics and Computing Science. [details]
    • Bergstra, J. A., & Middelburg, C. A. (2006). Synchronous Cooperation for Explicit Multi-Threading. Eindhoven: Eindhoven University of Technology, Department of Mathematics and Computing Science. [details]

    2005

    • Bergstra, J. A., & Middelburg, C. A. (2005). Maurer Computers with single-thread control. (05-17). unknown: TU/e CS. [details]

    2011

    • Bergstra, J. A., & Middelburg, C. A. (2011). Interest prohibition and financial product innovation. In A. Escurat (Ed.), Finance islamique: regard(s) sur une finance alternative: recueil d'articles d'experts internationaux (pp. 274-284). Alger: Mazars Hadj Ali.
    This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list.
  • Ancillary activities
    No known ancillary activities
edit contact information   edit profile page