{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:26:16Z","timestamp":1648833976933},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00224-010-9301-8","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T06:11:43Z","timestamp":1289369503000},"page":"313-328","source":"Crossref","is-referenced-by-count":1,"title":["On the Expressiveness of Single-Pass Instruction Sequences"],"prefix":"10.1007","volume":"50","author":[{"given":"J. A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"C. A.","family":"Middelburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,11]]},"reference":[{"issue":"6","key":"9301_CR1","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":"9301_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45061-0_1","volume-title":"Proceedings 30th ICALP","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.\u00a02719, pp.\u00a01\u201321. Springer, Berlin (2003)"},{"issue":"2","key":"9301_CR3","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.\u00a0Log. Algebr. Program. 51(2), 125\u2013156 (2002)","journal-title":"J.\u00a0Log. Algebr. Program."},{"key":"9301_CR4","first-page":"19","volume":"17","author":"J.A. Bergstra","year":"2007","unstructured":"Bergstra, J.A., Middelburg, C.A.: Instruction sequences with indirect jumps. Sci. Ann. Comput. Sci. 17, 19\u201346 (2007)","journal-title":"Sci. Ann. Comput. Sci."},{"issue":"7\u20138","key":"9301_CR5","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s00236-007-0057-9","volume":"44","author":"J.A. Bergstra","year":"2007","unstructured":"Bergstra, J.A., Middelburg, C.A.: Synchronous cooperation for explicit multi-threading. Acta Inf. 44(7\u20138), 525\u2013569 (2007)","journal-title":"Acta Inf."},{"issue":"6","key":"9301_CR6","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.future.2007.08.001","volume":"24","author":"J.A. Bergstra","year":"2008","unstructured":"Bergstra, J.A., Middelburg, C.A.: Distributed strategic interleaving with load balancing. Future Gener. Comput. Syst. 24(6), 530\u2013548 (2008)","journal-title":"Future Gener. Comput. Syst."},{"key":"9301_CR7","unstructured":"Bergstra, J.A., Middelburg, C.A.: Instruction sequences and non-uniform complexity theory. arXiv:0809.0352v3 [cs.CC] (2008)"},{"issue":"2","key":"9301_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1017\/S0960129507006548","volume":"18","author":"J.A. Bergstra","year":"2008","unstructured":"Bergstra, J.A., Middelburg, C.A.: Maurer computers for pipelined instruction processing. Math. Struct. Comput. Sci. 18(2), 373\u2013409 (2008)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"4","key":"9301_CR9","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.\u00a0Appl. Log. 6(4), 553\u2013563 (2008)","journal-title":"J.\u00a0Appl. Log."},{"key":"9301_CR10","unstructured":"Bergstra, J.A., Middelburg, C.A.: Autosolvability of halting problem instances for instruction sequences. arXiv:0911.5018v2 [cs.LO] (2009)"},{"key":"9301_CR11","unstructured":"Bergstra, J.A., Middelburg, C.A.: Indirect jumps improve instruction sequence performance. arXiv:0909.2089v1 [cs.PL] (2009)"},{"issue":"1\u20132","key":"9301_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.3233\/FI-2009-165","volume":"96","author":"J.A. Bergstra","year":"2009","unstructured":"Bergstra, J.A., Middelburg, C.A.: Instruction sequences with dynamically instantiated instructions. Fundam. Inform. 96(1\u20132), 27\u201348 (2009)","journal-title":"Fundam. Inform."},{"issue":"1","key":"9301_CR13","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.\u00a0Appl. Log. 5(1), 170\u2013192 (2007)","journal-title":"J.\u00a0Appl. Log."},{"issue":"8","key":"9301_CR14","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/363534.363539","volume":"10","author":"D.C. Cooper","year":"1967","unstructured":"Cooper, D.C.: B\u00f6hm and Jacopini\u2019s reduction of flow charts. Commun. ACM 10(8), 463, 473 (1967)","journal-title":"Commun. ACM"},{"key":"9301_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.scico.2006.01.009","volume":"65","author":"T. Fernandes","year":"2007","unstructured":"Fernandes, T., Desharnais, J.: Describing data flow analysis techniques with Kleene algebra. Sci. Comput. Program. 65, 173\u2013194 (2007)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"9301_CR16","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A\u00a0completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"issue":"3","key":"9301_CR17","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427\u2013443 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"9301_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/343369.343378","volume":"1","author":"D. Kozen","year":"2000","unstructured":"Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log. 1(1), 60\u201376 (2000)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"9301_CR19","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":"2","key":"9301_CR20","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":"9301_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/339331.339419","volume-title":"SIGMETRICS \u201900","author":"D. Ofelt","year":"2000","unstructured":"Ofelt, D., Hennessy, J.L.: Efficient performance prediction for modern microprocessors. In: SIGMETRICS \u201900, pp. 229\u2013239 (2000)"},{"issue":"6","key":"9301_CR22","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"},{"key":"9301_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/11780342_46","volume-title":"CiE 2006","author":"A. Ponse","year":"2006","unstructured":"Ponse, A., van\u00a0der Zwaag, M.B.: An introduction to program and thread algebra. In: Beckmann, A., et al. (eds.) CiE 2006. Lecture Notes in Computer Science, vol.\u00a03988, pp.\u00a0445\u2013458. Springer, Berlin (2006)"},{"issue":"1","key":"9301_CR24","first-page":"158","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J.\u00a0ACM 13(1), 158\u2013169 (1966)","journal-title":"J.\u00a0ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00224-010-9301-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T17:31:39Z","timestamp":1592069499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9301-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,11]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9301"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9301-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,11]]}}}