{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T20:40:19Z","timestamp":1742762419671,"version":"3.40.2"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00236-012-0154-2","type":"journal-article","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T08:38:38Z","timestamp":1332491918000},"page":"139-172","source":"Crossref","is-referenced-by-count":1,"title":["Instruction sequence processing operators"],"prefix":"10.1007","volume":"49","author":[{"given":"J. A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"C. A.","family":"Middelburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,23]]},"reference":[{"key":"154_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S. Arora","year":"2009","unstructured":"Arora S., Barak B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"issue":"6","key":"154_CR2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/152766.152767","volume":"19","author":"H.G. Baker","year":"1991","unstructured":"Baker H.G.: Precise instruction scheduling without a precise machine model. SIGARCH Comput. Archit. News 19(6), 4\u20138 (1991)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"154_CR3","first-page":"1","volume-title":"Proceedings 30th ICALP, Lecture Notes in Computer Science, vol. 2719","author":"J.A. Bergstra","year":"2003","unstructured":"Bergstra J.A., Bethke I.: Polarized process algebra and program equivalence. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) Proceedings 30th ICALP, Lecture Notes in Computer Science, vol. 2719, pp. 1\u201321. Springer, New York (2003)"},{"issue":"1","key":"154_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003928","volume":"12","author":"J.A. Bergstra","year":"2000","unstructured":"Bergstra J.A., Loots M.E.: Program algebra for component code. Formal Aspects Comput. 12(1), 1\u201317 (2000)","journal-title":"Formal Aspects Comput."},{"issue":"2","key":"154_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S1567-8326(02)00018-8","volume":"51","author":"J.A. Bergstra","year":"2002","unstructured":"Bergstra J.A., Loots M.E.: Program algebra for sequential code. J. Logic Algebraic Programm. 51(2), 125\u2013156 (2002)","journal-title":"J. Logic Algebraic Programm."},{"issue":"1","key":"154_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00224-006-1337-4","volume":"41","author":"J.A. Bergstra","year":"2007","unstructured":"Bergstra J.A., Middelburg C.A.: A thread algebra with multi-level strategic interleaving. Theory Comput. Syst. 41(1), 3\u201332 (2007)","journal-title":"Theory Comput. Syst."},{"key":"154_CR7","unstructured":"Bergstra, J.A., Middelburg, C.A.: Instruction sequences and non-uniform complexity theory. arXiv:0809.0352v3 [cs.CC] (2008)"},{"issue":"4","key":"154_CR8","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.jal.2008.07.001","volume":"6","author":"J.A. Bergstra","year":"2008","unstructured":"Bergstra J.A., Middelburg C.A.: Program algebra with a jump-shift instruction. J. Appl. Logic 6(4), 553\u2013563 (2008)","journal-title":"J. Appl. Logic"},{"key":"154_CR9","unstructured":"Bergstra, J.A., Middelburg, C.A.: Autosolvability of halting problem instances for instruction sequences. arXiv:0911.5018v3 [cs.LO] (2009)"},{"key":"154_CR10","unstructured":"Bergstra, J.A., Middelburg, C.A.: Functional units for natural numbers. arXiv:0911.1851v3 [cs.PL] (2009)"},{"key":"154_CR11","unstructured":"Bergstra, J.A., Middelburg, C.A.: Indirect jumps improve instruction sequence performance. arXiv:0909.2089v2 [cs.PL] (2009)"},{"key":"154_CR12","unstructured":"Bergstra, J.A., Middelburg, C.A.: Instruction sequence processing operators. arXiv:0910.5564v4 [cs.LO] (2009)"},{"issue":"3","key":"154_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1017\/S0960129509990314","volume":"20","author":"J.A. Bergstra","year":"2010","unstructured":"Bergstra J.A., Middelburg C.A.: On the operating unit size of load\/store architectures. Math. Struct. Comput. Sci. 20(3), 395\u2013417 (2010)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"7","key":"154_CR14","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.ic.2010.01.004","volume":"208","author":"J.A. Bergstra","year":"2010","unstructured":"Bergstra J.A., Middelburg C.A.: A thread calculus with molecular dynamics. Inform. Comput. 208(7), 817\u2013844 (2010)","journal-title":"Inform. Comput."},{"issue":"3","key":"154_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.jal.2011.03.001","volume":"9","author":"J.A. Bergstra","year":"2011","unstructured":"Bergstra J.A., Middelburg C.A.: Inversive meadows and divisive meadows. J. Appl. Logic 9(3), 203\u2013220 (2011)","journal-title":"J. Appl. Logic"},{"key":"154_CR16","unstructured":"Bergstra, J.A., Middelburg, C.A.: On the behaviours produced by instruction sequences under execution. arXiv:1106.6196v1[cs.PL] (2011)"},{"issue":"2","key":"154_CR17","first-page":"283","volume":"21","author":"J.A. Bergstra","year":"2011","unstructured":"Bergstra J.A., Middelburg C.A.: Thread extraction for polyadic instruction sequences. Sci. Ann. Comput. Sci. 21(2), 283\u2013310 (2011)","journal-title":"Sci. Ann. Comput. Sci."},{"issue":"2","key":"154_CR18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s00224-010-9301-8","volume":"50","author":"J.A. Bergstra","year":"2012","unstructured":"Bergstra J.A., Middelburg C.A.: On the expressiveness of single-pass instruction sequences. Theory Comput. Syst. 50(2), 313\u2013328 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"154_CR19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S1567-8326(02)00020-6","volume":"51","author":"J.A. Bergstra","year":"2002","unstructured":"Bergstra J.A., Ponse A.: Combining programs and state machines. J. Logic Algebr. Programm. 51(2), 175\u2013192 (2002)","journal-title":"J. Logic Algebr. Programm."},{"issue":"1","key":"154_CR20","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.jal.2005.10.013","volume":"5","author":"J.A. Bergstra","year":"2007","unstructured":"Bergstra J.A., Ponse A.: Execution architectures for program algebra. J. Appl. Logic 5(1), 170\u2013192 (2007)","journal-title":"J. Appl. Logic"},{"key":"154_CR21","first-page":"57","volume":"19","author":"J.A. Bergstra","year":"2009","unstructured":"Bergstra J.A., Ponse A.: An instruction sequence semigroup with involutive anti-automorphisms. Sci. Ann. Comput. Sci. 19, 57\u201392 (2009)","journal-title":"Sci. Ann. Comput. Sci."},{"key":"154_CR22","doi-asserted-by":"crossref","unstructured":"Bergstra, J.A., Tucker, J.V.: The rational numbers as an abstract data type. J. ACM 54(2), Article 7 (2007)","DOI":"10.1145\/1219092.1219095"},{"key":"154_CR23","doi-asserted-by":"crossref","unstructured":"Brock, C., Hunt, W.A.: Formally specifying and mechanically verifying programs for the Motorola complex arithmetic processor DSP. In: ICCD \u201997, pp. 31\u201336 (1997)","DOI":"10.1109\/ICCD.1997.628846"},{"key":"154_CR24","doi-asserted-by":"crossref","unstructured":"Hennessy, J., Jouppi, N., Przybylski, S., Rowen, C., Gross, T., Baskett, F., Gill, J.: MIPS: A microprocessor architecture. In: MICRO \u201982, pp. 17\u201322 (1982)","DOI":"10.1145\/1014194.800930"},{"key":"154_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11686-9","volume-title":"Enumerability, Decidability, Computability","author":"H. Hermes","year":"1965","unstructured":"Hermes H.: Enumerability, Decidability, Computability. Springer, Berlin (1965)"},{"key":"154_CR26","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/BF01565439","volume":"112","author":"S.C. Kleene","year":"1936","unstructured":"Kleene S.C.: General recursive functions of natural numbers. Math. Ann. 112, 727\u2013742 (1936)","journal-title":"Math. Ann."},{"issue":"3","key":"154_CR27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/359436.359442","volume":"20","author":"A. Lunde","year":"1977","unstructured":"Lunde A.: Empirical evaluation of some features of instruction set processor architectures. Commun. ACM 20(3), 143\u2013153 (1977)","journal-title":"Commun. ACM"},{"issue":"1","key":"154_CR28","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01752396","volume":"14","author":"N.A. Lynch","year":"1981","unstructured":"Lynch N.A., Blum E.K.: Relative complexity of algebras. Math. Syst. Theory 14(1), 193\u2013214 (1981)","journal-title":"Math. Syst. Theory"},{"key":"154_CR29","first-page":"226","volume-title":"LFCS\u201997, Lecture Notes in Computer Science, vol. 1234","author":"M. Margenstern","year":"1997","unstructured":"Margenstern M.: Decidability and undecidability of the halting problem on Turing machines, a survey. In: Adian, S., Nerode, A. (eds.) LFCS\u201997, Lecture Notes in Computer Science, vol. 1234, pp. 226\u2013236. Springer, New York (1997)"},{"issue":"3","key":"154_CR30","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M.L. Minsky","year":"1961","unstructured":"Minsky M.L.: Recursive unsolvability of Post\u2019s problem of \u201ctag\u201d and other topics in theory of Turing machines. Ann. Math. 74(3), 437\u2013455 (1961)","journal-title":"Ann. Math."},{"key":"154_CR31","unstructured":"Mosses, P.D.: The mathematical semantics of ALGOL 60. Tech. Rep. PRG-12, Programming Research Group, Oxford University (1974)"},{"key":"154_CR32","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.entcs.2005.12.012","volume":"148","author":"P.D. Mosses","year":"2006","unstructured":"Mosses P.D.: Formal semantics of programming languages\u2014an overview. Electron. Notes Theor. Comput. Sci. 148, 41\u201373 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"154_CR33","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/384286.264125","volume":"25","author":"R. Nair","year":"1997","unstructured":"Nair R., Hopkins M.E.: Exploiting instruction level parallelism in processors by caching scheduled groups. SIGARCH Comput. Archit. News 25(2), 13\u201325 (1997)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"154_CR34","doi-asserted-by":"crossref","unstructured":"Ofelt, D., Hennessy, J.L.: Efficient performance prediction for modern microprocessors. In: SIGMETRICS \u201900, pp. 229\u2013239 (2000)","DOI":"10.1145\/345063.339419"},{"issue":"6","key":"154_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/641914.641917","volume":"8","author":"D.A. Patterson","year":"1980","unstructured":"Patterson D.A., Ditzel D.R.: The case for the reduced instruction set computer. SIGARCH Comput. Archit. News 8(6), 25\u201333 (1980)","journal-title":"SIGARCH Comput. Archit. News"},{"issue":"6","key":"154_CR36","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01163965","volume":"13","author":"L.M. Pavlotskaya","year":"1973","unstructured":"Pavlotskaya L.M.: Solvability of the halting problem for certain classes of Turing machines. Math. Notes 13(6), 537\u2013541 (1973)","journal-title":"Math. Notes"},{"key":"154_CR37","first-page":"445","volume-title":"CiE 2006 Lecture Notes in Computer Science vol 3988.","author":"A. Ponse","year":"2006","unstructured":"Ponse A., van der Zwaag M.B.: An introduction to program and thread algebra. In: Beckmann, A. et al. (eds.) CiE 2006 Lecture Notes in Computer Science vol 3988., pp. 445\u2013458. Springer, New York (2006)"},{"key":"154_CR38","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-642-59851-7_2","volume-title":"Algebraic Foundations of Systems Specification","author":"D. Sannella","year":"1999","unstructured":"Sannella D., Tarlecki A.: Algebraic preliminaries. In: Astesiano, E., Kreowski, H.J., Krieg-Br\u00fcckner, B. (eds.) Algebraic Foundations of Systems Specification, pp. 13\u201330. Springer, Berlin (1999)"},{"issue":"2","key":"154_CR39","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","volume":"10","author":"J.C. Shepherdson","year":"1963","unstructured":"Shepherdson J.C., Sturgis H.E.: Computability of recursive functions. J. ACM 10(2), 217\u2013255 (1963)","journal-title":"J. ACM"},{"key":"154_CR40","volume-title":"Introduction to the Theory of Computation","author":"M. Sipser","year":"2006","unstructured":"Sipser M.: Introduction to the Theory of Computation, 2nd edn. Thomson, Boston (2006)","edition":"2"},{"key":"154_CR41","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, Series in Computer Science","author":"J.E. Stoy","year":"1977","unstructured":"Stoy J.E.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, Series in Computer Science. MIT Press, Cambridge (1977)"},{"issue":"5","key":"154_CR42","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/1290168.1290180","volume":"37","author":"D.L. Tennenhouse","year":"2007","unstructured":"Tennenhouse D.L., Wetherall D.J.: Towards an active network architecture. SIGCOMM Comput. Commun. Rev. 37(5), 81\u201394 (2007)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"154_CR43","unstructured":"Tennent, R.D.: A denotational definition of the programming language Pascal. Tech. Rep. TR77-47, Department of Computing and Information Sciences, Queen\u2019s University, Kingston, Ontario, Canada (1977)"},{"key":"154_CR44","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungs problem. Proc. Lond. Math. Soc. Ser. 2 42, 230\u2013265 (1937). Correction: ibid, 43, 544\u2013546 (1937)"},{"key":"154_CR45","first-page":"675","volume-title":"Handbook of Theoretical Computer Science, vol B","author":"M. Wirsing","year":"1990","unstructured":"Wirsing M.: Algebraic specification. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol B, pp. 675\u2013788. Elsevier, Amsterdam (1990)"},{"key":"154_CR46","doi-asserted-by":"crossref","unstructured":"Xia, C., Torrellas, J.: Instruction prefetching of systems codes with layout optimized for reduced cache misses. In: ISCA \u201996, pp. 271\u2013282 (1996)","DOI":"10.1145\/232974.233001"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00236-012-0154-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T20:27:07Z","timestamp":1742761627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-012-0154-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,23]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s00236-012-0154-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2012,3,23]]}}}