[{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","isi":1,"pmid":1,"day":"25","ec_funded":1,"type":"journal_article","year":"2025","publisher":"National Academy of Sciences","oa_version":"Published Version","fulldoi":"https://doi.org/10.1073/pnas.2419273122","article_number":"e2419273122","status":"public","OA_type":"hybrid","intvolume":"       122","_id":"19499","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"publication":"Proceedings of the National Academy of Sciences","publication_status":"published","abstract":[{"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.","lang":"eng"}],"doi":"10.1073/pnas.2419273122","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"volume":122,"file":[{"success":1,"file_id":"19524","content_type":"application/pdf","relation":"main_file","date_updated":"2025-04-07T11:42:22Z","checksum":"83501b8a65ee5fdd3f5604fc28eddc22","creator":"dernst","file_size":6805668,"access_level":"open_access","file_name":"2025_PNAS_Muroya.pdf","date_created":"2025-04-07T11:42:22Z"}],"quality_controlled":"1","oa":1,"date_created":"2025-04-06T22:01:32Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"scopus_import":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2025-04-07T11:42:22Z","article_processing_charge":"Yes (in subscription journal)","title":"Hardware-optimal quantum algorithms","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.","external_id":{"isi":["001459435600001"],"pmid":["40106357"]},"corr_author":"1","article_type":"original","date_published":"2025-03-25T00:00:00Z","ddc":["000"],"month":"03","related_material":{"link":[{"url":"https://github.com/smml1996/algorithm_synthesis","relation":"software"},{"url":"https://ista.ac.at/en/news/hardware-optimal-quantum-algorithms/","relation":"press_release","description":"News on ISTA website"}]},"date_updated":"2026-04-28T13:41:14Z","author":[{"first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","full_name":"Muroya Lei, Stefanie","last_name":"Muroya Lei"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","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>","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>.","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>","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.","ista":"Muroya Lei S, Chatterjee K, Henzinger TA. 2025. Hardware-optimal quantum algorithms. Proceedings of the National Academy of Sciences. 122(12), e2419273122.","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>.","short":"S. Muroya Lei, K. Chatterjee, T.A. Henzinger, Proceedings of the National Academy of Sciences 122 (2025)."},"issue":"12","OA_place":"publisher"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","isi":1,"day":"01","publisher":"Elsevier","oa_version":"Published Version","year":"2025","ec_funded":1,"type":"journal_article","OA_type":"hybrid","status":"public","fulldoi":"https://doi.org/10.1016/j.scico.2024.103212","article_number":"103212","intvolume":"       240","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"_id":"18169","publication_status":"published","publication":"Science of Computer Programming","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of runtime monitoring. Third-party and best-effort monitoring are especially valuable, yet under-explored areas of runtime monitoring. In this context, third-party monitoring means monitoring with a limited knowledge of the monitored software (as it has been developed by a third party). Best-effort monitoring keeps pace with the monitored software at the cost of possibly imprecise verdicts when keeping up with the monitored software would not be feasible. Most existing monitoring frameworks do not support the combination of third-party and best-effort monitoring because they either require the full access to the monitored code or the ability to process all observable events, or both.\r\nWe present a middleware framework, Vamos, for the runtime monitoring of software. Vamos is explicitly designed to support third-party and best-effort scenarios. The design goals of Vamos are (i) efficiency (tracing events with low overhead), (ii) flexibility (the ability to monitor a variety of different event channels, and to connect to a wide range of monitors), and (iii) ease-of-use. To achieve its goals, Vamos combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\nWe implemented a prototype toolchain for Vamos and conducted a set of experiments demonstrating the usability of the scheme. The results indicate that Vamos enables writing useful yet efficient monitors, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"doi":"10.1016/j.scico.2024.103212","volume":240,"oa":1,"file":[{"access_level":"open_access","file_size":1173677,"file_name":"2024_ScienceCompProg_Chalupa.pdf","date_created":"2025-01-13T09:02:47Z","file_id":"18831","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2025-01-13T09:02:47Z","checksum":"cd93c0c356e479ffccfbe8499b6ba8e2","creator":"dernst"}],"quality_controlled":"1","language":[{"iso":"eng"}],"date_created":"2024-10-06T22:01:10Z","scopus_import":"1","publication_identifier":{"issn":["0167-6423"]},"title":"VAMOS: Middleware for best-effort third-party monitoring","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2025-01-13T09:02:47Z","department":[{"_id":"ToHe"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank the STTT reviewers for their valuable feedback and suggestions.","external_id":{"isi":["001327852600001"]},"corr_author":"1","article_type":"original","ddc":["000"],"date_published":"2025-02-01T00:00:00Z","related_material":{"record":[{"id":"12856","status":"public","relation":"earlier_version"}]},"month":"02","date_updated":"2025-09-09T12:25:29Z","author":[{"full_name":"Chalupa, Marek","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa"},{"last_name":"Mühlböck","first_name":"Fabian","full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177"},{"last_name":"Muroya Lei","first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","full_name":"Muroya Lei, Stefanie"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"citation":{"short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, Science of Computer Programming 240 (2025).","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “VAMOS: Middleware for Best-Effort Third-Party Monitoring.” <i>Science of Computer Programming</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.scico.2024.103212\">https://doi.org/10.1016/j.scico.2024.103212</a>.","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2025. VAMOS: Middleware for best-effort third-party monitoring. Science of Computer Programming. 240(2), 103212.","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “VAMOS: Middleware for best-effort third-party monitoring,” <i>Science of Computer Programming</i>, vol. 240, no. 2. Elsevier, 2025.","mla":"Chalupa, Marek, et al. “VAMOS: Middleware for Best-Effort Third-Party Monitoring.” <i>Science of Computer Programming</i>, vol. 240, no. 2, 103212, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.scico.2024.103212\">10.1016/j.scico.2024.103212</a>.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. VAMOS: Middleware for best-effort third-party monitoring. <i>Science of Computer Programming</i>. 2025;240(2). doi:<a href=\"https://doi.org/10.1016/j.scico.2024.103212\">10.1016/j.scico.2024.103212</a>","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., &#38; Henzinger, T. A. (2025). VAMOS: Middleware for best-effort third-party monitoring. <i>Science of Computer Programming</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.scico.2024.103212\">https://doi.org/10.1016/j.scico.2024.103212</a>"},"OA_place":"publisher","issue":"2"},{"fulldoi":"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27","article_number":"27","status":"public","intvolume":"       313","day":"01","type":"conference","year":"2024","oa_version":"Published Version","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","volume":313,"file":[{"content_type":"application/pdf","file_id":"18184","success":1,"creator":"dernst","date_updated":"2024-10-07T11:10:55Z","relation":"main_file","checksum":"2e75d305a8c817d76a0c7f136ce34f86","file_name":"2024_LIPICs_Maj.pdf","file_size":1764222,"access_level":"open_access","date_created":"2024-10-07T11:10:55Z"}],"quality_controlled":"1","alternative_title":["LIPIcs"],"oa":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"_id":"18175","publication_status":"published","publication":"38th European Conference on Object-Oriented Programming","abstract":[{"text":"Large-scale software repositories are a source of insights for software engineering. They offer an unmatched window into the software development process at scale. Their sheer number and size holds the promise of broadly applicable results. At the same time, that very size presents practical challenges for scaling tools and algorithms to millions of projects. A reasonable approach is to limit studies to representative samples of the population of interest. Broadly applicable conclusions can then be obtained by generalizing to the entire population. The contribution of this paper is a standardized experimental design methodology for choosing the inputs of studies working with large-scale repositories. We advocate for a methodology that clearly lays out what the population of interest is, how to sample it, and that fosters reproducibility. Along the way, we discourage researchers from using extrinsic attributes of projects such as stars, that measure some unclear notion of popularity.","lang":"eng"}],"doi":"10.4230/LIPIcs.ECOOP.2024.27","external_id":{"isi":["001533999700027"]},"acknowledgement":"This work was supported by the Czech Ministry of Education, Youth and Sports under\r\nprogram ERC-CZ, grant agreement LL2325, BigCode (reg. no. CZ.02.1.01/0.0/0.0/15_003/0000421). NSF grants CCF-1910850, CNS-1925644, and CCF-2139612, as well as the GACR EXPRO grant 23-07580X. We would like to thank Digital Ocean for their involuntary contribution of computational resources during the early data gathering phase of our research. We acknoweldge the reviewers of ICSE’22, and thank the reviewers of ECOOP’23 for their encouragments and for sticking around until 2024.","publication_identifier":{"isbn":["9783959773416"],"issn":["1868-8969"]},"scopus_import":"1","department":[{"_id":"ToHe"}],"file_date_updated":"2024-10-07T11:10:55Z","title":"The fault in our stars: Designing reproducible large-scale code analysis experiments","article_processing_charge":"No","date_created":"2024-10-06T22:01:12Z","language":[{"iso":"eng"}],"conference":{"name":"ECOOP: European Conference on Object-Oriented Programming","end_date":"2024-09-20","location":"Vienna, Austria","start_date":"2024-09-16"},"citation":{"short":"P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, J. Vitek, in:, 38th European Conference on Object-Oriented Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","chicago":"Maj, Petr, Stefanie Muroya Lei, Konrad Siek, Luca Di Grazia, and Jan Vitek. “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.” In <i>38th European Conference on Object-Oriented Programming</i>, Vol. 313. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">https://doi.org/10.4230/LIPIcs.ECOOP.2024.27</a>.","ista":"Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. 2024. The fault in our stars: Designing reproducible large-scale code analysis experiments. 38th European Conference on Object-Oriented Programming. ECOOP: European Conference on Object-Oriented Programming, LIPIcs, vol. 313, 27.","ieee":"P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, and J. Vitek, “The fault in our stars: Designing reproducible large-scale code analysis experiments,” in <i>38th European Conference on Object-Oriented Programming</i>, Vienna, Austria, 2024, vol. 313.","mla":"Maj, Petr, et al. “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.” <i>38th European Conference on Object-Oriented Programming</i>, vol. 313, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">10.4230/LIPIcs.ECOOP.2024.27</a>.","ama":"Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. The fault in our stars: Designing reproducible large-scale code analysis experiments. In: <i>38th European Conference on Object-Oriented Programming</i>. Vol 313. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">10.4230/LIPIcs.ECOOP.2024.27</a>","apa":"Maj, P., Muroya Lei, S., Siek, K., Di Grazia, L., &#38; Vitek, J. (2024). The fault in our stars: Designing reproducible large-scale code analysis experiments. In <i>38th European Conference on Object-Oriented Programming</i> (Vol. 313). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">https://doi.org/10.4230/LIPIcs.ECOOP.2024.27</a>"},"date_updated":"2025-12-02T13:48:19Z","author":[{"full_name":"Maj, Petr","first_name":"Petr","last_name":"Maj"},{"first_name":"Stefanie","full_name":"Muroya Lei, Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","last_name":"Muroya Lei"},{"first_name":"Konrad","full_name":"Siek, Konrad","last_name":"Siek"},{"full_name":"Di Grazia, Luca","first_name":"Luca","last_name":"Di Grazia"},{"first_name":"Jan","full_name":"Vitek, Jan","last_name":"Vitek"}],"month":"09","date_published":"2024-09-01T00:00:00Z","ddc":["000"]},{"file":[{"date_created":"2023-01-27T03:18:34Z","file_name":"main.pdf","file_size":662409,"access_level":"open_access","creator":"fmuehlbo","relation":"main_file","checksum":"55426e463fdeafe9777fc3ff635154c7","date_updated":"2023-01-27T03:18:34Z","content_type":"application/pdf","file_id":"12408","success":1}],"alternative_title":["IST Austria Technical Report"],"oa":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"publication_status":"published","_id":"12407","doi":"10.15479/AT:ISTA:12407","abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"fulldoi":"https://doi.org/10.15479/AT:ISTA:12407","status":"public","day":"27","year":"2023","type":"technical_report","ec_funded":1,"publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria; 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>","mla":"Chalupa, Marek, et al. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., &#38; Henzinger, T. A. (2023). <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 38p.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>.","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023."},"date_updated":"2025-09-09T12:25:29Z","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa"},{"last_name":"Mühlböck","orcid":"0000-0003-1548-0177","first_name":"Fabian","full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425"},{"last_name":"Muroya Lei","full_name":"Muroya Lei, Stefanie","first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"12856"}]},"month":"01","page":"38","date_published":"2023-01-27T00:00:00Z","ddc":["005"],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","corr_author":"1","publication_identifier":{"eissn":["2664-1690"]},"file_date_updated":"2023-01-27T03:18:34Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","date_created":"2023-01-27T03:18:08Z","language":[{"iso":"eng"}],"keyword":["runtime monitoring","best effort","third party"]},{"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"doi":"10.1007/978-3-031-30826-0_15","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"_id":"12856","publication":"Fundamental Approaches to Software Engineering","publication_status":"published","alternative_title":["LNCS"],"oa":1,"quality_controlled":"1","file":[{"file_name":"2023_LNCS_ChalupaM.pdf","file_size":580828,"access_level":"open_access","date_created":"2023-04-25T07:16:36Z","success":1,"file_id":"12865","content_type":"application/pdf","creator":"dernst","checksum":"17a7c8e08be609cf2408d37ea55e322c","date_updated":"2023-04-25T07:16:36Z","relation":"main_file"}],"volume":13991,"has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"oa_version":"Published Version","publisher":"Springer Nature","type":"conference","year":"2023","ec_funded":1,"day":"20","intvolume":"     13991","status":"public","fulldoi":"https://doi.org/10.1007/978-3-031-30826-0_15","ddc":["000"],"date_published":"2023-04-20T00:00:00Z","page":"260-281","related_material":{"record":[{"id":"18169","status":"public","relation":"later_version"},{"status":"public","id":"12407","relation":"earlier_version"}]},"month":"04","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa"},{"last_name":"Mühlböck","first_name":"Fabian","full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177"},{"id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","first_name":"Stefanie","full_name":"Muroya Lei, Stefanie","last_name":"Muroya Lei"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"date_updated":"2025-09-09T12:25:29Z","citation":{"apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., &#38; Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In <i>Fundamental Approaches to Software Engineering</i> (Vol. 13991, pp. 260–281). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">https://doi.org/10.1007/978-3-031-30826-0_15</a>","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort third-party monitoring. In: <i>Fundamental Approaches to Software Engineering</i>. Vol 13991. Springer Nature; 2023:260-281. doi:<a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">10.1007/978-3-031-30826-0_15</a>","mla":"Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” <i>Fundamental Approaches to Software Engineering</i>, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:<a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">10.1007/978-3-031-30826-0_15</a>.","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware for best-effort third-party monitoring,” in <i>Fundamental Approaches to Software Engineering</i>, Paris, France, 2023, vol. 13991, pp. 260–281.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” In <i>Fundamental Approaches to Software Engineering</i>, 13991:260–81. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">https://doi.org/10.1007/978-3-031-30826-0_15</a>.","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware for best-effort third-party monitoring. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281."},"conference":{"start_date":"2023-04-22","end_date":"2023-04-27","location":"Paris, France","name":"FASE: Fundamental Approaches to Software Engineering"},"language":[{"iso":"eng"}],"date_created":"2023-04-20T08:29:42Z","title":"Vamos: Middleware for best-effort third-party monitoring","article_processing_charge":"No","department":[{"_id":"ToHe"}],"file_date_updated":"2023-04-25T07:16:36Z","scopus_import":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308253"],"eisbn":["9783031308260"],"eissn":["1611-3349"]},"corr_author":"1","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","external_id":{"isi":["001284136600015"]}}]