Prof. dr. ir. C.A. (Kees) Middelburg
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
Informatics Institute
Bezoekadres
- Science Park 107
Postadres
-
Postbus 94323
1090 GH Amsterdam
Contactgegevens
-
Publicaties
2024
- Middelburg, C. A. (2024). Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis. Theoretical Computer Science, 1008, Article 114681. https://doi.org/10.1016/j.tcs.2024.114681
Middelburg, C. A. (2024). Imperative Process Algebra and Models of Parallel Computation. Theory of Computing Systems, 68(3), 529-570. https://doi.org/10.1007/s00224-024-10164-0 [details]- Middelburg, C. A. (2024). On the Formalization of the Notion of an Algorithm. In The Practice of Formal Methods: Essays in Honour of Cliff Jones (Vol. II, pp. 23-44). (Lecture Notes in Computer Science; Vol. LNCS). Springer. https://doi.org/10.1007/978-3-031-66673-5_2
- Middelburg, C. A. (2024). Paraconsistent logic and query answering in inconsistent databases. Journal of Applied Non-Classical Logics, 34(1), 133-154. https://doi.org/10.1080/11663081.2024.2312776
2023
- Middelburg, C. A. (2023). Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values. Scientific Annals of Computer Science, 33(2), 159-192. https://doi.org/10.7561/SACS.2023.2.159 [details]
2022
- Middelburg, C. A. (2022). Imperative Process Algebra with Abstraction. Scientific Annals of Computer Science, 32(1), 137-179. https://doi.org/10.7561/SACS.2022.1.137 [details]
- Middelburg, C. A. (2022). Program Algebra for Random Access Machine Programs. Scientific Annals of Computer Science, 32(2), 285-319. https://doi.org/10.7561/SACS.2022.2.285 [details]
2021
- Bergstra, J. A., & Middelburg, C. A. (2021). Using Hoare Logic in a Process Algebra Setting. Fundamenta Informaticae, 179(4), 321-344. https://doi.org/10.3233/FI-2021-2026 [details]
- Middelburg, C. A. (2021). On the strongest three-valued paraconsistent logic contained in classical logic and its dual. Journal of Logic and Computation, 31(2), 597-611. Advance online publication. https://doi.org/10.1093/logcom/exaa084 [details]
2020
- Bergstra, J. A., & Middelburg, C. A. (2020). On the complexity of the correctness problem for non-zeroness test instruction sequences. Theoretical Computer Science, 802, 1-18. Advance online publication. https://doi.org/10.1016/j.tcs.2019.03.040 [details]
- Middelburg, C. A. (2020). Probabilistic process algebra and strategic interleaving. Scientific Annals of Computer Science, 30(2), 205-243. https://doi.org/10.7561/SACS.2020.2.205 [details]
2019
- Bergstra, J. A., & Middelburg, C. A. (2019). Process Algebra with Strategic Interleaving. Theory of Computing Systems, 63(3), 488–505 . Advance online publication. https://doi.org/10.1007/s00224-018-9873-2 [details]
- Bergstra, J. A., & Middelburg, C. A. (2019). Program Algebra for Turing-Machine Programs. Scientific Annals of Computer Science, 29(2), 113-139. https://doi.org/10.7561/SACS.2019.2.113 [details]
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. http://www.math.md/publications/csjm/issues/v26-n3/12735/ [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
- Bergstra, J. A., & Middelburg, C. A. (2017). Axioms for behavioural congruence of single-pass instruction sequences. Scientific Annals of Computer Science, 27(2), 111-135. https://doi.org/10.7561/SACS.2017.2.111 [details]
- Bergstra, J. A., & Middelburg, C. A. (2017). Contradiction-tolerant process algebra with propositional signals. Fundamenta Informaticae, 153(1-2), 29-55. https://doi.org/10.3233/FI-2017-1530 [details]
2016
- Bergstra, J. A., & Middelburg, C. A. (2016). A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. Scientific Annals of Computer Science, 26(2), 125-156. https://doi.org/10.7561/SACS.2016.2.125 [details]
- Bergstra, J. A., & Middelburg, C. A. (2016). Instruction sequence size complexity of parity. Fundamenta Informaticae, 149(3), 297-309. https://doi.org/10.3233/FI-2016-1450 [details]
- Bergstra, J. A., & Middelburg, C. A. (2016). On instruction sets for Boolean registers in program algebra. Scientific Annals of Computer Science, 26(1), 1-26. https://doi.org/10.7561/SACS.2016.1.1 [details]
- Bergstra, J. A., & Middelburg, C. A. (2016). Transformation of fractions into simple fractions in divisive meadows. Journal of Applied Logic, 16, 92-110. Advance online publication. https://doi.org/10.1016/j.jal.2016.03.001 [details]
2015
- Bergstra, J. A., & Middelburg, C. A. (2015). Division by zero in non-involutive meadows. Journal of Applied Logic, 13(1), 1-12. Advance online publication. https://doi.org/10.1016/j.jal.2014.10.001 [details]
- Bergstra, J. A., & Middelburg, C. A. (2015). On algorithmic equivalence of instruction sequences for computing bit string functions. Fundamenta Informaticae, 138(4), 411-434. https://doi.org/10.3233/FI-2015-1219 [details]
- Bergstra, J. A., & Middelburg, C. A. (2015). Probabilistic thread algebra. Scientific Annals of Computer Science, 25(2), 211-243. https://doi.org/10.7561/SACS.2015.2.211 [details]
2014
- Bergstra, J., & Middelburg, C. (2014). Instruction sequence based non-uniform complexity classes. Scientific Annals of Computer Science, 24(1), 47-89. https://doi.org/10.7561/SACS.2014.1.47 [details]
2013
- Bergstra, J., & Middelburg, C. (2013). Timed tuplix calculus and the Wesseling and van den Berg equation. Scientific Annals of Computer Science, 23(2), 169-190. https://doi.org/10.7561/SACS.2013.2.169 [details]
- Bergstra, J., & Middelburg, C. A. (2013). A process calculus with finitary comprehended terms. Theory of Computing Systems, 53(4), 645-668. https://doi.org/10.1007/s00224-013-9468-x [details]
- Bergstra, J., & Middelburg, C. A. (2013). Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundamenta Informaticae, 128(4), 367-412. https://doi.org/10.3233/FI-2013-950 [details]
2012
- Bergstra, J. A., & Middelburg, C. A. (2012). Indirect jumps improve instruction sequence performance. Scientific Annals of Computer Science, 22(2), 253-265. https://doi.org/10.7561/SACS.2012.2.253 [details]
- Bergstra, J. A., & Middelburg, C. A. (2012). Instruction sequence processing operators. Acta Informatica, 49(3), 139-172. https://doi.org/10.1007/s00236-012-0154-2 [details]
- Bergstra, J. A., & Middelburg, C. A. (2012). On the behaviours produced by instruction sequences under execution. Fundamenta Informaticae, 120(2), 111-144. https://doi.org/10.3233/FI-2012-753 [details]
- Bergstra, J. A., & Middelburg, C. A. (2012). On the expressiveness of single-pass instruction sequences. Theory of Computing Systems, 50(2), 313-328. https://doi.org/10.1007/s00224-010-9301-8 [details]
2011
- Bergstra, J. A., & Middelburg, C. A. (2011). Inversive meadows and divisive meadows. Journal of Applied Logic, 9(3), 203-220. https://doi.org/10.1016/j.jal.2011.03.001 [details]
- Bergstra, J. A., & Middelburg, C. A. (2011). Preliminaries to an investigation of reduced product set finance. Journal of King Abdulaziz University: Islamic Economics, 24(1), 175-210. https://doi.org/10.4197/Islec.24-1.7 [details]
- Bergstra, J. A., & Middelburg, C. A. (2011). Thread algebra for poly-threading. Formal Aspects of Computing, 23(4), 567-583. https://doi.org/10.1007/s00165-011-0178-3 [details]
- Bergstra, J., & Middelburg, C. (2011). Thread extraction for polyadic instruction sequences. Scientific Annals of Computer Science, 21(2), 283-310. http://www.info.uaic.ro/bin/Annals/Article?v=XXI2&a=4 [details]
2010
- Bergstra, J. A., & Middelburg, C. A. (2010). A thread calculus with molecular dynamics. Information and Computation, 208(7), 817-844. https://doi.org/10.1016/j.ic.2010.01.004 [details]
- Bergstra, J. A., & Middelburg, C. A. (2010). An interface group for process components. Fundamenta Informaticae, 99(4), 355-382. https://doi.org/10.3233/FI-2010-254 [details]
- Bergstra, J. A., & Middelburg, C. A. (2010). Data linkage dynamics with shedding. Fundamenta Informaticae, 103(1-4), 31-52. https://doi.org/10.3233/FI-2010-317 [details]
- Bergstra, J. A., & Middelburg, C. A. (2010). On the operating unit size of load/store architectures. Mathematical Structures in Computer Science, 20(3), 395-417. https://doi.org/10.1017/S0960129509990314 [details]
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). Springer. https://doi.org/10.1007/978-3-642-03466-4_8 [details]
2008
- Bergstra, J. A., & Middelburg, C. A. (2008). Distributed strategic interleaving with load balancing. Future Generation Computer Systems, 24(6), 530-548. https://doi.org/10.1016/j.future.2007.08.001 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Maurer computers for pipelined instruction processing. Mathematical Structures in Computer Science, 18(02), 373-409. https://doi.org/10.1017/S0960129507006548 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Parallel processes with implicit computational capital. Electronic Notes in Theoretical Computer Science, 209, 55-81. https://doi.org/10.1016/j.entcs.2008.04.004 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Program algebra with a jump-shift instruction. Journal of Applied Logic, 6(4), 553-563. https://doi.org/10.1016/j.jal.2008.07.001 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Simulating Turing machines on Maurer machines. Journal of Applied Logic, 6(1), 1-23. https://doi.org/10.1016/j.jal.2007.04.001 [details]
2007
- Bergstra, J. A., & Middelburg, C. A. (2007). A thread algebra with multi-level strategic interleaving. Theory of Computing Systems, 41, 3-32. https://doi.org/10.1007/s00224-006-1337-4 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Maurer computers with single-thread control. Fundamenta Informaticae, 80, 333-362. [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Preferential choice and coordination conditions. The Journal of Logic and Algebraic Programming, 70, 172-200. https://doi.org/10.1016/j.jlap.2006.08.004 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Programming an interpreter using molecular dynamics. Scientific Annals of Computer Science, 17, 47-81. http://www.info.uaic.ro/bin/Annals/Article?v=XVII&a=2 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Synchronous cooperation for explicit multi-threading. Acta Informatica, 44, 525-569. https://doi.org/10.1007/s00236-007-0057-9 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Thread algebra for strategic interleaving. Formal Aspects of Computing, 19, 445-474. https://doi.org/10.1007/s00165-007-0024-9 [details]
2006
- Bergstra, J. A., & Middelburg, C. A. (2006). Continuity controlled hybrid automata. The Journal of Logic and Algebraic Programming, 68(1-2), 5-53. https://doi.org/10.1016/j.jlap.2005.10.002 [details]
- Bergstra, J. A., & Middelburg, C. A. (2006). Splitting bisimulations and retrospective conditions. Information and Computation, 204(7), 1083-1138. https://doi.org/10.1016/j.ic.2006.03.003 [details]
- Bergstra, J. A., & Middelburg, C. A. (2006). Thread algebra with multi-level strategies. Fundamenta Informaticae, 71(2/3), 153-182. [details]
- Middelburg, C. A. (2006). Conditionals in Algebraic Process Calculi. Electronic Notes in Theoretical Computer Science, 162(1), 237-241. https://doi.org/10.1016/j.entcs.2005.12.088
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
2023
- Middelburg, C. A. (2023). Dormancy-aware timed branching bisimilarity for timed analysis of communication protocols. (v4 ed.) ArXiv. https://doi.org/10.48550/arXiv.2107.08921 [details]
2021
- Middelburg, C. A. (2021). Imperative process algebra with abstraction. (v3 ed.) ArXiv. https://doi.org/10.48550/arXiv.2103.07863 [details]
2020
- Middelburg, C. A. (2020). A classical-logic view of a paraconsistent logic. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2008.07292 [details]
- Middelburg, C. A. (2020). Process algebra, process scheduling, and mutual exclusion. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2003.00473 [details]
- Middelburg, C. A. (2020). Program algebra for random access machine programs. (v1 ed.) ArXiv. https://doi.org/https://arxiv.org/abs/2007.09946v1 [details]
- van Glabbeek, R. J., & Middelburg, C. A. (2020). On infinite guarded recursive specifications in process algebra. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2005.00746 [details]
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. ArXiv. http://arxiv.org/abs/1104.0308 [details]
- Bergstra, J. A., & Middelburg, C. A. (2011). Interest prohibition and financial product innovation. ArXiv. http://arxiv.org/abs/1104.2471 [details]
- Bergstra, J. A., & Middelburg, C. A. (2011). On the behaviours produced by instruction sequences under execution. ArXiv. http://arxiv.org/abs/1106.6196 [details]
2010
- Bergstra, J. A., & Middelburg, C. A. (2010). On the definition of a theoretical concept of an operating system. ArXiv. http://arxiv.org/abs/1006.0813 [details]
2009
- Bergstra, J. A., & Middelburg, C. A. (2009). A process calculus with finitary comprehended terms. ArXiv. http://arxiv.org/abs/0903.2914 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Arithmetical meadows. ArXiv. http://arxiv.org/abs/0909.2088 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Autosolvability of halting problem instances for instruction sequences. ArXiv. http://arxiv.org/abs/0911.5018 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Functional units for natural numbers. ArXiv. http://arxiv.org/abs/0911.1851 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Indirect jumps improve instruction sequence performance. ArXiv. http://arxiv.org/abs/0909.2089 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Instruction sequence notations with probabilistic instructions. ArXiv. http://arxiv.org/abs/0906.3083 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Instruction sequence processing operators. ArXiv. http://arxiv.org/abs/0910.5564 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Inversive meadows and divisive meadows. ArXiv. http://arxiv.org/abs/0907.0540 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Meadow enriched ACP process algebras. ArXiv. http://arxiv.org/abs/0901.3012 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). On the expressiveness of single-pass instruction sequences. ArXiv. http://arxiv.org/abs/0810.1106 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Partial Komori fields and imperative Komori fields. ArXiv. http://arxiv.org/abs/0909.5271 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Thread extraction for polyadic instruction sequences. ArXiv. http://arxiv.org/abs/0802.1578 [details]
- Bergstra, J. A., & Middelburg, C. A. (2009). Timed tuplix calculus and the Wesseling and van den Bergh equation. ArXiv. http://arxiv.org/abs/0901.3003 [details]
2008
- Bergstra, J. A., & Middelburg, C. A. (2008). Data linkage algebra, data linkage dynamics, and priority rewriting. ArXiv. http://arxiv.org/abs/0804.4565 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Data linkage dynamics with shedding. ArXiv. http://arxiv.org/abs/0806.4034 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Instruction sequences and non-uniform complexity theory. ArXiv. http://arxiv.org/abs/0809.0352 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Instruction sequences for the production of processes. ArXiv. http://arxiv.org/abs/0811.0436v2 [details]
- Bergstra, J. A., & Middelburg, C. A. (2008). Thread algebra for poly-threading. ArXiv. http://arxiv.org/abs/0803.0378 [details]
2007
- Bergstra, J. A., & Middelburg, C. A. (2007). A thread calculus with molecular dynamics. ArXiv. http://arxiv.org/abs/0711.0840 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). An Interface Group for Process Components. (v1 ed.) (PRG technical report). ArXiv. https://doi.org/10.48550/arXiv.0711.0834 [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). ArXiv. http://arxiv.org/abs/0711.4217 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Instruction Sequences with Indirect Jumps. (PRG technical report). ArXiv. http://arxiv.org/abs/0711.0829 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Machine Structure Oriented Control Code Logic (Extended Version). (PRG technical report). ArXiv. http://arxiv.org/abs/0711.0836 [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). ArXiv. http://arxiv.org/abs/0711.0838 [details]
- Bergstra, J. A., & Middelburg, C. A. (2007). Program Algebra with a Jump-Shift Instruction. (PRG technical report). ArXiv. http://arxiv.org/abs/0712.1658 [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). Mazars Hadj Ali. https://keesmiddelburg.files.wordpress.com/2015/05/ipfpi.pdf
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. -
Nevenwerkzaamheden
Geen nevenwerkzaamheden
Middelburg, C. A. (2024). Imperative Process Algebra and Models of Parallel Computation. Theory of Computing Systems, 68(3), 529-570.