{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:12:50Z","timestamp":1772601170368,"version":"3.50.1"},"reference-count":72,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001858","name":"Sweden's Innovation Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001729","name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009527","name":"Myndigheten f\u00f6r Samh\u00e4llsskydd och Beredskap","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009527","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007294","name":"Swedish Civil Contingencies Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007294","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.jlamp.2025.101099","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T03:00:27Z","timestamp":1763694027000},"page":"101099","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Hoare-style logic for unstructured programs"],"prefix":"10.1016","volume":"149","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9921-3257","authenticated-orcid":false,"given":"Didrik","family":"Lundberg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8069-6495","authenticated-orcid":false,"given":"Roberto","family":"Guanciale","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5311-1781","authenticated-orcid":false,"given":"Andreas","family":"Lindner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5432-6442","authenticated-orcid":false,"given":"Mads","family":"Dam","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jlamp.2025.101099_bib0001","series-title":"Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles","first-page":"207","article-title":"seL4: formal verification of an OS kernel","author":"Klein","year":"2009"},{"key":"10.1016\/j.jlamp.2025.101099_bib0002","series-title":"Proceedings of the 3rd International Workshop on Trustworthy Embedded Devices","first-page":"3","article-title":"Machine code verification of a tiny ARM hypervisor","author":"Dam","year":"2013"},{"key":"10.1016\/j.jlamp.2025.101099_bib0003","series-title":"2018 IEEE 31st Computer Security Foundations Symposium (CSF)","first-page":"328","article-title":"Secure compilation of side-channel countermeasures: the case of cryptographic \u201cconstant-time\u201d","author":"Barthe","year":"2018"},{"key":"10.1016\/j.jlamp.2025.101099_bib0004","series-title":"Proceedings of the Ninth ACM International Conference on Embedded Software","first-page":"289","article-title":"ARMor: fully verified software fault isolation","author":"Zhao","year":"2011"},{"issue":"3","key":"10.1016\/j.jlamp.2025.101099_bib0005","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BF00288686","article-title":"Program proving: jumps and functions","volume":"1","author":"Clint","year":"1972","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/j.jlamp.2025.101099_bib0006","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01940782","article-title":"An axiomatic basis for proving total correctness of goto-programs","volume":"16","author":"Wang","year":"1976","journal-title":"BIT Numer. Math."},{"issue":"4","key":"10.1016\/j.jlamp.2025.101099_bib0007","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00289468","article-title":"Axiomatic approach to side effects and general jumps","volume":"7","author":"Kowaltowski","year":"1977","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/j.jlamp.2025.101099_bib0008","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00264021","article-title":"Proof rules for gotos","volume":"11","author":"Arbib","year":"1979","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/j.jlamp.2025.101099_bib0009","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF00264536","article-title":"Goto statements: semantics and deduction systems","volume":"15","author":"De Bruin","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/j.jlamp.2025.101099_bib0010","series-title":"Asian Symposium on Programming Languages and Systems","first-page":"364","article-title":"A typed, compositional logic for a stack-based abstract machine","author":"Benton","year":"2005"},{"issue":"1","key":"10.1016\/j.jlamp.2025.101099_bib0011","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.entcs.2005.09.031","article-title":"A compositional natural semantics and Hoare logic for low-level languages","volume":"156","author":"Saabas","year":"2006","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2025.101099_bib0012","series-title":"Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation","first-page":"80","article-title":"A compositional logic for control flow","author":"Tan","year":"2006"},{"issue":"6","key":"10.1016\/j.jlamp.2025.101099_bib0013","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/1133255.1134028","article-title":"Modular verification of assembly code with stack-based control abstractions","volume":"41","author":"Feng","year":"2006","journal-title":"ACM SIGPLAN Not."},{"key":"10.1016\/j.jlamp.2025.101099_bib0014","series-title":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","first-page":"568","article-title":"Hoare logic for realistically modelled machine code","author":"Myreen","year":"2007"},{"issue":"4","key":"10.1016\/j.jlamp.2025.101099_bib0015","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/262004.262005","article-title":"Nesting of reducible and irreducible loops","volume":"19","author":"Havlak","year":"1997","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"10.1016\/j.jlamp.2025.101099_bib0016","series-title":"Software Engineering and Formal Methods","first-page":"193","article-title":"Hoare-style logic for unstructured programs","author":"Lundberg","year":"2020"},{"key":"10.1016\/j.jlamp.2025.101099_bib0017","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.scico.2019.01.001","article-title":"TrABin: trustworthy analyses of binaries","volume":"174","author":"Lindner","year":"2019","journal-title":"Sci. Comput. Program."},{"issue":"10","key":"10.1016\/j.jlamp.2025.101099_bib0018","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/j.jlamp.2025.101099_bib0019","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00288637","article-title":"Axiomatic approach to total correctness of programs","volume":"3","author":"Manna","year":"1974","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/j.jlamp.2025.101099_bib0020","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jlamp.2025.101099_bib0021","series-title":"Proceedings of the 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation","first-page":"67","article-title":"An open framework for foundational proof-carrying code","author":"Feng","year":"2007"},{"key":"10.1016\/j.jlamp.2025.101099_bib0022","unstructured":"A. Lindner, R. Guanciale, M. Dam, Proof-Producing Symbolic Execution for Binary Code Verification, arXiv: 2304.08848(2023). 10.48550\/arXiv.2304.08848."},{"key":"10.1016\/j.jlamp.2025.101099_bib0023","series-title":"Computer Aided Verification: 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21\u201324, 2020, Proceedings, Part I 32","first-page":"225","article-title":"Validation of abstract side-channel models for computer architectures","author":"Nemati","year":"2020"},{"key":"10.1016\/j.jlamp.2025.101099_bib0024","series-title":"MICRO-54: 54th Annual IEEE\/ACM International Symposium on Microarchitecture","first-page":"578","article-title":"Validation of side-channel models via observation refinement","author":"Buiras","year":"2021"},{"key":"10.1016\/j.jlamp.2025.101099_bib0025","series-title":"International Conference on Interactive Theorem Proving","first-page":"338","article-title":"Directions in ISA specification","author":"Fox","year":"2012"},{"key":"10.1016\/j.jlamp.2025.101099_bib0026","series-title":"Proof-Producing Resolution of Indirect Jumps in the Binary Intermediate Representation BIR","author":"Westerberg","year":"2021"},{"key":"10.1016\/j.jlamp.2025.101099_bib0027","unstructured":"ARM Limited, Arm A-profile A64 Instruction Set Architecture, 2023, https:\/\/developer.arm.com\/documentation\/ddi0596\/2021-03\/Base-Instructions. version 2023-06."},{"key":"10.1016\/j.jlamp.2025.101099_bib0028","unstructured":"A. Danial, Count Lines of Code (cloc), 2020, https:\/\/github.com\/AlDanial\/cloc. version 1.86."},{"key":"10.1016\/j.jlamp.2025.101099_bib0029","series-title":"Proceedings of Symposia in Applied Mathematics","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","author":"Floyd","year":"1967"},{"key":"10.1016\/j.jlamp.2025.101099_bib0030","series-title":"Network and Distributed System Security Symposium","article-title":"No more gotos: decompilation using pattern-independent control-flow structuring and semantic-preserving transformations","author":"Yakdan","year":"2015"},{"key":"10.1016\/j.jlamp.2025.101099_bib0031","series-title":"Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"106","article-title":"Folklore confirmed: reducible flow graphs are exponentially larger","author":"Carter","year":"2003"},{"issue":"1","key":"10.1016\/j.jlamp.2025.101099_bib0032","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF00571463","article-title":"Program proving: coroutines","volume":"2","author":"Clint","year":"1973","journal-title":"Acta Inform."},{"key":"10.1016\/j.jlamp.2025.101099_bib0033","doi-asserted-by":"crossref","DOI":"10.1007\/BF00288660","article-title":"Remarks on \u201cProgram proving: jumps and functions\u201d by M. Clint and C.A.R. Hoare","volume":"6","author":"Ashcroft","year":"1976","journal-title":"Acta Inform."},{"issue":"12","key":"10.1016\/j.jlamp.2025.101099_bib0034","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1145\/358728.358748","article-title":"A critique of the foundations of Hoare-style programming logics","volume":"25","author":"O\u2019Donnell","year":"1982","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/j.jlamp.2025.101099_bib0035","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/319301.319345","article-title":"From system F to typed assembly language","volume":"21","author":"Morrisett","year":"1999","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"10.1016\/j.jlamp.2025.101099_bib0036","series-title":"Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"106","article-title":"Proof-carrying code","author":"Necula","year":"1997"},{"key":"10.1016\/j.jlamp.2025.101099_bib0037","series-title":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","first-page":"247","article-title":"Foundational proof-carrying code","author":"Appel","year":"2001"},{"key":"10.1016\/j.jlamp.2025.101099_bib0038","series-title":"2011 Fifth International Conference on Theoretical Aspects of Software Engineering","first-page":"125","article-title":"A simple model for certifying assembly programs with first-class function pointers","author":"Wang","year":"2011"},{"key":"10.1016\/j.jlamp.2025.101099_bib0039","series-title":"European Symposium on Programming","first-page":"363","article-title":"Building certified libraries for PCC: dynamic storage allocation","author":"Yu","year":"2003"},{"key":"10.1016\/j.jlamp.2025.101099_bib0040","series-title":"Conference Record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"320","article-title":"Certified assembly programming with embedded code pointers","author":"Ni","year":"2006"},{"key":"10.1016\/j.jlamp.2025.101099_bib0041","series-title":"Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation","first-page":"234","article-title":"Mostly-automated verification of low-level programs in computational separation logic","author":"Chlipala","year":"2011"},{"key":"10.1016\/j.jlamp.2025.101099_bib0042","series-title":"Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming","first-page":"391","article-title":"The Bedrock structured programming system: combining generative metaprogramming and Hoare logic in an extensible program verifier","author":"Chlipala","year":"2013"},{"key":"10.1016\/j.jlamp.2025.101099_bib0043","series-title":"2009 33rd Annual IEEE International Computer Software and Applications Conference","first-page":"563","article-title":"Modular certification of low-level intermediate representation programs","volume":"1","author":"Dong","year":"2009"},{"key":"10.1016\/j.jlamp.2025.101099_bib0044","series-title":"Asian Symposium on Programming Languages and Systems","first-page":"275","article-title":"Certify once, trust anywhere: modular certification of bytecode programs for certified virtual machine","author":"Dong","year":"2009"},{"key":"10.1016\/j.jlamp.2025.101099_bib0045","series-title":"Asian Symposium on Programming Languages and Systems","first-page":"245","article-title":"Modular verification of SPARCv8 code","author":"Zha","year":"2018"},{"key":"10.1016\/j.jlamp.2025.101099_bib0046","series-title":"Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation","first-page":"66","article-title":"Certified self-modifying code","author":"Cai","year":"2007"},{"key":"10.1016\/j.jlamp.2025.101099_bib0047","series-title":"Working Conference on Verified Software: Theories, Tools, and Experiments","first-page":"54","article-title":"Combining domain-specific and foundational logics to verify complete software systems","author":"Feng","year":"2008"},{"key":"10.1016\/j.jlamp.2025.101099_bib0048","series-title":"International Workshop on Computer Science Logic","first-page":"182","article-title":"Abstracting allocation: the new new thing","author":"Benton","year":"2006"},{"key":"10.1016\/j.jlamp.2025.101099_bib0049","series-title":"Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","first-page":"1","article-title":"Formalizing and verifying semantic type soundness of a simple compiler","author":"Benton","year":"2007"},{"key":"10.1016\/j.jlamp.2025.101099_bib0050","series-title":"Technical Report","article-title":"Formalizing and Verifying Semantic Type Soundness for a Simple Compiler (preliminary report)","author":"Benton","year":"2007"},{"key":"10.1016\/j.jlamp.2025.101099_bib0051","series-title":"2011 18th Asia-Pacific Software Engineering Conference","first-page":"195","article-title":"Verification of distributed embedded real-time systems and their low-level implementations using timed CSP","author":"Bartels","year":"2011"},{"key":"10.1016\/j.jlamp.2025.101099_bib0052","series-title":"NASA Formal Methods Symposium","first-page":"98","article-title":"Mechanized, compositional verification of low-level code","author":"Bartels","year":"2014"},{"key":"10.1016\/j.jlamp.2025.101099_bib0053","series-title":"A Mechanized Verification Environment for Real-Time Process Algebras and Low-Level Programming Languages","author":"Bartels","year":"2014"},{"key":"10.1016\/j.jlamp.2025.101099_bib0054","doi-asserted-by":"crossref","unstructured":"N. J\u00e4hnig, T. G\u00f6thel, S. Glesner, A Denotational Semantics for Communicating Unstructured Code, arXiv: 1503.04913(2015). 10.48550\/arXiv.1503.04913.","DOI":"10.4204\/EPTCS.178.2"},{"key":"10.1016\/j.jlamp.2025.101099_bib0055","series-title":"International Conference on Software Engineering and Formal Methods","first-page":"61","article-title":"Refinement-based verification of communicating unstructured code","author":"J\u00e4hnig","year":"2016"},{"key":"10.1016\/j.jlamp.2025.101099_bib0056","series-title":"Formal Verification of Low-Level Software","author":"Marti","year":"2008"},{"issue":"1","key":"10.1016\/j.jlamp.2025.101099_bib0057","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/2578855.2535841","article-title":"CakeML: a verified implementation of ML","volume":"49","author":"Kumar","year":"2014","journal-title":"ACM SIGPLAN Not."},{"key":"10.1016\/j.jlamp.2025.101099_bib0058","series-title":"Theorem Proving in Higher Order Logics: Emerging Trends Proceedings","first-page":"170","article-title":"Verification of machine-code implementations of arithmetic functions for cryptography","author":"Myreen","year":"2007"},{"key":"10.1016\/j.jlamp.2025.101099_bib0059","series-title":"2008 Formal Methods in Computer-Aided Design","first-page":"1","article-title":"Machine-code verification for multiple architectures-an application of decompilation into logic","author":"Myreen","year":"2008"},{"key":"10.1016\/j.jlamp.2025.101099_bib0060","series-title":"Technical Report","article-title":"Formal Verification of Machine-Code Programs","author":"Myreen","year":"2009"},{"key":"10.1016\/j.jlamp.2025.101099_bib0061","series-title":"2012 Formal Methods in Computer-Aided Design (FMCAD)","first-page":"78","article-title":"Decompilation into logic\u2014Improved","author":"Myreen","year":"2012"},{"key":"10.1016\/j.jlamp.2025.101099_bib0062","series-title":"Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"107","article-title":"Verified just-in-time compiler on x86","author":"Myreen","year":"2010"},{"key":"10.1016\/j.jlamp.2025.101099_bib0063","series-title":"International Conference on Certified Programs and Proofs","first-page":"66","article-title":"Proof pearl: a verified bignum implementation in x86-64 machine code","author":"Myreen","year":"2013"},{"key":"10.1016\/j.jlamp.2025.101099_bib0064","series-title":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","first-page":"471","article-title":"Translation validation for a verified OS kernel","author":"Sewell","year":"2013"},{"key":"10.1016\/j.jlamp.2025.101099_bib0065","series-title":"5th International Workshop on Systems Software Verification (SSV 10)","article-title":"Correctness proofs for device drivers in embedded systems","author":"Duan","year":"2010"},{"key":"10.1016\/j.jlamp.2025.101099_bib0066","series-title":"Formal Verification of Device Drivers in Embedded Systems","author":"Duan","year":"2013"},{"key":"10.1016\/j.jlamp.2025.101099_bib0067","series-title":"Verified Software: Theories, Tools, and Experiments","first-page":"202","article-title":"AUSPICE: automatic safety property verification for unmodified executables","author":"Tan","year":"2015"},{"key":"10.1016\/j.jlamp.2025.101099_bib0068","series-title":"Proceedings of the 6th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering","first-page":"82","article-title":"Weakest-precondition of unstructured programs","author":"Barnett","year":"2005"},{"key":"10.1016\/j.jlamp.2025.101099_bib0069","series-title":"International Workshop on Formal Aspects in Security and Trust","first-page":"112","article-title":"Proof obligations preserving compilation","author":"Barthe","year":"2005"},{"key":"10.1016\/j.jlamp.2025.101099_bib0070","series-title":"Proceedings of the 2006 ACM Symposium on Applied Computing","first-page":"1835","article-title":"Java bytecode specification and verification","author":"Burdy","year":"2006"},{"issue":"1","key":"10.1016\/j.jlamp.2025.101099_bib0071","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.entcs.2007.02.059","article-title":"Formal translation of bytecode into BoogiePL","volume":"190","author":"Lehner","year":"2007","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2025.101099_bib0072","series-title":"Logics for Low-Level Code and Proof-Preserving Program Transformations","author":"Saabas","year":"2008"}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220825000653?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220825000653?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T04:32:17Z","timestamp":1772598737000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352220825000653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":72,"alternative-id":["S2352220825000653"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2025.101099","relation":{},"ISSN":["2352-2208"],"issn-type":[{"value":"2352-2208","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hoare-style logic for unstructured programs","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2025.101099","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"101099"}}