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.
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
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]
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]
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]
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., & 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). Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundamenta Informaticae, 128(4), 367-412. https://doi.org/10.3233/FI-2013-950[details]
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). 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]
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. (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]
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). 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]
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. (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. (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). 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
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). On the behaviours produced by instruction sequences under execution. ArXiv. http://arxiv.org/abs/1106.6196[details]
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]
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). Timed tuplix calculus and the Wesseling and van den Bergh equation. ArXiv. http://arxiv.org/abs/0901.3003[details]
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. (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
The UvA uses cookies to ensure the basic functionality of the site and for statistical and optimisation purposes. Cookies are also placed to display third-party content and for marketing purposes. Click 'Accept all cookies' to consent to the placement of all cookies, or choose 'Decline' to only accept functional and analytical cookies. Also read the UvA Privacy statement.