{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T08:02:49Z","timestamp":1780300969254,"version":"3.54.0"},"reference-count":83,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004955","name":"Austrian Research Promotion Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.scico.2026.103505","type":"journal-article","created":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T21:23:51Z","timestamp":1777929831000},"page":"103505","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Behavioural theory of reflective algorithms II: Reflective parallel algorithms"],"prefix":"10.1016","volume":"253","author":[{"given":"Klaus-Dieter","family":"Schewe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Flavio","family":"Ferrarotti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.scico.2026.103505_bib0001","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/343369.343384","article-title":"Sequential abstract-state machines capture sequential algorithms","volume":"1","author":"Gurevich","year":"2000","journal-title":"ACM Trans. Comp. Logic"},{"key":"10.1016\/j.scico.2026.103505_bib0002","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2016.08.013","article-title":"A new thesis concerning synchronised parallel computing \u2013 simplified parallel ASM thesis","volume":"649","author":"Ferrarotti","year":"2016","journal-title":"Theor. Comp. Sci."},{"issue":"1","key":"10.1016\/j.scico.2026.103505_bib0003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2020-1978","article-title":"A behavioural theory of recursive algorithms","volume":"177","author":"B\u00f6rger","year":"2020","journal-title":"Fundam. Inform."},{"issue":"5","key":"10.1016\/j.scico.2026.103505_bib0004","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00236-015-0249-7","article-title":"Concurrent abstract state machines","volume":"53","author":"B\u00f6rger","year":"2016","journal-title":"Acta Inform."},{"key":"10.1016\/j.scico.2026.103505_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.scico.2021.102691","article-title":"A logic for reflective ASMs","volume":"210","author":"Schewe","year":"2021","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.scico.2026.103505_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.scico.2022.102864","article-title":"Behavioural theory of reflective algorithms i: reflective sequential algorithms","volume":"223","author":"Schewe","year":"2022","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.scico.2026.103505_bib0007","series-title":"Rigorous State-Based Methods (ABZ 2024)","first-page":"99","article-title":"A lean reflective abstract state machine definition","volume":"14759","author":"B\u00f6rger","year":"2024"},{"issue":"20","key":"10.1016\/j.scico.2026.103505_bib0008","first-page":"3043","article-title":"XML database transformations","volume":"16","author":"Schewe","year":"2010","journal-title":"J. UCS"},{"key":"10.1016\/j.scico.2026.103505_bib0009","series-title":"Structures of Computing \u2013 a Guide to Practice-Oriented Theory","author":"B\u00f6rger","year":"2024"},{"issue":"4","key":"10.1016\/j.scico.2026.103505_bib0010","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/937555.937561","article-title":"Abstract state machines capture parallel algorithms","volume":"4","author":"Blass","year":"2003","journal-title":"ACM Trans. Computational Logic"},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0011","first-page":"19:1","article-title":"Abstract state machines capture parallel algorithms: correction and extension","volume":"9","author":"Blass","year":"2008","journal-title":"ACM Trans. Comp. Logic"},{"key":"10.1016\/j.scico.2026.103505_bib0012","series-title":"Information and Knowledge Bases XXII","first-page":"37","article-title":"Partial updates in complex-value databases","volume":"225","author":"Schewe","year":"2011"},{"key":"10.1016\/j.scico.2026.103505_bib0013","series-title":"Database Programming Languages: Bulk Types and Persistent Data (DBPL 1991)","first-page":"357","article-title":"Type-safe linguistic reflection","author":"Stemple","year":"1991"},{"key":"10.1016\/j.scico.2026.103505_bib0014","series-title":"Rigorous State-Based Methods (ABZ 2025)","first-page":"13","article-title":"Behavioural theory of reflective parallel algorithms","volume":"15728","author":"Schewe","year":"2025"},{"key":"10.1016\/j.scico.2026.103505_bib0015","doi-asserted-by":"crossref","unstructured":"K.-D. Schewe, F. Ferrarotti, Behavioural theory of reflective algorithms ii: reflective parallel algorithms, 2025b. Available at. http:\/\/arxiv.org\/abs\/2508.09053.","DOI":"10.1016\/j.scico.2026.103505"},{"key":"10.1016\/j.scico.2026.103505_bib0016","series-title":"Abstract State Machines","author":"B\u00f6rger","year":"2003"},{"key":"10.1016\/j.scico.2026.103505_bib0017","first-page":"82","article-title":"Background of computation","volume":"92","author":"Blass","year":"2007","journal-title":"Bull. EATCS"},{"key":"10.1016\/j.scico.2026.103505_bib0018","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0168-0072(99)00005-6","article-title":"Choiceless polynomial time","volume":"100","author":"Blass","year":"1999","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1016\/j.scico.2026.103505_bib0019","series-title":"Fully Integrated Data Environments","first-page":"158","article-title":"Type-safe linguistic reflection: a generator technology","author":"Stemple","year":"2000"},{"key":"10.1016\/j.scico.2026.103505_bib0020","series-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","first-page":"127","article-title":"A genetic programming tutorial","author":"Koza","year":"2005"},{"key":"10.1016\/j.scico.2026.103505_bib0021","series-title":"Detection of Intrusions and Malware, and Vulnerability Assessment (DIMVA 2024)","first-page":"416","article-title":"Gluezilla: efficient and scalable software to hardware binding using rowhammer","volume":"14828","author":"Mechelinck","year":"2024"},{"key":"10.1016\/j.scico.2026.103505_bib0022","series-title":"Modeling Companion for Software Practitioners","author":"B\u00f6rger","year":"2018"},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0023","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3390\/cryptography2030013","article-title":"Intrinsic run-time rowhammer PUFs: leveraging the rowhammer effect for run-Time cryptography and improved security","volume":"2","author":"Anagnostopoulos","year":"2018","journal-title":"Cryptogr."},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0024","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1305\/ndjfl\/1039886524","article-title":"On elementary equivalence for equality-free logic","volume":"37","author":"Casanovas","year":"1996","journal-title":"Notre Dame J. Form. Log."},{"key":"10.1016\/j.scico.2026.103505_bib0025","series-title":"Proceedings of the 11th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","first-page":"23","article-title":"Reflection and semantics in LISP","author":"Smith","year":"1984"},{"issue":"4","key":"10.1016\/j.scico.2026.103505_bib0026","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/A:1010035624696","article-title":"Scheme: a interpreter for extended Lambda calculus","volume":"11","author":"Sussman","year":"1998","journal-title":"High. Order Symb. Comput."},{"issue":"1","key":"10.1016\/j.scico.2026.103505_bib0027","first-page":"0","article-title":"Haskell 98","volume":"13","author":"Peyton Jones","year":"2003","journal-title":"J. Funct. Program."},{"issue":"3\u20135","key":"10.1016\/j.scico.2026.103505_bib0028","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/s001650200009","article-title":"POP, a broad-spectrum programming language, 1967\u20132002","volume":"13","author":"Popplestone","year":"2002","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/j.scico.2026.103505_bib0029","series-title":"Advances in Database Technology (EDBT\u201990)","first-page":"269","article-title":"Exceeding the limits of polymorphism in database programming languages","volume":"416","author":"Stemple","year":"1990"},{"key":"10.1016\/j.scico.2026.103505_bib0030","series-title":"1988 Internation Conference on Computer Languages (ICCL 1988)","first-page":"194","article-title":"The precise control of inheritance and the inheritance of theory in the ADABTPL language","author":"Sheard","year":"1988"},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0031","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0096-0551(92)90026-J","article-title":"Inheritance of theory in the ADABTPL language","volume":"17","author":"Sheard","year":"1992","journal-title":"Comput. Lang."},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0032","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/68012.68014","article-title":"Automatic verification of database transaction safety","volume":"14","author":"Sheard","year":"1989","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.scico.2026.103505_bib0033","series-title":"Persistent Object Systems (POS 1994)","first-page":"355","article-title":"START: a linguistic reflection tool using hyper-program technology","author":"Kirby","year":"1995"},{"key":"10.1016\/j.scico.2026.103505_bib0034","series-title":"Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2010)","first-page":"9","article-title":"Self-adaptation applied to peer-set maintenance in chord via a generic autonomic management framework","author":"Tauber","year":"2010"},{"key":"10.1016\/j.scico.2026.103505_bib0035","article-title":"A peer-to-peer middleware framework for resilient persistent programming","volume":"abs\/1006.3724","author":"Dearle","year":"2010","journal-title":"CoRR"},{"key":"10.1016\/j.scico.2026.103505_bib0036","series-title":"Reflection and Hyper-Programming in Persistent Programming Systems","author":"Kirby","year":"1992"},{"key":"10.1016\/j.scico.2026.103505_bib0037","series-title":"Sixth International Conference on Management of Data, (COMAD 1994)","article-title":"Higher-level genericity in object-oriented databases","author":"Schewe","year":"1994"},{"issue":"10","key":"10.1016\/j.scico.2026.103505_bib0038","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/(SICI)1097-024X(199808)28:10<1045::AID-SPE191>3.0.CO;2-F","article-title":"Linguistic reflection in java","volume":"28","author":"Kirby","year":"1998","journal-title":"Softw. Pract. Exp."},{"key":"10.1016\/j.scico.2026.103505_bib0039","series-title":"Persistent Object Systems (POS 1994)","first-page":"332","article-title":"Type-safe linguistic run-time reflection - a practical perspective","author":"Cooper","year":"1995"},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0040","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1006\/jcss.1996.0040","article-title":"Reflective programming in the relational algebra","volume":"52","author":"Van den Bussche","year":"1996","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.scico.2026.103505_bib0041","series-title":"Proceedings of the 1st ACM SIGSOFT Workshop on Self-Managed Systems (WOSS 2004)","first-page":"18","article-title":"Support for feedback and change in self-adaptive systems","author":"Balasubramaniam","year":"2004"},{"issue":"12","key":"10.1016\/j.scico.2026.103505_bib0042","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/1052883.1052897","article-title":"Languages of the future","volume":"39","author":"Sheard","year":"2004","journal-title":"ACM SIGPLAN Not."},{"key":"10.1016\/j.scico.2026.103505_bib0043","series-title":"Semantics, Applications, and Implementation of Program Generation (SAIG 2001)","first-page":"2","article-title":"Accomplishments and research challenges in meta-programming","volume":"2196","author":"Sheard","year":"2001"},{"issue":"1\u20132","key":"10.1016\/j.scico.2026.103505_bib0044","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0304-3975(00)00053-0","article-title":"MetaML and multi-stage programming with explicit annotations","volume":"248","author":"Taha","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.scico.2026.103505_bib0045","series-title":"Semantics, Applications, and Implementation of Program Generation (SAIG 2001)","first-page":"163","article-title":"Dynamically adaptable software with metacomputations in a staged language","volume":"2196","author":"Harrison","year":"2001"},{"key":"10.1016\/j.scico.2026.103505_bib0046","series-title":"Software Process Technology, 8th European Workshop (EWSPT 2001)","first-page":"27","article-title":"Reflection and reification in process system evolution: experience and opportunity","volume":"2077","author":"Greenwood","year":"2001"},{"issue":"2","key":"10.1016\/j.scico.2026.103505_bib0047","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0304-3975(01)00360-7","article-title":"Reflection in conditional rewriting logic","volume":"285","author":"Clavel","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.scico.2026.103505_bib0048","series-title":"All About Maude \u2013 A High-Performance Logical Framework","author":"Clavel","year":"2007"},{"issue":"12","key":"10.1016\/j.scico.2026.103505_bib0049","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/636517.636528","article-title":"Template meta-programming for haskell","volume":"37","author":"Sheard","year":"2002","journal-title":"ACM SIGPLAN Not."},{"key":"10.1016\/j.scico.2026.103505_bib0050","series-title":"Graph Transformation, Specifications, and Nets \u2013in Memory of Hartmut Ehrig","first-page":"201","article-title":"Overview of reconfigurable petri nets","volume":"10800","author":"Padberg","year":"2018"},{"key":"10.1016\/j.scico.2026.103505_bib0051","series-title":"Functional and Logic Programming (FLOPS 2014)","first-page":"86","article-title":"The design and implementation of BER MetaOCaml - system description","volume":"8475","author":"Kiselyov","year":"2014"},{"key":"10.1016\/j.scico.2026.103505_bib0052","doi-asserted-by":"crossref","DOI":"10.1016\/j.scico.2025.103397","article-title":"MetaOCaml: ten years later - System description","volume":"250","author":"Kiselyov","year":"2026","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"10.1016\/j.scico.2026.103505_bib0053","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11424-006-0001-z","article-title":"Studying complex adaptive systems","volume":"19","author":"Holland","year":"2006","journal-title":"J. Syst. Sci. Complex."},{"key":"10.1016\/j.scico.2026.103505_bib0054","series-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland","year":"1992"},{"issue":"12","key":"10.1016\/j.scico.2026.103505_bib0055","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.4249\/scholarpedia.1482","article-title":"Genetic algorithms","volume":"7","author":"Holland","year":"2012","journal-title":"Scholarpedia"},{"key":"10.1016\/j.scico.2026.103505_bib0056","series-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/j.scico.2026.103505_bib0057","article-title":"Genetic Programming - on the Programming of Computers by Means of Natural Selection","author":"Koza","year":"1993"},{"key":"10.1016\/j.scico.2026.103505_bib0058","article-title":"DNA Computing - New Computing Paradigms","author":"P\u0103un","year":"1998"},{"key":"10.1016\/j.scico.2026.103505_bib0059","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2_1","article-title":"Membrane Computing: an Introduction","author":"P\u0103un","year":"2002"},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0060","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/321127.321128","article-title":"Outline for a logical theory of adaptive systems","volume":"9","author":"Holland","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/j.scico.2026.103505_bib0061","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1022602019183","article-title":"Genetic algorithms and machine learning","volume":"3","author":"Goldberg","year":"1988","journal-title":"Mach. Learn."},{"issue":"1\u20133","key":"10.1016\/j.scico.2026.103505_bib0062","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0004-3702(89)90050-7","article-title":"Classifier systems and genetic algorithms","volume":"40","author":"Booker","year":"1989","journal-title":"Artif. Intell."},{"issue":"1","key":"10.1016\/j.scico.2026.103505_bib0063","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","article-title":"Parallel recombinative simulated annealing: a genetic algorithm","volume":"21","author":"Mahfoud","year":"1995","journal-title":"Parallel Comput."},{"issue":"5","key":"10.1016\/j.scico.2026.103505_bib0064","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/s00500-003-0288-9","article-title":"Routine automated synthesis of five patented analog circuits using genetic programming","volume":"8","author":"Koza","year":"2004","journal-title":"Soft Comput."},{"key":"10.1016\/j.scico.2026.103505_bib0065","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.tcs.2016.12.031","article-title":"Evolving reaction systems","volume":"682","author":"Ehrenfeucht","year":"2017","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.scico.2026.103505_bib0066","series-title":"Abstract State Machines, Alloy, B, TLA, VDM, and Z - 4Th International Conference (ABZ 2014)","first-page":"204","article-title":"Towards ASM-based formal specification of self-adaptive systems","volume":"8477","author":"Riccobene","year":"2014"},{"issue":"3","key":"10.1016\/j.scico.2026.103505_bib0067","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1093\/jigpal\/jzw008","article-title":"On the parallel computation thesis","volume":"24","author":"Dershowitz","year":"2016","journal-title":"Log. J. IGPL"},{"issue":"4","key":"10.1016\/j.scico.2026.103505_bib0068","first-page":"765","article-title":"A customised ASM thesis for database transformations","volume":"19","author":"Schewe","year":"2010","journal-title":"Acta Cybern."},{"key":"10.1016\/j.scico.2026.103505_bib0069","series-title":"Abstract State Machines, Alloy, B, VDM, and Z (ABZ 2012)","first-page":"341","article-title":"A simplified parallel ASM thesis","volume":"7316","author":"Schewe","year":"2012"},{"key":"10.1016\/j.scico.2026.103505_bib0070","series-title":"Distributed Algorithms","author":"Lynch","year":"1996"},{"key":"10.1016\/j.scico.2026.103505_bib0071","series-title":"Specification and Validation Methods","first-page":"9","article-title":"Evolving algebras 1993: lipari guide","author":"Gurevich","year":"1995"},{"issue":"9","key":"10.1016\/j.scico.2026.103505_bib0072","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.scico.2026.103505_bib0073","series-title":"Proceedings of the Australasian Computer Science Week Multiconference, (ACSW 2017)","first-page":"77:1","article-title":"Evolving concurrent systems: behavioural theory and logic","author":"Schewe","year":"2017"},{"issue":"2","key":"10.1016\/j.scico.2026.103505_bib0074","first-page":"129","article-title":"Communication in abstract state machines","volume":"23","author":"B\u00f6rger","year":"2017","journal-title":"J. Univ. Comp. Sci."},{"key":"10.1016\/j.scico.2026.103505_bib0075","series-title":"Rigorous State-Based Methods (ABZ 2021)","first-page":"118","article-title":"Towards refinement of unbounded parallelism in ASMs using concurrency and reflection","volume":"12709","author":"Jiang","year":"2021"},{"key":"10.1016\/j.scico.2026.103505_bib0076","doi-asserted-by":"crossref","unstructured":"K.-D. Schewe, F. Ferrarotti, Non-deterministic algorithms \u2013 capture by abstract state machines, 2026. to appear in May.","DOI":"10.1145\/3811032"},{"issue":"4","key":"10.1016\/j.scico.2026.103505_bib0077","first-page":"317","article-title":"A new thesis","volume":"6","author":"Gurevich","year":"1985","journal-title":"Abstr. Am. Math. Soc."},{"key":"10.1016\/j.scico.2026.103505_bib0078","series-title":"Formal Methods (FM 2024)","first-page":"492","article-title":"ASMETA tool set for rigorous system design","volume":"14934","author":"Bombarda","year":"2024"},{"issue":"1\u20132","key":"10.1016\/j.scico.2026.103505_bib0079","first-page":"71","article-title":"CoreASM: an extensible ASM execution engine","volume":"77","author":"Farahbod","year":"2007","journal-title":"Fundam. Informaticae"},{"issue":"2","key":"10.1016\/j.scico.2026.103505_bib0080","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/spe.1029","article-title":"The CoreASM modeling framework","volume":"41","author":"Farahbod","year":"2011","journal-title":"Softw. Pract. Exp."},{"key":"10.1016\/j.scico.2026.103505_bib0081","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00165-003-0012-7","article-title":"The ASM refinement method","volume":"15","author":"B\u00f6rger","year":"2003","journal-title":"Form. Asp. Comput."},{"issue":"5","key":"10.1016\/j.scico.2026.103505_bib0082","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1093\/jigpal\/jzx021","article-title":"A complete logic for database abstract state machines","volume":"25","author":"Ferrarotti","year":"2017","journal-title":"Log. J. IGPL"},{"issue":"3\u20134","key":"10.1016\/j.scico.2026.103505_bib0083","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10472-017-9569-3","article-title":"A unifying logic for non-deterministic, parallel and concurrent abstract state machines","volume":"83","author":"Ferrarotti","year":"2018","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642326000717?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642326000717?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T07:25:39Z","timestamp":1780298739000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642326000717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":83,"alternative-id":["S0167642326000717"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2026.103505","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Behavioural theory of reflective algorithms II: Reflective parallel algorithms","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.scico.2026.103505","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103505"}}