[{"month":"05","publication":"27th International Symposium on Formal Methods","date_updated":"2026-06-22T08:21:09Z","language":[{"iso":"eng"}],"publication_status":"published","_id":"22006","day":"18","department":[{"_id":"ToHe"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783032262196"]},"has_accepted_license":"1","conference":{"location":"Tokyo, Japan","start_date":"2026-05-18","end_date":"2026-05-22","name":"FM: Formal Methods"},"volume":16557,"citation":{"short":"M. Chalupa, T.A. Henzinger, N.E. Sarac, E. Yu, in:, 27th International Symposium on Formal Methods, Springer Nature, 2026, pp. 214–233.","ama":"Chalupa M, Henzinger TA, Sarac NE, Yu E. Quantitative monitoring of Signal First-Order logic. In: <i>27th International Symposium on Formal Methods</i>. Vol 16557. Springer Nature; 2026:214-233. doi:<a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">10.1007/978-3-032-26220-2_11</a>","chicago":"Chalupa, Marek, Thomas A Henzinger, Naci E Sarac, and Emily Yu. “Quantitative Monitoring of Signal First-Order Logic.” In <i>27th International Symposium on Formal Methods</i>, 16557:214–33. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">https://doi.org/10.1007/978-3-032-26220-2_11</a>.","apa":"Chalupa, M., Henzinger, T. A., Sarac, N. E., &#38; Yu, E. (2026). Quantitative monitoring of Signal First-Order logic. In <i>27th International Symposium on Formal Methods</i> (Vol. 16557, pp. 214–233). Tokyo, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">https://doi.org/10.1007/978-3-032-26220-2_11</a>","ieee":"M. Chalupa, T. A. Henzinger, N. E. Sarac, and E. Yu, “Quantitative monitoring of Signal First-Order logic,” in <i>27th International Symposium on Formal Methods</i>, Tokyo, Japan, 2026, vol. 16557, pp. 214–233.","mla":"Chalupa, Marek, et al. “Quantitative Monitoring of Signal First-Order Logic.” <i>27th International Symposium on Formal Methods</i>, vol. 16557, Springer Nature, 2026, pp. 214–33, doi:<a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">10.1007/978-3-032-26220-2_11</a>.","ista":"Chalupa M, Henzinger TA, Sarac NE, Yu E. 2026. Quantitative monitoring of Signal First-Order logic. 27th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 16557, 214–233."},"title":"Quantitative monitoring of Signal First-Order logic","oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"conference","doi":"10.1007/978-3-032-26220-2_11","license":"https://creativecommons.org/licenses/by/4.0/","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported by the European Research Council (ERC) Grants VAMOS (No. 101020093) and HYPER (No. 101055412), and by the Advanced Research and Invention Agency under the Safeguarded AI programme (MSAI-PR01-P047).","alternative_title":["LNCS"],"OA_type":"hybrid","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","full_name":"Chalupa, Marek","first_name":"Marek"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","first_name":"Naci E","last_name":"Sarac"},{"orcid":"0000-0002-4993-773X","last_name":"Yu","full_name":"Yu, Zhengqi","first_name":"Zhengqi","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342"}],"OA_place":"publisher","year":"2026","abstract":[{"lang":"eng","text":"Runtime monitoring checks, during execution, whether a partial signal produced by a hybrid system satisfies its specification. Signal First-Order Logic (SFO) offers expressive real-time specifications over such signals, but currently comes only with Boolean semantics and has no tool support. We provide the first robustness-based quantitative semantics for SFO, enabling the expression and evaluation of rich real-time properties beyond the scope of existing formalisms such as Signal Temporal Logic. To enable online monitoring, we identify a past-time fragment of SFO and give a pastification procedure that transforms bounded-response SFO formulas into equisatisfiable formulas in this fragment. We then develop an efficient runtime monitoring algorithm for this past-time fragment and evaluate its performance on a set of benchmarks, demonstrating the practicality and effectiveness of our approach. To the best of our knowledge, this is the first publicly available prototype for online quantitative monitoring of full SFO."}],"project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"status":"public","page":"214-233","intvolume":"     16557","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-05-18T00:00:00Z","scopus_import":"1","ec_funded":1,"date_created":"2026-06-14T22:01:44Z","das_tickbox":"0","file_date_updated":"2026-06-22T08:18:41Z","article_processing_charge":"No","file":[{"date_updated":"2026-06-22T08:18:41Z","date_created":"2026-06-22T08:18:41Z","file_size":849237,"file_name":"2026_LNCS_Chalupa.pdf","creator":"dernst","success":1,"relation":"main_file","access_level":"open_access","file_id":"22113","content_type":"application/pdf","checksum":"7055199ecb985e9e2e272f4988827067"}],"arxiv":1,"publisher":"Springer Nature","keyword":["Signal first-order logic","Robustness-based quantitative semantics","Online runtime monitoring"],"external_id":{"arxiv":["2603.00728"]},"quality_controlled":"1","oa":1},{"title":"Certificates in AI: Learn but verify","volume":69,"citation":{"ama":"Barrett C, Henzinger TA, Seshia SA. Certificates in AI: Learn but verify. <i>Communications of the ACM</i>. 2026;69(1):66-75. doi:<a href=\"https://doi.org/10.1145/3737447\">10.1145/3737447</a>","chicago":"Barrett, Clark, Thomas A Henzinger, and Sanjit A. Seshia. “Certificates in AI: Learn but Verify.” <i>Communications of the ACM</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3737447\">https://doi.org/10.1145/3737447</a>.","apa":"Barrett, C., Henzinger, T. A., &#38; Seshia, S. A. (2026). Certificates in AI: Learn but verify. <i>Communications of the ACM</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3737447\">https://doi.org/10.1145/3737447</a>","short":"C. Barrett, T.A. Henzinger, S.A. Seshia, Communications of the ACM 69 (2026) 66–75.","mla":"Barrett, Clark, et al. “Certificates in AI: Learn but Verify.” <i>Communications of the ACM</i>, vol. 69, no. 1, Association for Computing Machinery, 2026, pp. 66–75, doi:<a href=\"https://doi.org/10.1145/3737447\">10.1145/3737447</a>.","ieee":"C. Barrett, T. A. Henzinger, and S. A. Seshia, “Certificates in AI: Learn but verify,” <i>Communications of the ACM</i>, vol. 69, no. 1. Association for Computing Machinery, pp. 66–75, 2026.","ista":"Barrett C, Henzinger TA, Seshia SA. 2026. Certificates in AI: Learn but verify. Communications of the ACM. 69(1), 66–75."},"type":"journal_article","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","acknowledgement":"T.A.H. thanks Đorde Žikelic for many stimulating discussions about CML. This work was supported in part by NSFCPS Frontier Grant 1545126, by a BAIR Commons project, by the Berkeley iCy-Phy Center, by the Stanford Center for Automated Reasoning, and by the ERC Advanced Grant 101020093.","doi":"10.1145/3737447","OA_place":"publisher","OA_type":"hybrid","author":[{"first_name":"Clark","full_name":"Barrett, Clark","last_name":"Barrett"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Seshia, Sanjit A.","first_name":"Sanjit A.","last_name":"Seshia"}],"article_type":"original","month":"01","date_updated":"2026-01-21T08:55:24Z","publication":"Communications of the ACM","publication_identifier":{"issn":["0001-0782"],"eissn":["1557-7317"]},"day":"01","department":[{"_id":"ToHe"}],"publication_status":"published","_id":"21012","language":[{"iso":"eng"}],"has_accepted_license":"1","ec_funded":1,"scopus_import":"1","date_published":"2026-01-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"file_date_updated":"2026-01-21T08:52:07Z","article_processing_charge":"Yes (via OA deal)","date_created":"2026-01-20T10:08:21Z","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","file":[{"content_type":"application/pdf","file_id":"21028","checksum":"d909a9091c254b2d18ba014124663f69","success":1,"access_level":"open_access","relation":"main_file","creator":"dernst","file_name":"2026_CommACM_Barrett.pdf","date_created":"2026-01-21T08:52:07Z","date_updated":"2026-01-21T08:52:07Z","file_size":2623108}],"year":"2026","abstract":[{"text":"In certifiable machine learning, AI systems produce not only results but also verifiable certificates that the results can be trusted.","lang":"eng"}],"issue":"1","status":"public","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"intvolume":"        69","PlanS_conform":"1","page":"66-75","corr_author":"1"},{"related_material":{"record":[{"id":"21020","status":"public","relation":"part_of_dissertation"}]},"has_accepted_license":"1","day":"05","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_identifier":{"issn":["2791-4585"]},"language":[{"iso":"eng"}],"_id":"21401","publication_status":"published","date_updated":"2026-03-13T13:37:20Z","month":"03","author":[{"id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","full_name":"Karimi, Mahyar","first_name":"Mahyar","last_name":"Karimi","orcid":"0009-0005-0820-1696"}],"OA_place":"repository","acknowledgement":"This work is part of the project VAMOS, which has received funding from the European\r\nResearch Council (ERC) under grant agreement No. 101020093, and the Austrian Science\r\nFund (FWF) SFB project SpyCoDe F8502.\r\n","alternative_title":["ISTA Master’s Thesis"],"doi":"10.15479/AT-ISTA-21401","type":"dissertation","oa_version":"Published Version","title":"Privacy-preserving runtime verification","citation":{"short":"M. Karimi, Privacy-Preserving Runtime Verification, Institute of Science and Technology Austria, 2026.","ama":"Karimi M. Privacy-preserving runtime verification. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21401\">10.15479/AT-ISTA-21401</a>","chicago":"Karimi, Mahyar. “Privacy-Preserving Runtime Verification.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21401\">https://doi.org/10.15479/AT-ISTA-21401</a>.","apa":"Karimi, M. (2026). <i>Privacy-preserving runtime verification</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21401\">https://doi.org/10.15479/AT-ISTA-21401</a>","mla":"Karimi, Mahyar. <i>Privacy-Preserving Runtime Verification</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21401\">10.15479/AT-ISTA-21401</a>.","ieee":"M. Karimi, “Privacy-preserving runtime verification,” Institute of Science and Technology Austria, 2026.","ista":"Karimi M. 2026. Privacy-preserving runtime verification. Institute of Science and Technology Austria."},"corr_author":"1","page":"60","status":"public","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"},{"grant_number":"F8512","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","name":"Security and Privacy by Design for Complex Systems"}],"abstract":[{"text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\n\r\nIn this thesis, we propose a protocol for privacy-preserving runtime verification of systems against formal sequential specifications. We develop the protocol in two steps. In the first step, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. In the second step, we extend the protocol to ensure that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocol adapts and improves existing techniques used in cryptography, and more specifically, multi-party computation.\r\n\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocol exchanges a single message per observation step, after an initialization phase. This design minimizes communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally.\r\n","lang":"eng"}],"degree_awarded":"MS","year":"2026","keyword":["Privacy-preserving verification","Runtime verification","Monitoring","Reactive functionalities","Cryptographic protocols"],"oa":1,"file":[{"access_level":"open_access","relation":"main_file","checksum":"3f49f05c9d123e14d7adb73d3bc50fe2","content_type":"application/pdf","file_id":"21404","file_size":766048,"date_created":"2026-03-06T14:06:25Z","date_updated":"2026-03-10T15:20:09Z","file_name":"2026_Karimi_Mahyar_Thesis.pdf","creator":"mkarimi"},{"file_size":1243394,"date_updated":"2026-03-06T14:06:25Z","date_created":"2026-03-06T14:06:25Z","file_name":"2026_Karimi_Mahyar_Thesis_src.zip","creator":"mkarimi","relation":"source_file","access_level":"closed","checksum":"8fb9db4b4187e26443369a993427a5ff","content_type":"application/zip","file_id":"21405"}],"publisher":"Institute of Science and Technology Austria","date_created":"2026-03-05T15:20:47Z","file_date_updated":"2026-03-10T15:20:09Z","article_processing_charge":"No","ddc":["000"],"date_published":"2026-03-05T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ec_funded":1},{"doi":"10.5220/0014483200004052","acknowledgement":"This work has been supported by the European Research Council under Grant No.: ERC-2020-AdG\r\n101020093. LLM–based tools have been used as\r\nwriting assistance to help improve presentation.\r\n","OA_type":"green","author":[{"first_name":"Filip","full_name":"Cano Cordoba, Filip","last_name":"Cano Cordoba","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","orcid":"0000-0002-0783-904X"}],"OA_place":"repository","volume":5,"citation":{"ista":"Cano Cordoba F. 2026. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. Proceedings of the 18th International Conference on Agents and Artificial Intelligence. ICAART: International Conference on Agents and Artificial Intelligence vol. 5, 4689–4696.","mla":"Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, vol. 5, Science and Technology Publications, 2026, pp. 4689–96, doi:<a href=\"https://doi.org/10.5220/0014483200004052\">10.5220/0014483200004052</a>.","ieee":"F. Cano Cordoba, “Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants,” in <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, Marbella, Spain, 2026, vol. 5, pp. 4689–4696.","short":"F. Cano Cordoba, in:, Proceedings of the 18th International Conference on Agents and Artificial Intelligence, Science and Technology Publications, 2026, pp. 4689–4696.","apa":"Cano Cordoba, F. (2026). Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i> (Vol. 5, pp. 4689–4696). Marbella, Spain: Science and Technology Publications. <a href=\"https://doi.org/10.5220/0014483200004052\">https://doi.org/10.5220/0014483200004052</a>","ama":"Cano Cordoba F. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In: <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>. Vol 5. Science and Technology Publications; 2026:4689-4696. doi:<a href=\"https://doi.org/10.5220/0014483200004052\">10.5220/0014483200004052</a>","chicago":"Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, 5:4689–96. Science and Technology Publications, 2026. <a href=\"https://doi.org/10.5220/0014483200004052\">https://doi.org/10.5220/0014483200004052</a>."},"title":"Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants","type":"conference","oa_version":"Accepted Version","language":[{"iso":"eng"}],"publication_status":"published","_id":"22103","day":"01","department":[{"_id":"ToHe"}],"publication_identifier":{"issn":["2184-3589"],"eissn":["2184-433X"],"isbn":["9789897587962"]},"conference":{"name":"ICAART: International Conference on Agents and Artificial Intelligence","end_date":"2026-03-08","location":"Marbella, Spain","start_date":"2026-03-05"},"month":"04","researchdata_availability":"no","publication":"Proceedings of the 18th International Conference on Agents and Artificial Intelligence","date_updated":"2026-06-24T08:37:00Z","publisher":"Science and Technology Publications","keyword":["Explainable AI","Large Language Models","Trust in AI"],"quality_controlled":"1","oa":1,"supplementarymaterial":"no","scopus_import":"1","date_published":"2026-04-01T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","das_tickbox":"0","date_created":"2026-06-21T22:03:00Z","article_processing_charge":"No","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"status":"public","corr_author":"1","page":"4689-4696","intvolume":"         5","year":"2026","main_file_link":[{"url":"https://filipcano.org/files/icaart26llm.pdf","open_access":"1"}],"abstract":[{"text":"Modern AI systems increasingly rely on opaque, highly complex models whose inner workings remain inaccessible even to experts. This opacity creates challenges for trust, accountability, and compliance with\r\nemerging regulatory expectations such as the “right to an explanation”. While traditional explainability methods—feature attributions, counterfactuals, surrogate models—and interpretable model classes provide valuable insights for engineers, they often fall short of delivering the contextual, conversational explanations that\r\nreal users expect. Large Language Models (LLMs) offer a promising new avenue for explanation due to their\r\nability to engage interactively, adapt to user needs, and translate technical outputs into more accessible reasoning. However, their tendencies toward hallucination, conflict avoidance, and oversimplification introduce\r\nserious risks when used as explanatory agents. This paper analyzes these opportunities and limitations, examines verification strategies for ensuring explanation fidelity, and situates LLM-generated explanations within\r\nbroader concerns about public trust. The paper concludes by outlining best practices and future research directions for building robust, verifiable, and human-aligned explanation systems.","lang":"eng"}]},{"quality_controlled":"1","publisher":"Cambridge University Press","doi":"10.1017/9781009500678.022","OA_type":"closed access","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy","first_name":"Guy"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"title":"Bidding Games","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-04-26T00:00:00Z","citation":{"short":"G. Avni, T.A. Henzinger, in:,  ‪Nathanaël Fijalkow (Ed.), Games on Graphs. From Logic and Automata to Algorithms, Cambridge University Press, 2026, pp. 529–569.","chicago":"Avni, Guy, and Thomas A Henzinger. “Bidding Games.” In <i>Games on Graphs. From Logic and Automata to Algorithms</i>, edited by  ‪Nathanaël Fijalkow, 529–69. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/9781009500678.022\">https://doi.org/10.1017/9781009500678.022</a>.","ama":"Avni G, Henzinger TA. Bidding Games. In: Fijalkow  ‪Nathanaël, ed. <i>Games on Graphs. From Logic and Automata to Algorithms</i>. Cambridge University Press; 2026:529-569. doi:<a href=\"https://doi.org/10.1017/9781009500678.022\">10.1017/9781009500678.022</a>","apa":"Avni, G., &#38; Henzinger, T. A. (2026). Bidding Games. In  ‪Nathanaël Fijalkow (Ed.), <i>Games on Graphs. From Logic and Automata to Algorithms</i> (pp. 529–569). Cambridge University Press. <a href=\"https://doi.org/10.1017/9781009500678.022\">https://doi.org/10.1017/9781009500678.022</a>","ieee":"G. Avni and T. A. Henzinger, “Bidding Games,” in <i>Games on Graphs. From Logic and Automata to Algorithms</i>,  ‪Nathanaël Fijalkow, Ed. Cambridge University Press, 2026, pp. 529–569.","mla":"Avni, Guy, and Thomas A. Henzinger. “Bidding Games.” <i>Games on Graphs. From Logic and Automata to Algorithms</i>, edited by  ‪Nathanaël Fijalkow, Cambridge University Press, 2026, pp. 529–69, doi:<a href=\"https://doi.org/10.1017/9781009500678.022\">10.1017/9781009500678.022</a>.","ista":"Avni G, Henzinger TA. 2026.Bidding Games. In: Games on Graphs. From Logic and Automata to Algorithms. , 529–569."},"article_processing_charge":"No","editor":[{"last_name":"Fijalkow","first_name":" ‪Nathanaël","full_name":"Fijalkow,  ‪Nathanaël"}],"das_tickbox":"1","date_created":"2026-07-13T10:44:22Z","type":"book_chapter","oa_version":"None","publication_identifier":{"isbn":["9781009500685"],"eisbn":["9781009500678"]},"day":"26","status":"public","department":[{"_id":"ToHe"}],"_id":"22300","publication_status":"published","language":[{"iso":"eng"}],"corr_author":"1","page":"529-569","year":"2026","month":"04","abstract":[{"lang":"eng","text":"As seen in previous chapters, a graph game proceeds by placing a token on one of the vertices and allowing the players to move it throughout the graph to produce an infinite trace, which determines the winner or payoff of the game."}],"date_updated":"2026-07-13T13:32:47Z","publication":"Games on Graphs. From Logic and Automata to Algorithms"},{"article_processing_charge":"No","date_created":"2026-07-13T09:46:46Z","das_tickbox":"1","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-06-30T00:00:00Z","oa":1,"quality_controlled":"1","keyword":["Machine Unlearning","Neuroscience-Inspired Machine Learning","Membership Inference Attacks"],"external_id":{"arxiv":["2410.22374"]},"publisher":"SciTePress","arxiv":1,"abstract":[{"lang":"eng","text":"Modern computer systems store vast amounts of personal data, enabling advances in AI and ML but risking user privacy and trust. For privacy reasons, it is sometimes desired for an ML model to forget part of the data it was trained on. In this paper, we introduce a novel unlearning approach based on Forgetting Neural Networks (FNNs), a neuroscience-inspired architecture that explicitly encodes forgetting through multiplicative decay factors. While FNNs had previously been studied as a theoretical construct, we provide the first concrete implementation and demonstrate their effectiveness for targeted unlearning. We propose several variants with per-neuron forgetting factors, including rank-based assignments guided by activation levels, and evaluate them on MNIST and Fashion-MNIST benchmarks. Our method systematically removes information associated with forget sets while preserving performance on retained data. Membership inference attacks confirm the effectiveness of FNN-based unlearning in erasing information about the training data from the neural network. These results establish FNNs as a promising foundation for efficient and interpretable unlearning. "}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.22374"}],"year":"2026","intvolume":"         2","page":"1536-1546","status":"public","type":"conference","oa_version":"Preprint","title":"Machine unlearning using forgetting neural networks","citation":{"short":"A. Hatua, T. Nguyen, F. Cano Cordoba, A. Sung, in:, Proceedings of the 18th International Conference on Agents and Artificial Intelligence, SciTePress, 2026, pp. 1536–1546.","apa":"Hatua, A., Nguyen, T., Cano Cordoba, F., &#38; Sung, A. (2026). Machine unlearning using forgetting neural networks. In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i> (Vol. 2, pp. 1536–1546). Marbella, Spain: SciTePress. <a href=\"https://doi.org/10.5220/0014326500004052\">https://doi.org/10.5220/0014326500004052</a>","ama":"Hatua A, Nguyen T, Cano Cordoba F, Sung A. Machine unlearning using forgetting neural networks. In: <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>. Vol 2. SciTePress; 2026:1536-1546. doi:<a href=\"https://doi.org/10.5220/0014326500004052\">10.5220/0014326500004052</a>","chicago":"Hatua, Amartya, Trung Nguyen, Filip Cano Cordoba, and Andrew Sung. “Machine Unlearning Using Forgetting Neural Networks.” In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, 2:1536–46. SciTePress, 2026. <a href=\"https://doi.org/10.5220/0014326500004052\">https://doi.org/10.5220/0014326500004052</a>.","ista":"Hatua A, Nguyen T, Cano Cordoba F, Sung A. 2026. Machine unlearning using forgetting neural networks. Proceedings of the 18th International Conference on Agents and Artificial Intelligence. ICAART: International Conference on Agents and Artificial Intelligence vol. 2, 1536–1546.","mla":"Hatua, Amartya, et al. “Machine Unlearning Using Forgetting Neural Networks.” <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, vol. 2, SciTePress, 2026, pp. 1536–46, doi:<a href=\"https://doi.org/10.5220/0014326500004052\">10.5220/0014326500004052</a>.","ieee":"A. Hatua, T. Nguyen, F. Cano Cordoba, and A. Sung, “Machine unlearning using forgetting neural networks,” in <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, Marbella, Spain, 2026, vol. 2, pp. 1536–1546."},"volume":2,"OA_place":"repository","author":[{"full_name":"Hatua, Amartya","first_name":"Amartya","last_name":"Hatua"},{"full_name":"Nguyen, Trung","first_name":"Trung","last_name":"Nguyen"},{"last_name":"Cano Cordoba","full_name":"Cano Cordoba, Filip","first_name":"Filip","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","orcid":"0000-0002-0783-904X"},{"last_name":"Sung","first_name":"Andrew","full_name":"Sung, Andrew"}],"OA_type":"green","doi":"10.5220/0014326500004052","date_updated":"2026-07-16T09:02:53Z","publication":"Proceedings of the 18th International Conference on Agents and Artificial Intelligence","month":"06","conference":{"name":"ICAART: International Conference on Agents and Artificial Intelligence","start_date":"2026-03-05","location":"Marbella, Spain","end_date":"2026-03-08"},"publication_identifier":{"eissn":["2184-433X"],"isbn":["9789897587962"]},"department":[{"_id":"ToHe"}],"day":"30","publication_status":"published","_id":"22294","language":[{"iso":"eng"}]},{"publisher":"Association for Computing Machinery","arxiv":1,"file":[{"date_created":"2026-07-16T09:23:15Z","date_updated":"2026-07-16T09:23:15Z","file_size":3129128,"creator":"dernst","file_name":"2026_ACMFACCT_Cano.pdf","success":1,"access_level":"open_access","relation":"main_file","file_id":"22348","content_type":"application/pdf","checksum":"21e648ea3b529f0df7545ad4b31b0ef4"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["2605.24926"]},"file_date_updated":"2026-07-16T09:23:15Z","article_processing_charge":"Yes","date_created":"2026-07-14T05:32:45Z","das_tickbox":"0","supplementarymaterial":"yes","date_published":"2026-07-01T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","ddc":["000"],"corr_author":"1","page":"4243 - 4275","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"status":"public","abstract":[{"lang":"eng","text":"Runtime fairness is not a one-time constraint but a dynamic property evaluated over a sequence of decisions. To ensure fairness at runtime, it is necessary to account for past decisions, information neglected by conventional, static classifiers. Traditional fairness shields enforce runtime fairness abruptly, by intervening deterministically whenever a sequence of decisions violates the target for a running fairness measure. This motivates our main conceptual contribution: energy shields. An energy shield is a novel, lightweight, adaptive controller that monitors a sequence of decisions and intervenes probabilistically to ensure runtime fairness smoothly, by utilizing physics-inspired energy functions to nudge the sequence toward fairness: the more unfair the decisions, the stronger the nudging force becomes. This makes energy shields the first fairness shields to provide both short-term safety and long-term liveness guarantees. Safety ensures that the running fairness measure stays within a running target interval with high probability, and liveness ensures that the limit of the fairness measure lies within the limit target interval. Intuitively, the short-term specifies the tolerated fairness values and the long-term specifies the desired fairness values. We also provide a synthesis procedure for constructing the least intrusive energy shield for a given target specification, and demonstrate its efficiency experimentally. We evaluate our energy shields against existing fairness shields through the lens of short- and long-term fairness."}],"year":"2026","OA_place":"publisher","OA_type":"gold","author":[{"full_name":"Cano Cordoba, Filip","first_name":"Filip","last_name":"Cano Cordoba","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","orcid":"0000-0002-0783-904X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin","first_name":"Konstantin","last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"}],"doi":"10.1145/3805689.3806807","acknowledgement":"This work has been supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"conference","oa_version":"Published Version","citation":{"ieee":"F. Cano Cordoba, T. A. Henzinger, and K. Kueffner, “Energy shields for fairness,” in <i>Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency</i>, Montreal, Canada, 2026, pp. 4243–4275.","mla":"Cano Cordoba, Filip, et al. “Energy Shields for Fairness.” <i>Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency</i>, Association for Computing Machinery, 2026, pp. 4243–75, doi:<a href=\"https://doi.org/10.1145/3805689.3806807\">10.1145/3805689.3806807</a>.","ista":"Cano Cordoba F, Henzinger TA, Kueffner K. 2026. Energy shields for fairness. Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency. FAccT: Conference on Fairness, Accountability and Transparency, 4243–4275.","ama":"Cano Cordoba F, Henzinger TA, Kueffner K. Energy shields for fairness. In: <i>Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency</i>. Association for Computing Machinery; 2026:4243-4275. doi:<a href=\"https://doi.org/10.1145/3805689.3806807\">10.1145/3805689.3806807</a>","chicago":"Cano Cordoba, Filip, Thomas A Henzinger, and Konstantin Kueffner. “Energy Shields for Fairness.” In <i>Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency</i>, 4243–75. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3805689.3806807\">https://doi.org/10.1145/3805689.3806807</a>.","apa":"Cano Cordoba, F., Henzinger, T. A., &#38; Kueffner, K. (2026). Energy shields for fairness. In <i>Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency</i> (pp. 4243–4275). Montreal, Canada: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3805689.3806807\">https://doi.org/10.1145/3805689.3806807</a>","short":"F. Cano Cordoba, T.A. Henzinger, K. Kueffner, in:, Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency, Association for Computing Machinery, 2026, pp. 4243–4275."},"title":"Energy shields for fairness","has_accepted_license":"1","conference":{"name":"FAccT: Conference on Fairness, Accountability and Transparency","end_date":"2026-06-28","location":"Montreal, Canada","start_date":"2026-06-25"},"publication_status":"published","_id":"22321","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"day":"01","publication":"Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency","date_updated":"2026-07-22T06:15:56Z","month":"07","researchdata_availability":"no"},{"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","type":"conference","title":"Dicey games: Shared sources of randomness in distributed systems","citation":{"short":"L.J. Brice, T.A. Henzinger, K.S. Thejaswini, in:, 41st Annual Symposium on Logic in Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","apa":"Brice, L. J., Henzinger, T. A., &#38; Thejaswini, K. S. (2026). Dicey games: Shared sources of randomness in distributed systems. In <i>41st Annual Symposium on Logic in Computer Science</i> (Vol. 380). Lisbon, Portugal: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.LICS.2026.23\">https://doi.org/10.4230/LIPIcs.LICS.2026.23</a>","ama":"Brice LJ, Henzinger TA, Thejaswini KS. Dicey games: Shared sources of randomness in distributed systems. In: <i>41st Annual Symposium on Logic in Computer Science</i>. Vol 380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.LICS.2026.23\">10.4230/LIPIcs.LICS.2026.23</a>","chicago":"Brice, Leonard J, Thomas A Henzinger, and K. S. Thejaswini. “Dicey Games: Shared Sources of Randomness in Distributed Systems.” In <i>41st Annual Symposium on Logic in Computer Science</i>, Vol. 380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.LICS.2026.23\">https://doi.org/10.4230/LIPIcs.LICS.2026.23</a>.","ista":"Brice LJ, Henzinger TA, Thejaswini KS. 2026. Dicey games: Shared sources of randomness in distributed systems. 41st Annual Symposium on Logic in Computer Science. LICS: Logic in Computer Science, LIPIcs, vol. 380, 23:1-23:26.","mla":"Brice, Leonard J., et al. “Dicey Games: Shared Sources of Randomness in Distributed Systems.” <i>41st Annual Symposium on Logic in Computer Science</i>, vol. 380, 23:1-23:26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.LICS.2026.23\">10.4230/LIPIcs.LICS.2026.23</a>.","ieee":"L. J. Brice, T. A. Henzinger, and K. S. Thejaswini, “Dicey games: Shared sources of randomness in distributed systems,” in <i>41st Annual Symposium on Logic in Computer Science</i>, Lisbon, Portugal, 2026, vol. 380."},"volume":380,"OA_type":"gold","author":[{"full_name":"Brice, Leonard J","first_name":"Leonard J","last_name":"Brice","id":"ce3b3409-db6c-11f0-aa64-ad678f7fd937"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"last_name":"Thejaswini","first_name":"K. S.","full_name":"Thejaswini, K. S."}],"OA_place":"publisher","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\nLéonard Brice: Part of this work was realised when this author was an FNRS aspirant at Université libre de Bruxelles.\r\nK. S. Thejaswini: Part of this work was realised when this author was a post-doctoral researcher at IST Austria.\r\nAcknowledgements We thank all our colleagues who took the time to hear our puzzle and wasted several hours of their research time in pursuit of the optimal bounds for the 3-player matching.\r\npennies problem.\r\n","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.LICS.2026.23","date_updated":"2026-08-03T07:03:28Z","publication":"41st Annual Symposium on Logic in Computer Science","researchdata_availability":"no","month":"07","conference":{"name":"LICS: Logic in Computer Science","location":"Lisbon, Portugal","end_date":"2026-07-23","start_date":"2026-07-20"},"article_number":"23:1-23:26","has_accepted_license":"1","day":"09","department":[{"_id":"ToHe"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959774345"]},"language":[{"iso":"eng"}],"_id":"22617","publication_status":"published","das_tickbox":"0","date_created":"2026-08-02T22:01:52Z","article_processing_charge":"No","file_date_updated":"2026-08-03T07:02:30Z","ddc":["000"],"date_published":"2026-07-09T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","supplementarymaterial":"no","external_id":{"arxiv":["2601.18303"]},"keyword":["Concurrent games","Shared randomness","Topology","Algebraic Geometry"],"quality_controlled":"1","oa":1,"file":[{"file_name":"2026_LIPICSLICS_Brice.pdf","creator":"dernst","file_size":919708,"date_created":"2026-08-03T07:02:30Z","date_updated":"2026-08-03T07:02:30Z","checksum":"5d0ff4d267565188a8b4c7502e1bd243","content_type":"application/pdf","file_id":"22625","access_level":"open_access","relation":"main_file","success":1}],"arxiv":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"lang":"eng","text":"Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says \"Heads\" or \"Tails\". The team wins if all four choices match; otherwise the Devil wins. If all team players randomise independently, they win with probability 1/8; if all players share a common source of randomness, they win with probability 1/2. What happens when each pair of team players shares a source of randomness? Can the team do better than win with probability 1/4? The surprising (and nontrivial) answer is yes!\r\nWe introduce Dicey Games, a formal framework motivated by the study of distributed systems with shared sources of randomness (of which the above example is a specific instance). We characterise the existence, representation and computational complexity of optimal strategies in Dicey Games, and we study the problem of allocating limited sources of randomness optimally within a team."}],"year":"2026","intvolume":"       380","corr_author":"1","status":"public","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}]},{"OA_place":"publisher","author":[{"id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol","full_name":"Kebis, Pavol","last_name":"Kebis"},{"last_name":"LUCA","full_name":"LUCA, FLORIAN","first_name":"FLORIAN"},{"last_name":"OUAKNINE","first_name":"JOEL","full_name":"OUAKNINE, JOEL"},{"last_name":"SCOONES","first_name":"ANDREW","full_name":"SCOONES, ANDREW"},{"last_name":"WORRELL","first_name":"JAMES","full_name":"WORRELL, JAMES"}],"OA_type":"hybrid","doi":"10.1017/etds.2026.10324","acknowledgement":"We thank the anonymous referee for identifying an error in an earlier\r\nversion of the paper. We gratefully acknowledge support from UKRI Frontier Research\r\nGrant EP/X033813/1, ERC grant DynAMiCS (101167561) and DFG grant 389792660 as\r\npart of TRR 248. J.O. is also affiliated with Keble College, Oxford as an Emmy Network\r\nfellow.","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","type":"journal_article","citation":{"short":"P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, J. WORRELL, Ergodic Theory and Dynamical Systems (2026) 1–22.","apa":"Kebis, P., LUCA, F., OUAKNINE, J., SCOONES, A., &#38; WORRELL, J. (2026). Transcendence for Pisot morphic words over an algebraic base. <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/etds.2026.10324\">https://doi.org/10.1017/etds.2026.10324</a>","chicago":"Kebis, Pavol, FLORIAN LUCA, JOEL OUAKNINE, ANDREW SCOONES, and JAMES WORRELL. “Transcendence for Pisot Morphic Words over an Algebraic Base.” <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/etds.2026.10324\">https://doi.org/10.1017/etds.2026.10324</a>.","ama":"Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. Transcendence for Pisot morphic words over an algebraic base. <i>Ergodic Theory and Dynamical Systems</i>. 2026:1-22. doi:<a href=\"https://doi.org/10.1017/etds.2026.10324\">10.1017/etds.2026.10324</a>","ista":"Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. 2026. Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems., 1–22.","mla":"Kebis, Pavol, et al. “Transcendence for Pisot Morphic Words over an Algebraic Base.” <i>Ergodic Theory and Dynamical Systems</i>, Cambridge University Press, 2026, pp. 1–22, doi:<a href=\"https://doi.org/10.1017/etds.2026.10324\">10.1017/etds.2026.10324</a>.","ieee":"P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, and J. WORRELL, “Transcendence for Pisot morphic words over an algebraic base,” <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press, pp. 1–22, 2026."},"title":"Transcendence for Pisot morphic words over an algebraic base","has_accepted_license":"1","_id":"22406","publication_status":"epub_ahead","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0143-3857"],"eissn":["1469-4417"]},"department":[{"_id":"ToHe"},{"_id":"GradSch"}],"day":"10","publication":"Ergodic Theory and Dynamical Systems","date_updated":"2026-08-03T06:17:50Z","month":"07","researchdata_availability":"no","article_type":"original","arxiv":1,"publisher":"Cambridge University Press","oa":1,"quality_controlled":"1","keyword":["balanced-pair algorithm","Cobham’s conjecture","k-Bonacci words","Pisot conjecture","subspace theorem"],"external_id":{"arxiv":["2405.05279"]},"article_processing_charge":"Yes (in subscription journal)","date_created":"2026-07-27T05:53:25Z","das_tickbox":"0","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-07-10T00:00:00Z","scopus_import":"1","supplementarymaterial":"no","ddc":["000"],"PlanS_conform":"1","page":"1-22","mathsc":["11J81","37B10","11J87"],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/etds.2026.10324"}],"abstract":[{"text":"It is known that for a uniform morphic sequence 𝒖 =⟨𝑢𝑛⟩∞\r\n𝑛=0 and an algebraic number 𝛽 such that |𝛽| >1, the number [[𝒖]]𝛽 :=∑∞\r\n𝑛=0(𝑢𝑛/𝛽𝑛) either lies in ℚ⁡(𝛽) or is transcendental. In this paper, we show a similar rational–transcendental dichotomy for sequences defined by irreducible Pisot morphisms on binary alphabets. Subject to the Pisot conjecture (an irreducible Pisot morphism has pure discrete spectrum), we generalise the latter result to arbitrary finite alphabets. In certain cases, we are able to show transcendence of [[𝒖]]𝛽 outright. In particular, for 𝑘 ≥2, if 𝒖 is the k-Bonacci word, then [[𝒖]]𝛽 is transcendental.","lang":"eng"}],"year":"2026"},{"publication_identifier":{"eissn":["1432-0525"],"issn":["0001-5903"]},"day":"09","department":[{"_id":"ToHe"}],"publication_status":"published","_id":"20866","language":[{"iso":"eng"}],"article_number":"43","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"14405"}]},"has_accepted_license":"1","article_type":"original","month":"12","date_updated":"2026-01-05T12:27:41Z","publication":"Acta Informatica","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project SpyCoDe 10.55776/F85, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant VAMOS 101020093. Open access funding provided by Institute of Science and Technology (IST Austria).","doi":"10.1007/s00236-025-00509-8","OA_place":"publisher","author":[{"first_name":"Ezio","full_name":"Bartocci, Ezio","last_name":"Bartocci"},{"first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ana","full_name":"Oliveira da Costa, Ana","last_name":"Oliveira da Costa","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4","orcid":"0000-0002-8741-5799"}],"OA_type":"hybrid","title":"Hypernode automata","volume":62,"citation":{"ista":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Hypernode automata. Acta Informatica. 62(4), 43.","ieee":"E. Bartocci, M. Chalupa, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” <i>Acta Informatica</i>, vol. 62, no. 4. Springer Nature, 2025.","mla":"Bartocci, Ezio, et al. “Hypernode Automata.” <i>Acta Informatica</i>, vol. 62, no. 4, 43, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00236-025-00509-8\">10.1007/s00236-025-00509-8</a>.","apa":"Bartocci, E., Chalupa, M., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2025). Hypernode automata. <i>Acta Informatica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00236-025-00509-8\">https://doi.org/10.1007/s00236-025-00509-8</a>","chicago":"Bartocci, Ezio, Marek Chalupa, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” <i>Acta Informatica</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00236-025-00509-8\">https://doi.org/10.1007/s00236-025-00509-8</a>.","ama":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. <i>Acta Informatica</i>. 2025;62(4). doi:<a href=\"https://doi.org/10.1007/s00236-025-00509-8\">10.1007/s00236-025-00509-8</a>","short":"E. Bartocci, M. Chalupa, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, Acta Informatica 62 (2025)."},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"journal_article","oa_version":"Published Version","status":"public","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"},{"grant_number":"F8502","name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"}],"intvolume":"        62","corr_author":"1","year":"2025","issue":"4","abstract":[{"lang":"eng","text":"In this work, we present hypernode automata as a specification formalism for hyperproperties of systems whose executions may be misaligned among themselves, such as concurrent systems. These automata consist of nodes labeled with hypernode logic formulas and transitions marked with synchronizing actions. Hypernode logic formulas establish relations between sequences of variable values among different system executions. This logic enables both synchronous and asynchronous analysis of traces. In its asynchronous view on execution traces, hypernode formulas establish relations on the order of value changes for each variable without correlating their timing. In both views, the analysis of different execution traces is synchronized through the transitions of hypernode automata. By combining logic’s declarative nature with automata’s procedural power, hypernode automata seamlessly integrate asynchronicity requirements at the node level with synchronicity between node transitions. We show that the model-checking problem for hypernode automata is decidable for specifications where each node specifies either a synchronous or an asynchronous requirement for the system’s executions, but not both."}],"oa":1,"quality_controlled":"1","external_id":{"arxiv":["2305.02836"]},"publisher":"Springer Nature","arxiv":1,"file":[{"file_size":7117003,"date_updated":"2026-01-05T12:26:43Z","date_created":"2026-01-05T12:26:43Z","file_name":"2025_ActaInformatica_Bartocci.pdf","creator":"dernst","access_level":"open_access","relation":"main_file","success":1,"checksum":"06ed45a1218ad8464818803ae2968aaf","content_type":"application/pdf","file_id":"20944"}],"date_published":"2025-12-09T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","ddc":["000"],"file_date_updated":"2026-01-05T12:26:43Z","article_processing_charge":"Yes (via OA deal)","date_created":"2025-12-29T12:07:12Z"},{"year":"2025","abstract":[{"lang":"eng","text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\nIn this work, we propose two novel protocols for the privacy-preserving runtime verification of systems against formal sequential specifications. In our first protocol, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. Our second protocol ensures that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocols adapt and improve existing techniques used in cryptography, and more specifically, multi-party computation.\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocols exchange a single message per observation step, after an initialisation phase. This design minimises communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally."}],"status":"public","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"},{"grant_number":"F8502","name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"}],"corr_author":"1","page":"2774-2787","ddc":["000"],"date_published":"2025-11-22T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_created":"2026-01-20T10:17:10Z","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2026-01-21T07:34:58Z","external_id":{"arxiv":["2505.09276"]},"quality_controlled":"1","oa":1,"file":[{"date_updated":"2026-01-21T07:34:58Z","date_created":"2026-01-21T07:34:58Z","file_size":1241912,"creator":"dernst","file_name":"2025_CCS_HenzingerT.pdf","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"21024","checksum":"615ffddab6c7285158c2953acec6fa6f"}],"publisher":"Association for Computing Machinery","arxiv":1,"month":"11","date_updated":"2026-03-13T13:37:19Z","publication":"Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security","day":"22","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"publication_identifier":{"isbn":["9798400715259"]},"language":[{"iso":"eng"}],"publication_status":"published","_id":"21020","conference":{"start_date":"2025-10-13","location":"Taipei, Taiwan","end_date":"2025-10-17","name":"CCS: Conference on Computer and Communications Security"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"21401"}]},"has_accepted_license":"1","title":"Privacy-preserving runtime verification","citation":{"ista":"Henzinger TA, Karimi M, Thejaswini KS. 2025. Privacy-preserving runtime verification. Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 2774–2787.","ieee":"T. A. Henzinger, M. Karimi, and K. S. Thejaswini, “Privacy-preserving runtime verification,” in <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>, Taipei, Taiwan, 2025, pp. 2774–2787.","mla":"Henzinger, Thomas A., et al. “Privacy-Preserving Runtime Verification.” <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>, Association for Computing Machinery, 2025, pp. 2774–87, doi:<a href=\"https://doi.org/10.1145/3719027.3765137\">10.1145/3719027.3765137</a>.","apa":"Henzinger, T. A., Karimi, M., &#38; Thejaswini, K. S. (2025). Privacy-preserving runtime verification. In <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i> (pp. 2774–2787). Taipei, Taiwan: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3719027.3765137\">https://doi.org/10.1145/3719027.3765137</a>","chicago":"Henzinger, Thomas A, Mahyar Karimi, and K. S. Thejaswini. “Privacy-Preserving Runtime Verification.” In <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>, 2774–87. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3719027.3765137\">https://doi.org/10.1145/3719027.3765137</a>.","ama":"Henzinger TA, Karimi M, Thejaswini KS. Privacy-preserving runtime verification. In: <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>. Association for Computing Machinery; 2025:2774-2787. doi:<a href=\"https://doi.org/10.1145/3719027.3765137\">10.1145/3719027.3765137</a>","short":"T.A. Henzinger, M. Karimi, K.S. Thejaswini, in:, Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2025, pp. 2774–2787."},"oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"conference","acknowledgement":"This work is a part of projects VAMOS that has received fund-ing from the European Research Council (ERC), grant agreementNo 101020093 and the Austrian Science Fund (FWF) SFB projectSpyCoDe F8502.We thank anonymous reviewers for pointing us to related work [ 3] and for their valuable suggestions that improved this paper.","doi":"10.1145/3719027.3765137","OA_type":"hybrid","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","last_name":"Karimi","full_name":"Karimi, Mahyar","first_name":"Mahyar","orcid":"0009-0005-0820-1696"},{"last_name":"Thejaswini","full_name":"Thejaswini, K. S.","first_name":"K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753"}],"OA_place":"publisher"},{"oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"conference","volume":360,"citation":{"ama":"Chalupa M, Henzinger TA, Oliveira da Costa AA. Flavors of quantifiers in hyperlogics. In: <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:20:1-20:18. doi:<a href=\"https://doi.org/10.4230/LIPICS.FSTTCS.2025.20\">10.4230/LIPICS.FSTTCS.2025.20</a>","chicago":"Chalupa, Marek, Thomas A Henzinger, and Ana A Oliveira da Costa. “Flavors of Quantifiers in Hyperlogics.” In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, 360:20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPICS.FSTTCS.2025.20\">https://doi.org/10.4230/LIPICS.FSTTCS.2025.20</a>.","apa":"Chalupa, M., Henzinger, T. A., &#38; Oliveira da Costa, A. A. (2025). Flavors of quantifiers in hyperlogics. In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 360, p. 20:1-20:18). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.FSTTCS.2025.20\">https://doi.org/10.4230/LIPICS.FSTTCS.2025.20</a>","short":"M. Chalupa, T.A. Henzinger, A.A. Oliveira da Costa, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 20:1-20:18.","mla":"Chalupa, Marek, et al. “Flavors of Quantifiers in Hyperlogics.” <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 20:1-20:18, doi:<a href=\"https://doi.org/10.4230/LIPICS.FSTTCS.2025.20\">10.4230/LIPICS.FSTTCS.2025.20</a>.","ieee":"M. Chalupa, T. A. Henzinger, and A. A. Oliveira da Costa, “Flavors of quantifiers in hyperlogics,” in <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Pilani, India, 2025, vol. 360, p. 20:1-20:18.","ista":"Chalupa M, Henzinger TA, Oliveira da Costa AA. 2025. Flavors of quantifiers in hyperlogics. 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 360, 20:1-20:18."},"title":"Flavors of quantifiers in hyperlogics","OA_place":"publisher","OA_type":"gold","author":[{"full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"id":"8b282559-50b0-11ef-861e-d6ace0d92e9b","first_name":"Ana A","full_name":"Oliveira da Costa, Ana A","last_name":"Oliveira da Costa"}],"doi":"10.4230/LIPICS.FSTTCS.2025.20","alternative_title":["LIPIcs"],"acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project SpyCoDe 10.55776/F85 and by the ERC Advanced Grant VAMOS 101020093.","publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","date_updated":"2026-02-11T09:35:04Z","month":"12","has_accepted_license":"1","conference":{"name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science","start_date":"2025-12-17","end_date":"2025-12-19","location":"Pilani, India"},"publication_status":"published","_id":"21089","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"day":"09","file_date_updated":"2026-02-11T09:33:20Z","article_processing_charge":"No","date_created":"2026-01-29T15:39:15Z","ec_funded":1,"scopus_import":"1","date_published":"2025-12-09T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"file":[{"checksum":"8188ee5c7b14193d48eeb655e9bbdc47","content_type":"application/pdf","file_id":"21213","access_level":"open_access","relation":"main_file","success":1,"creator":"dernst","file_name":"2025_LIPIcS_Chalupa.pdf","file_size":933970,"date_updated":"2026-02-11T09:33:20Z","date_created":"2026-02-11T09:33:20Z"}],"oa":1,"quality_controlled":"1","external_id":{"arxiv":["2510.12298"]},"abstract":[{"text":"Hypertrace logic is a sorted first-order logic with separate sorts for time and execution traces. Its formulas specify hyperproperties, which are properties relating multiple traces. In this work, we extend hypertrace logic by introducing trace quantifiers that range over the set of all possible traces. In this extended logic, formulas can quantify over two kinds of trace variables: constrained trace variables, which range over a fixed set of traces defined by the model, and unconstrained trace variables, which can be assigned to any trace. In comparison, hyperlogics such as HyperLTL have only constrained trace quantifiers. We use hypertrace logic to study how different quantifier patterns affect the decidability of the satisfiability problem. We prove that hypertrace logic without constrained trace quantifiers is equivalent to monadic second-order logic of one successor (S1S), and therefore satisfiable, and that the trace-prefixed fragment (all trace quantifiers precede all time quantifiers) is equivalent to HyperQPTL. Moreover, we show that all hypertrace formulas where the only alternation between constrained trace quantifiers is from an existential to a universal quantifier are equisatisfiable to formulas without constraints on their trace variables and, therefore, decidable as well. Our framework allows us to study also time-prefixed hyperlogics, for which we provide new decidability and undecidability results.","lang":"eng"}],"year":"2025","corr_author":"1","page":"20:1-20:18","intvolume":"       360","project":[{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"},{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"status":"public"},{"doi":"10.1007/978-3-032-05435-7_1","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","alternative_title":["LNCS"],"author":[{"orcid":"0000-0002-0783-904X","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","last_name":"Cano Cordoba","full_name":"Cano Cordoba, Filip","first_name":"Filip"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Kueffner","first_name":"Konstantin","full_name":"Kueffner, Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","orcid":"0000-0001-8974-2542"}],"OA_type":"green","OA_place":"repository","citation":{"chicago":"Cano Cordoba, Filip, Thomas A Henzinger, and Konstantin Kueffner. “Algorithmic Fairness: A Runtime Perspective.” In <i>25th International Conference on Runtime Verification</i>, 16087:1–21. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_1\">https://doi.org/10.1007/978-3-032-05435-7_1</a>.","ama":"Cano Cordoba F, Henzinger TA, Kueffner K. Algorithmic fairness: A runtime perspective. In: <i>25th International Conference on Runtime Verification</i>. Vol 16087. Springer Nature; 2025:1-21. doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_1\">10.1007/978-3-032-05435-7_1</a>","apa":"Cano Cordoba, F., Henzinger, T. A., &#38; Kueffner, K. (2025). Algorithmic fairness: A runtime perspective. In <i>25th International Conference on Runtime Verification</i> (Vol. 16087, pp. 1–21). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_1\">https://doi.org/10.1007/978-3-032-05435-7_1</a>","short":"F. Cano Cordoba, T.A. Henzinger, K. Kueffner, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 1–21.","ieee":"F. Cano Cordoba, T. A. Henzinger, and K. Kueffner, “Algorithmic fairness: A runtime perspective,” in <i>25th International Conference on Runtime Verification</i>, Graz, Austria, 2025, vol. 16087, pp. 1–21.","mla":"Cano Cordoba, Filip, et al. “Algorithmic Fairness: A Runtime Perspective.” <i>25th International Conference on Runtime Verification</i>, vol. 16087, Springer Nature, 2025, pp. 1–21, doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_1\">10.1007/978-3-032-05435-7_1</a>.","ista":"Cano Cordoba F, Henzinger TA, Kueffner K. 2025. Algorithmic fairness: A runtime perspective. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 1–21."},"volume":16087,"title":"Algorithmic fairness: A runtime perspective","type":"conference","oa_version":"Preprint","language":[{"iso":"eng"}],"publication_status":"published","_id":"21090","day":"13","department":[{"_id":"ToHe"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783032054357"]},"conference":{"location":"Graz, Austria","end_date":"2025-09-19","start_date":"2025-09-15","name":"RV: Runtime Verification"},"month":"09","publication":"25th International Conference on Runtime Verification","date_updated":"2026-02-16T11:57:00Z","publisher":"Springer Nature","arxiv":1,"external_id":{"arxiv":["2507.20711"]},"oa":1,"quality_controlled":"1","date_published":"2025-09-13T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"date_created":"2026-01-29T16:01:41Z","article_processing_charge":"No","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"status":"public","page":"1-21","corr_author":"1","intvolume":"     16087","year":"2025","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2507.20711","open_access":"1"}],"abstract":[{"lang":"eng","text":"Fairness in AI is traditionally studied as a static property evaluated once, over a fixed dataset. However, real-world AI systems operate sequentially, with outcomes and environments evolving over time. This paper proposes a framework for analysing fairness as a runtime property. Using a minimal yet expressive model based on sequences of coin tosses with possibly evolving biases, we study the problems of monitoring and enforcing fairness expressed in either toss outcomes or coin biases. Since there is no one-size-fits-all solution for either problem, we provide a summary of monitoring and enforcement strategies, parametrised by environment dynamics, prediction horizon, and confidence thresholds. For both problems, we present general results under simple or minimal assumptions. We survey existing solutions for the monitoring problem for Markovian and additive dynamics, and existing solutions for the enforcement problem in static settings with known dynamics."}]},{"year":"2025","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2507.11987","open_access":"1"}],"abstract":[{"lang":"eng","text":"Neural certificates have emerged as a powerful tool in cyber-physical systems control, providing witnesses of correctness. These certificates, such as barrier functions, often learned alongside control policies, once verified, serve as mathematical proofs of system safety. However, traditional formal verification of their defining conditions typically faces scalability challenges due to exhaustive state-space exploration. To address this challenge, we propose a lightweight runtime monitoring framework that integrates real-time verification and does not require access to the underlying control policy. Our monitor observes the system during deployment and performs on-the-fly verification of the certificate over a lookahead region to ensure safety within a finite prediction horizon. We instantiate this framework for ReLU-based control barrier functions and demonstrate its practical effectiveness in a case study. Our approach enables timely detection of safety violations and incorrect certificates with minimal overhead, providing an effective but lightweight alternative to the static verification of the certificates."}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"status":"public","page":"54-72","corr_author":"1","intvolume":"     16087","date_published":"2025-09-13T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"date_created":"2026-01-29T16:03:01Z","article_processing_charge":"No","arxiv":1,"publisher":"Springer Nature","external_id":{"arxiv":["2507.11987"]},"quality_controlled":"1","oa":1,"month":"09","publication":"25th International Conference on Runtime Verification","date_updated":"2026-02-16T11:53:25Z","language":[{"iso":"eng"}],"_id":"21091","publication_status":"published","department":[{"_id":"ToHe"}],"day":"13","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783032054357"],"eissn":["1611-3349"]},"conference":{"start_date":"2025-09-15","location":"Graz, Austria","end_date":"2025-09-19","name":"RV: Runtime Verification"},"volume":16087,"citation":{"apa":"Henzinger, T. A., Kueffner, K., &#38; Yu, E. (2025). Formal verification of neural certificates done dynamically. In <i>25th International Conference on Runtime Verification</i> (Vol. 16087, pp. 54–72). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">https://doi.org/10.1007/978-3-032-05435-7_4</a>","ama":"Henzinger TA, Kueffner K, Yu E. Formal verification of neural certificates done dynamically. In: <i>25th International Conference on Runtime Verification</i>. Vol 16087. Springer Nature; 2025:54-72. doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">10.1007/978-3-032-05435-7_4</a>","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Emily Yu. “Formal Verification of Neural Certificates Done Dynamically.” In <i>25th International Conference on Runtime Verification</i>, 16087:54–72. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">https://doi.org/10.1007/978-3-032-05435-7_4</a>.","short":"T.A. Henzinger, K. Kueffner, E. Yu, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 54–72.","ista":"Henzinger TA, Kueffner K, Yu E. 2025. Formal verification of neural certificates done dynamically. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 54–72.","mla":"Henzinger, Thomas A., et al. “Formal Verification of Neural Certificates Done Dynamically.” <i>25th International Conference on Runtime Verification</i>, vol. 16087, Springer Nature, 2025, pp. 54–72, doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">10.1007/978-3-032-05435-7_4</a>.","ieee":"T. A. Henzinger, K. Kueffner, and E. Yu, “Formal verification of neural certificates done dynamically,” in <i>25th International Conference on Runtime Verification</i>, Graz, Austria, 2025, vol. 16087, pp. 54–72."},"title":"Formal verification of neural certificates done dynamically","oa_version":"Preprint","type":"conference","doi":"10.1007/978-3-032-05435-7_4","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","alternative_title":["LNCS"],"OA_type":"green","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","full_name":"Kueffner, Konstantin","first_name":"Konstantin","last_name":"Kueffner"},{"id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi","first_name":"Zhengqi","last_name":"Yu","orcid":"0000-0002-4993-773X"}],"OA_place":"repository"},{"volume":16087,"citation":{"ama":"Henzinger TA, Kueffner K, Singh V, Sun I. Alignment monitoring. In: <i>25th International Conference on Runtime Verification</i>. Vol 16087. Springer Nature; 2025:140-159. doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">10.1007/978-3-032-05435-7_9</a>","chicago":"Henzinger, Thomas A, Konstantin Kueffner, Vasu Singh, and I Sun. “Alignment Monitoring.” In <i>25th International Conference on Runtime Verification</i>, 16087:140–59. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">https://doi.org/10.1007/978-3-032-05435-7_9</a>.","apa":"Henzinger, T. A., Kueffner, K., Singh, V., &#38; Sun, I. (2025). Alignment monitoring. In <i>25th International Conference on Runtime Verification</i> (Vol. 16087, pp. 140–159). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">https://doi.org/10.1007/978-3-032-05435-7_9</a>","short":"T.A. Henzinger, K. Kueffner, V. Singh, I. Sun, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 140–159.","mla":"Henzinger, Thomas A., et al. “Alignment Monitoring.” <i>25th International Conference on Runtime Verification</i>, vol. 16087, Springer Nature, 2025, pp. 140–59, doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">10.1007/978-3-032-05435-7_9</a>.","ieee":"T. A. Henzinger, K. Kueffner, V. Singh, and I. Sun, “Alignment monitoring,” in <i>25th International Conference on Runtime Verification</i>, Graz, Austria, 2025, vol. 16087, pp. 140–159.","ista":"Henzinger TA, Kueffner K, Singh V, Sun I. 2025. Alignment monitoring. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 140–159."},"title":"Alignment monitoring","type":"conference","oa_version":"Preprint","doi":"10.1007/978-3-032-05435-7_9","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","alternative_title":["LNCS"],"author":[{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kueffner","full_name":"Kueffner, Konstantin","first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","orcid":"0000-0001-8974-2542"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","full_name":"Singh, Vasu","last_name":"Singh"},{"last_name":"Sun","full_name":"Sun, I","first_name":"I"}],"OA_type":"green","OA_place":"repository","month":"09","publication":"25th International Conference on Runtime Verification","date_updated":"2026-02-16T11:56:38Z","language":[{"iso":"eng"}],"publication_status":"published","_id":"21092","department":[{"_id":"ToHe"}],"day":"13","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783032054357"],"eissn":["1611-3349"]},"conference":{"end_date":"2025-09-19","start_date":"2025-09-15","location":"Graz, Austria","name":"RV: Runtime Verification"},"date_published":"2025-09-13T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"date_created":"2026-01-29T16:03:43Z","article_processing_charge":"No","publisher":"Springer Nature","arxiv":1,"external_id":{"arxiv":["2508.00021"]},"quality_controlled":"1","oa":1,"year":"2025","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.00021"}],"abstract":[{"lang":"eng","text":"Formal verification provides assurances that a probabilistic system satisfies its specification—conditioned on the system model being aligned with reality. We propose alignment monitoring to watch that this assumption is justified. We consider a probabilistic model well aligned if it accurately predicts the behaviour of an uncertain system in advance. An alignment score measures this by quantifying the similarity between the model’s predicted and the system’s (unknown) actual distributions. An alignment monitor observes the system at runtime; at each point in time it uses the current state and the model to predict the next state. After the next state is observed, the monitor updates the verdict, which is a high-probability interval estimate for the true alignment score. We utilize tools from sequential forecasting to construct our alignment monitors. Besides a monitor for measuring the expected alignment score, we introduce a differential alignment monitor, designed for comparing two models, and a weighted alignment monitor, which permits task-specific alignment monitoring. We evaluate our monitors experimentally on the PRISM benchmark suite. They are fast, memory-efficient, and detect misalignment early."}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"status":"public","corr_author":"1","page":"140-159","intvolume":"     16087"},{"language":[{"iso":"eng"}],"_id":"21093","publication_status":"published","day":"13","department":[{"_id":"ToHe"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783032054357"]},"conference":{"name":"RV: Runtime Verification","end_date":"2025-09-19","start_date":"2025-09-15","location":"Graz, Austria"},"month":"09","publication":"25th International Conference on Runtime Verification","date_updated":"2026-02-16T11:59:20Z","doi":"10.1007/978-3-032-05435-7_23","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 and in part by the FWF-2022-SFB F8502 (SPyCoDe).","alternative_title":["LNCS"],"OA_type":"green","author":[{"first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"last_name":"Oliveira da Costa","first_name":"Ana A","full_name":"Oliveira da Costa, Ana A","id":"8b282559-50b0-11ef-861e-d6ace0d92e9b"}],"OA_place":"repository","volume":16087,"citation":{"ista":"Chalupa M, Henzinger TA, Oliveira da Costa AA. 2025. Monitoring hypernode logic over infinite domains. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 417–437.","mla":"Chalupa, Marek, et al. “Monitoring Hypernode Logic over Infinite Domains.” <i>25th International Conference on Runtime Verification</i>, vol. 16087, Springer Nature, 2025, pp. 417–37, doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">10.1007/978-3-032-05435-7_23</a>.","ieee":"M. Chalupa, T. A. Henzinger, and A. A. Oliveira da Costa, “Monitoring hypernode logic over infinite domains,” in <i>25th International Conference on Runtime Verification</i>, Graz, Austria, 2025, vol. 16087, pp. 417–437.","apa":"Chalupa, M., Henzinger, T. A., &#38; Oliveira da Costa, A. A. (2025). Monitoring hypernode logic over infinite domains. In <i>25th International Conference on Runtime Verification</i> (Vol. 16087, pp. 417–437). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">https://doi.org/10.1007/978-3-032-05435-7_23</a>","ama":"Chalupa M, Henzinger TA, Oliveira da Costa AA. Monitoring hypernode logic over infinite domains. In: <i>25th International Conference on Runtime Verification</i>. Vol 16087. Springer Nature; 2025:417-437. doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">10.1007/978-3-032-05435-7_23</a>","chicago":"Chalupa, Marek, Thomas A Henzinger, and Ana A Oliveira da Costa. “Monitoring Hypernode Logic over Infinite Domains.” In <i>25th International Conference on Runtime Verification</i>, 16087:417–37. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">https://doi.org/10.1007/978-3-032-05435-7_23</a>.","short":"M. Chalupa, T.A. Henzinger, A.A. Oliveira da Costa, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 417–437."},"title":"Monitoring hypernode logic over infinite domains","oa_version":"Preprint","type":"conference","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"},{"grant_number":"F8502","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy"}],"status":"public","page":"417-437","corr_author":"1","intvolume":"     16087","year":"2025","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.02301"}],"abstract":[{"lang":"eng","text":"We propose a monitoring approach for hyperproperties where the system’s observations range over infinite domains. The specifications are given as formulas of symbolic hypernode logic, an extension of earlier versions of hypernode logic that supports events with data. We demonstrate how to translate terms of symbolic hypernode logic into multi-tape symbolic transducers and we present a monitoring algorithm for universally quantified formulas that is based on this translation. We evaluate our approach against the previous approach for monitoring hypernode logic, and we also compare it to other monitors for hyperproperties."}],"publisher":"Springer Nature","arxiv":1,"external_id":{"arxiv":["2508.02301"]},"oa":1,"quality_controlled":"1","ec_funded":1,"date_published":"2025-09-13T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-01-29T16:04:31Z","article_processing_charge":"No"},{"citation":{"mla":"Henzinger, Thomas A. “Neural Certificates.” <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">10.1109/SYNASC69064.2025.00008</a>.","ieee":"T. A. Henzinger, “Neural Certificates,” in <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>, Timisoara, Romania, 2025.","ista":"Henzinger TA. 2025. Neural Certificates. Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. SYNASC: Symposium on Symbolic and Numeric Algorithms for Scientific Computing.","chicago":"Henzinger, Thomas A. “Neural Certificates.” In <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">https://doi.org/10.1109/SYNASC69064.2025.00008</a>.","ama":"Henzinger TA. Neural Certificates. In: <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">10.1109/SYNASC69064.2025.00008</a>","apa":"Henzinger, T. A. (2025). Neural Certificates. In <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>. Timisoara, Romania: IEEE. <a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">https://doi.org/10.1109/SYNASC69064.2025.00008</a>","short":"T.A. Henzinger, in:, Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE, 2025."},"date_published":"2025-10-01T00:00:00Z","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Neural Certificates","type":"conference","oa_version":"None","date_created":"2026-05-17T22:02:11Z","article_processing_charge":"No","doi":"10.1109/SYNASC69064.2025.00008","publisher":"IEEE","quality_controlled":"1","author":[{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"OA_type":"closed access","month":"10","year":"2025","publication":"Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","date_updated":"2026-05-18T08:34:15Z","abstract":[{"text":"Symbolic datatypes have proved to be central for automated reasoning about dynamical systems. In its basic form, a symbolic datatype for a class of dynamical systems supports the representation of state and transition sets, boolean operations and emptiness checks on such sets, and the transformation of a state set by a transition set. Successful examples of symbolic datatypes include BDDs and SAT for reasoning about finitestate systems, as well as polyhedra and SMT for reasoning about discrete dynamical systems over multidimensional realvalued state spaces. Most automated verification engines are based on such symbolic datatypes.","lang":"eng"}],"language":[{"iso":"eng"}],"publication_status":"published","_id":"21885","day":"01","status":"public","department":[{"_id":"ToHe"}],"publication_identifier":{"eissn":["2470-881X"],"eisbn":["9798331590116"]},"corr_author":"1","conference":{"name":"SYNASC: Symposium on Symbolic and Numeric Algorithms for Scientific Computing","start_date":"2025-09-22","end_date":"2025-09-25","location":"Timisoara, Romania"}},{"year":"2025","abstract":[{"text":"Contract-based design is a promising methodology for taming the complexity of developing sophisticated systems. A formal contract distinguishes between assumptions, which are constraints that the designer of a component puts on the environments in which the component can be used safely, and guarantees, which are promises that the designer asks from the team that implements the component. A theory of formal contracts can be formalized as an interface theory, which supports the composition and refinement of both assumptions and guarantees. Although there is a rich landscape of contract-based design methods that address functional and extra-functional properties, we present the first interface theory designed to ensure system-wide security properties. Our framework provides a refinement relation and a composition operation that support both incremental design and independent implementability. We develop our theory for both stateless and stateful interfaces. Additionally, we introduce information-flow contracts where assumptions and guarantees are sets of flow relations. We use these contracts to illustrate how to enrich information-flow interfaces with a semantic view. We illustrate the applicability of our framework with two examples inspired by the automotive domain.","lang":"eng"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"},{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"}],"status":"public","corr_author":"1","page":"3-48","PlanS_conform":"1","intvolume":"        66","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_published":"2025-05-01T00:00:00Z","ec_funded":1,"date_created":"2024-06-02T22:00:57Z","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2025-12-30T06:50:12Z","file":[{"date_updated":"2025-12-30T06:50:12Z","date_created":"2025-12-30T06:50:12Z","file_size":3860690,"creator":"dernst","file_name":"2025_FormalMethodsSysDesign_Bartocci.pdf","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"20879","checksum":"244a71a916103b8ea08e9d0bab32bcd9"}],"publisher":"Springer Nature","arxiv":1,"external_id":{"isi":["001230084200001"],"arxiv":["2002.06465"]},"oa":1,"quality_controlled":"1","month":"05","article_type":"original","publication":"Formal Methods in System Design","date_updated":"2025-12-30T06:50:51Z","language":[{"iso":"eng"}],"publication_status":"published","_id":"17094","day":"01","department":[{"_id":"ToHe"}],"publication_identifier":{"eissn":["1572-8102"],"issn":["0925-9856"]},"has_accepted_license":"1","related_material":{"record":[{"relation":"shorter_version","status":"public","id":"11355"}]},"citation":{"short":"E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, Formal Methods in System Design 66 (2025) 3–48.","chicago":"Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Information-Flow Interfaces.” <i>Formal Methods in System Design</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10703-024-00447-0\">https://doi.org/10.1007/s10703-024-00447-0</a>.","ama":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Oliveira da Costa A. Information-flow interfaces. <i>Formal Methods in System Design</i>. 2025;66:3-48. doi:<a href=\"https://doi.org/10.1007/s10703-024-00447-0\">10.1007/s10703-024-00447-0</a>","apa":"Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2025). Information-flow interfaces. <i>Formal Methods in System Design</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10703-024-00447-0\">https://doi.org/10.1007/s10703-024-00447-0</a>","mla":"Bartocci, Ezio, et al. “Information-Flow Interfaces.” <i>Formal Methods in System Design</i>, vol. 66, Springer Nature, 2025, pp. 3–48, doi:<a href=\"https://doi.org/10.1007/s10703-024-00447-0\">10.1007/s10703-024-00447-0</a>.","ieee":"E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Information-flow interfaces,” <i>Formal Methods in System Design</i>, vol. 66. Springer Nature, pp. 3–48, 2025.","ista":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Information-flow interfaces. Formal Methods in System Design. 66, 3–48."},"volume":66,"title":"Information-flow interfaces","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","isi":1,"type":"journal_article","doi":"10.1007/s10703-024-00447-0","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 956123 and it was funded in part by the Austrian Science Fund (FWF) project W1255-N23, by the Austrian FWF project ZK-35, by the FWF project SpyCoDe 10.55776/F85 and by the ERC-2020-AdG 101020093. This paper extends the text and the results of the manuscript published at FASE 2022 [1].","author":[{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"id":"f347ec37-6676-11ee-b395-a888cb7b4fb4","full_name":"Oliveira da Costa, Ana","first_name":"Ana","last_name":"Oliveira da Costa","orcid":"0000-0002-8741-5799"}],"OA_type":"hybrid","OA_place":"publisher"},{"OA_place":"publisher","author":[{"id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","full_name":"Muroya Lei, Stefanie","first_name":"Stefanie","last_name":"Muroya Lei"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"OA_type":"hybrid","doi":"10.1073/pnas.2419273122","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","acknowledgement":"We thank the reviewers. In particular, they inspired us to analyze the reset and state-preparation problems, to compute optimal qubit mappings, and to apply our method to a quantum error correction scheme that includes both bitflip and phaseflip corrections. We also thank Raimundo Saona and Marek Chalupa for their time spent in insightful discussions. This research was partially supported by the European Research Council CoG 863818 (ForM-SMArt) grant.","isi":1,"tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"oa_version":"Published Version","type":"journal_article","citation":{"apa":"Muroya Lei, S., Chatterjee, K., &#38; Henzinger, T. A. (2025). Hardware-optimal quantum algorithms. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2419273122\">https://doi.org/10.1073/pnas.2419273122</a>","chicago":"Muroya Lei, Stefanie, Krishnendu Chatterjee, and Thomas A Henzinger. “Hardware-Optimal Quantum Algorithms.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2025. <a href=\"https://doi.org/10.1073/pnas.2419273122\">https://doi.org/10.1073/pnas.2419273122</a>.","ama":"Muroya Lei S, Chatterjee K, Henzinger TA. Hardware-optimal quantum algorithms. <i>Proceedings of the National Academy of Sciences</i>. 2025;122(12). doi:<a href=\"https://doi.org/10.1073/pnas.2419273122\">10.1073/pnas.2419273122</a>","short":"S. Muroya Lei, K. Chatterjee, T.A. Henzinger, Proceedings of the National Academy of Sciences 122 (2025).","ista":"Muroya Lei S, Chatterjee K, Henzinger TA. 2025. Hardware-optimal quantum algorithms. Proceedings of the National Academy of Sciences. 122(12), e2419273122.","mla":"Muroya Lei, Stefanie, et al. “Hardware-Optimal Quantum Algorithms.” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 12, e2419273122, National Academy of Sciences, 2025, doi:<a href=\"https://doi.org/10.1073/pnas.2419273122\">10.1073/pnas.2419273122</a>.","ieee":"S. Muroya Lei, K. Chatterjee, and T. A. Henzinger, “Hardware-optimal quantum algorithms,” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 12. National Academy of Sciences, 2025."},"volume":122,"title":"Hardware-optimal quantum algorithms","has_accepted_license":"1","article_number":"e2419273122","related_material":{"link":[{"relation":"software","url":"https://github.com/smml1996/algorithm_synthesis"},{"url":"https://ista.ac.at/en/news/hardware-optimal-quantum-algorithms/","description":"News on ISTA website","relation":"press_release"}]},"_id":"19499","publication_status":"published","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"day":"25","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication":"Proceedings of the National Academy of Sciences","date_updated":"2026-04-28T13:41:14Z","month":"03","article_type":"original","publisher":"National Academy of Sciences","file":[{"file_id":"19524","content_type":"application/pdf","checksum":"83501b8a65ee5fdd3f5604fc28eddc22","success":1,"access_level":"open_access","relation":"main_file","creator":"dernst","file_name":"2025_PNAS_Muroya.pdf","date_updated":"2025-04-07T11:42:22Z","date_created":"2025-04-07T11:42:22Z","file_size":6805668}],"oa":1,"quality_controlled":"1","external_id":{"isi":["001459435600001"],"pmid":["40106357"]},"file_date_updated":"2025-04-07T11:42:22Z","article_processing_charge":"Yes (in subscription journal)","date_created":"2025-04-06T22:01:32Z","ec_funded":1,"scopus_import":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2025-03-25T00:00:00Z","pmid":1,"ddc":["000"],"corr_author":"1","intvolume":"       122","project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"status":"public","abstract":[{"lang":"eng","text":"Quantum hardware is inherently fragile and noisy. We find that the accuracy of traditional quantum error correction algorithms can be improved depending on the hardware. Given different hardware specifications, we automatically synthesize hardware-optimal algorithms for parity correction, qubit resetting, and GHZ (Greenberger–Horne–Zeilinger) state preparation. Using stochastic techniques from computer science, our method presents a computational tool to compute exact accuracy guarantees and synthesize optimal algorithms that are often different from traditional ones. We also show that improvements can be gained with respect to the Qiskit transpiler as we compute the hardware-optimal qubit mapping for the GHZ state-preparation problem."}],"issue":"12","year":"2025"},{"ec_funded":1,"date_published":"2025-04-11T00:00:00Z","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_created":"2025-05-11T22:02:39Z","quality_controlled":"1","oa":1,"external_id":{"arxiv":["2412.11994"]},"publisher":"Association for the Advancement of Artificial Intelligence","arxiv":1,"year":"2025","issue":"15","abstract":[{"lang":"eng","text":"As AI-based decision-makers increasingly influence human lives, it is a growing concern that their decisions may be unfair or biased with respect to people's protected attributes, such as gender and race. Most existing bias prevention measures provide probabilistic fairness guarantees in the long run, and it is possible that the decisions are biased on any decision sequence of fixed length. We introduce *fairness shielding*, where a symbolic decision-maker---the fairness shield---continuously monitors the sequence of decisions of another deployed black-box decision-maker, and makes interventions so that a given fairness criterion is met while the total intervention costs are minimized. We present four different algorithms for computing fairness shields, among which one guarantees fairness over fixed horizons, and three guarantee fairness periodically after fixed intervals. Given a distribution over future decisions and their intervention costs, our algorithms solve different instances of bounded-horizon optimal control problems with different levels of computational costs and optimality guarantees. Our empirical evaluation demonstrates the effectiveness of these shields in ensuring fairness while maintaining cost efficiency across various scenarios."}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.11994","open_access":"1"}],"status":"public","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"intvolume":"        39","corr_author":"1","page":"15659-15668","title":"Fairness shields: Safeguarding against biased decision makers","citation":{"ieee":"F. Cano Cordoba, T. A. Henzinger, B. Könighofer, K. Kueffner, and K. Mallik, “Fairness shields: Safeguarding against biased decision makers,” in <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>, Philadelphia, PA, United States, 2025, vol. 39, no. 15, pp. 15659–15668.","mla":"Cano Cordoba, Filip, et al. “Fairness Shields: Safeguarding against Biased Decision Makers.” <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>, vol. 39, no. 15, Association for the Advancement of Artificial Intelligence, 2025, pp. 15659–68, doi:<a href=\"https://doi.org/10.1609/aaai.v39i15.33719\">10.1609/aaai.v39i15.33719</a>.","ista":"Cano Cordoba F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. 2025. Fairness shields: Safeguarding against biased decision makers. Proceedings of the 39th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 39, 15659–15668.","chicago":"Cano Cordoba, Filip, Thomas A Henzinger, Bettina Könighofer, Konstantin Kueffner, and Kaushik Mallik. “Fairness Shields: Safeguarding against Biased Decision Makers.” In <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>, 39:15659–68. Association for the Advancement of Artificial Intelligence, 2025. <a href=\"https://doi.org/10.1609/aaai.v39i15.33719\">https://doi.org/10.1609/aaai.v39i15.33719</a>.","ama":"Cano Cordoba F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. Fairness shields: Safeguarding against biased decision makers. In: <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>. Vol 39. Association for the Advancement of Artificial Intelligence; 2025:15659-15668. doi:<a href=\"https://doi.org/10.1609/aaai.v39i15.33719\">10.1609/aaai.v39i15.33719</a>","apa":"Cano Cordoba, F., Henzinger, T. A., Könighofer, B., Kueffner, K., &#38; Mallik, K. (2025). Fairness shields: Safeguarding against biased decision makers. In <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i> (Vol. 39, pp. 15659–15668). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v39i15.33719\">https://doi.org/10.1609/aaai.v39i15.33719</a>","short":"F. Cano Cordoba, T.A. Henzinger, B. Könighofer, K. Kueffner, K. Mallik, in:, Proceedings of the 39th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2025, pp. 15659–15668."},"volume":39,"oa_version":"Preprint","type":"conference","acknowledgement":"This work is partly supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093. It is also partially supported by the State Government of Styria, Austria – Department Zukunftsfonds Steiermark.","doi":"10.1609/aaai.v39i15.33719","OA_place":"repository","author":[{"orcid":"0000-0002-0783-904X","first_name":"Filip","full_name":"Cano Cordoba, Filip","last_name":"Cano Cordoba","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"last_name":"Könighofer","first_name":"Bettina","full_name":"Könighofer, Bettina"},{"orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","full_name":"Kueffner, Konstantin","last_name":"Kueffner"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","first_name":"Kaushik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475"}],"OA_type":"green","month":"04","date_updated":"2026-02-16T12:24:30Z","publication":"Proceedings of the 39th AAAI Conference on Artificial Intelligence","publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"]},"day":"11","department":[{"_id":"ToHe"}],"_id":"19665","publication_status":"published","language":[{"iso":"eng"}],"conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"Philadelphia, PA, United States","start_date":"2025-02-25","end_date":"2025-03-04"}}]