Refereed Papers

J. A. Bergstra and M. E. Loots (2002). Program algebra for sequential code. Journal of Logic and Algebraic Programming, 51(2):125–156. doi:10.1016/S1567-8326(02)00018-8 (freely available)

A. Ponse (2002). Program algebra with unit instruction operators. Journal of Logic and Algebraic Programming, 51(2):157–174. doi:10.1016/S1567-8326(02)00019-X (freely available)

J. A. Bergstra and A. Ponse (2002). Combining programs and state machines. Journal of Logic and Algebraic Programming, 51(2):175–192. doi:10.1016/S1567-8326(02)00020-6 (freely available)

J. A. Bergstra and I. Bethke (2002). Molecular dynamics. Journal of Logic and Algebraic Programming, 51(2):193–214. doi:10.1016/S1567-8326(02)00021-8 (freely available)

J. A. Bergstra and I. Bethke (2003). Polarized process algebra and program equivalence. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, Proceedings 30th ICALP, volume 2719 of Lecture Notes in Computer Science, pages 1–21. Springer-Verlag. doi:10.1007/3-540-45061-0_1

J. A. Bergstra and A. Ponse (2005). A bypass of Cohen’s impossibility result. In P. M. A. Sloot, A. G. Hoekstra, T. Priol, A. Reinefeld, and M. Bubak, editors, EGC 2005, volume 3470 of Lecture Notes in Computer Science, pages 1097-1106. Springer-Verlag. doi:10.1007/11508380_112 (preprint retrievable from http://ivi.fnwi.uva.nl/tcs/publications.php#prg-ereports)

A. Ponse and M. B. van der Zwaag (2006). An introduction to program and thread algebra. In A. Beckmann et al., editors, CiE 2006, volume 3988 of Lecture Notes in Computer Science, pages 445–458. Springer-Verlag. doi:10.1007/11780342_46

J. A. Bergstra and I. Bethke (2007). Predictable and reliable program code: Virtual machine based projection semantics. In J. A. Bergstra and M. Burgess, editors, Handbook of Network and Systems Administration, pages 653–685. Elsevier, Amsterdam. doi:10.1016/B978-044452198-9.50026-4 (preprint retrievable from http://ivi.fnwi.uva.nl/tcs/publications.php#prg-ereports)

J. A. Bergstra and C. A. Middelburg (2007a). Instruction sequences with indirect jumps. Scientific Annals of Computer Science, 17:19–46. Retrievable from http://www.info.uaic.ro/bin/Annals/XVII (freely available)

J. A. Bergstra and C. A. Middelburg (2007b). Programming an interpreter using molecular dynamics. Scientific Annals of Computer Science, 17:47–81. Retrievable from http://www.info.uaic.ro/bin/Annals/XVII (freely available)

J. A. Bergstra and C. A. Middelburg (2007c). Synchronous cooperation for explicit multi-threading. Acta Informatica, 44(7–8):525–569. doi:10.1007/s00236-007-0057-9 (freely available)

J. A. Bergstra and A. Ponse (2007). Execution architectures for program algebra. Journal of Applied Logic, 5(1):170–192. doi:10.1016/j.jal.2005.10.013 (freely available)

J. A. Bergstra and C. A. Middelburg (2008a). Maurer computers for pipelined instruction processing. Mathematical Structures in Computer Science, 18(2):373–409. doi:10.1017/S0960129507006548 (postprint at http://staff.fnwi.uva.nl/c.a.middelburg/papers/pre-MSCS-08.pdf)

J. A. Bergstra and C. A. Middelburg (2008b). Program algebra with a jump-shift instruction. Journal of Applied Logic, 6(4):553–563. doi:10.1016/j.jal.2008.07.001 (freely available)

J. A. Bergstra and C. A. Middelburg (2009a). Instruction sequences with dynamically instantiated instructions. Fundamenta Informaticae, 96(1–2):27–48. doi:10.3233/FI-2009-165 (postprint: arXiv:0711.4217v4 [cs.PL])

J. A. Bergstra and A. Ponse (2009). An instruction sequence semigroup with involutive antiautomorphisms. Scientific Annals of Computer Science, 19:57–92. Retrievable from http://www.info.uaic.ro/bin/Annals/XIX (freely available)

J. A. Bergstra and I. Bethke (2010). Straight-line instruction sequence completeness for total calculation on cancellation meadows. Theory of Computing Systems, 48(4):840–864. doi:10.1007/s00224-010-9272-9 (freely available)

J. A. Bergstra and C. A. Middelburg (2011). Thread extraction for polyadic instruction sequences. Scientific Annals of Computer Science, 21(2):283–310. Retrievable from http://www.info.uaic.ro/bin/Annals/XXI2 (freely available)

J. A. Bergstra and I. Bethke (2012). On the contribution of backward jumps to instruction sequence expressiveness. Theory of Computing Systems, 50(4):706–720. doi:10.1007/s00224-011-9376-x (freely available)

J. A. Bergstra and C. A. Middelburg (2012a). Indirect jumps improve instruction sequence performance. Scientific Annals of Computer Science, 22(2):253–265. doi:10.7561/SACS.2012.2.253 (freely available)

J. A. Bergstra and C. A. Middelburg (2012b). Instruction sequence processing operators. Acta Informatica, 49(3):139–172. doi:10.1007/s00236-012-0154-2 (freely available)

J. A. Bergstra and C. A. Middelburg (2012c). On the behaviours produced by instruction sequences under execution. Fundamenta Informaticae, 120(2):111–144. doi:10.3233/FI-2012-753 (postprint: arXiv:1106.6196v2 [cs.PL])

J. A. Bergstra and C. A. Middelburg (2012d). On the expressiveness of single-pass instruction sequences. Theory of Computing Systems, 50(2):313–328. doi:10.1007/s00224-010-9301-8 (freely available)

J. A. Bergstra and C. A. Middelburg (2014a). Instruction sequence based non-uniform complexity classes. Scientific Annals of Computer Science, 24(1):47–89. doi:10.7561/SACS.2014.1.47 (freely available)

J. A. Bergstra and C. A. Middelburg (2015a). On algorithmic equivalence of instruction sequences for computing bit string functions. Fundamenta Informaticae, 138(4):411–434. doi:10.3233/FI-2015-1219 (postprint: arXiv:1402.4950v3 [cs.LO])

J.A. Bergstra and C.A. Middelburg (2016a). A Hoare-like logic of asserted single-pass instruction sequences. Scientific Annals of Computer Science, 26(2):125–156. doi:10.7561/SACS.2016.2.125 (freely available)

J. A. Bergstra and C. A. Middelburg (2016b). Instruction sequence size complexity of parity. Fundamenta Informaticae, 149(3):297–309. doi:10.3233/FI-2016-1450 (postprint: arXiv:1412.6787v5 [cs.CC])

J. A. Bergstra and C. A. Middelburg (2016c). On instruction sets for Boolean registers in program algebra. Scientific Annals of Computer Science, 26(1):1–26. doi:10.7561/SACS.2016.1.1 (freely available)

 

 

Papers are ordered by year of publication. If two or more publications have the same year of publication, then they are further ordered by surnames of the authors. If two or more publications have the same year of publication and the same surnames of the authors, then they are further ordered by title of the paper. An exception form the papers published in a special issue of the Journal of Logic and Algebraic Programming in 2002; they are in the order in which they appear in that issue.

Advertisements