{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T14:16:11Z","timestamp":1788012971299,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032352972","type":"print"},{"value":"9783032352989","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,30]],"date-time":"2026-08-30T00:00:00Z","timestamp":1788048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,30]],"date-time":"2026-08-30T00:00:00Z","timestamp":1788048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-35298-9_24","type":"book-chapter","created":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T13:25:00Z","timestamp":1788009900000},"page":"429-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["StochasticBarrier.jl: A Toolbox for\u00a0Stochastic Barrier Function Synthesis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8440-2551","authenticated-orcid":false,"given":"Rayan","family":"Mazouz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2243-0445","authenticated-orcid":false,"given":"Frederik Baymler","family":"Mathiesen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1190-6097","authenticated-orcid":false,"given":"Luca","family":"Laurenti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7549-4365","authenticated-orcid":false,"given":"Morteza","family":"Lahijanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,30]]},"reference":[{"key":"24_CR1","unstructured":"Abate, A., et al.: ARCH-COMP20 category report: stochastic models. In: ARCH (2020)"},{"key":"24_CR2","unstructured":"ApS, M.: MOSEK optimization toolbox for MATLAB. User\u2019s Guide and Reference Manual, Version 4(1) (2019)"},{"key":"24_CR3","unstructured":"Bertsekas, D.P., Shreve, S.E.: Stochastic Optimal Control: The Discrete-Time Case, vol. 5. Athena Scientific (2004)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., Schilling, C.: JuliaReach: a toolbox for set-based reachability. In: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, pp. 39\u201344 (2019)","DOI":"10.1145\/3302504.3311804"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1007\/s10614-020-09983-3","volume":"58","author":"C Coleman","year":"2021","unstructured":"Coleman, C., Lyon, S., Maliar, L., Maliar, S.: Matlab, Python, Julia: What to choose in economics? Comput. Econ. 58, 1263\u20131288 (2021)","journal-title":"Comput. Econ."},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Forets, M., Schilling, C.: LazySets.jl: scalable symbolic-numeric set computations. In: Proceedings of the JuliaCon Conferences, vol. 1, no. 1, \u00a0p. 11 (2021). https:\/\/doi.org\/10.21105\/jcon.00097","DOI":"10.21105\/jcon.00097"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu, Q., Hall, J.J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10(1), 119\u2013142 (2018)","journal-title":"Math. Program. Comput."},{"issue":"7","key":"24_CR8","doi-asserted-by":"publisher","first-page":"3097","DOI":"10.1109\/TAC.2020.3013916","volume":"66","author":"P Jagtap","year":"2020","unstructured":"Jagtap, P., Soudjani, S., Zamani, M.: Formal synthesis of stochastic systems via control barrier certificates. IEEE Trans. Autom. Control 66(7), 3097\u20133110 (2020)","journal-title":"IEEE Trans. Autom. Control"},{"key":"24_CR9","unstructured":"Legat, B.: Multivariate polynomials in Julia. In: JuliaCon (2022). https:\/\/pretalx.com\/juliacon-2022\/talk\/TRFSJY\/"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Lubin, M., Dowson, O., Dias Garcia, J., Huchette, J., Legat, B., Vielma, J.P.: JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Math. Program. Comput. (2023). https:\/\/doi.org\/10.1007\/s12532-023-00239-3","DOI":"10.1007\/s12532-023-00239-3"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Mathiesen, F.B., Lahijanian, M., Laurenti, L.: IntervalMDP. jl: accelerated value iteration for interval Markov decision processes, arXiv preprint arXiv:2401.04068 (2024)","DOI":"10.1016\/j.ifacol.2024.07.416"},{"key":"24_CR12","unstructured":"Mathiesen, F.B., Romao, L., Calvert, S.C., Laurenti, L., Abate, A.: A data-driven approach for safety quantification of non-linear stochastic systems with unknown additive noise distribution, arXiv preprint arXiv:2410.06662 (2024)"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Mazouz, R., Mathiesen, F.B., Laurenti, L., Lahijanian, M.: Piecewise stochastic barrier functions. Automatica 189, 113020 (2026). https:\/\/doi.org\/10.1016\/j.automatica.2026.113020. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0005109826002049","DOI":"10.1016\/j.automatica.2026.113020"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Mazouz, R., Mathiesen, F.B., Laurenti, L., Lahijanian, M.: Stochasticbarrier. jl: a toolbox for stochastic barrier function synthesis, arXiv preprint arXiv:2602.20359 (2026)","DOI":"10.1016\/j.automatica.2026.113020"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Mazouz, R., Muvvala, K., Ratheesh, A., Laurenti, L., Lahijanian, M.: Safety guarantees for neural network dynamic systems via stochastic barrier functions. In: Advances in Neural Information Processing Systems (2022)","DOI":"10.52202\/068431-0703"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Mazouz, R., Skovbekk, J., Mathiesen, F.B., Frew, E., Laurenti, L., Lahijanian, M.: Data-driven permissible safe control with barrier certificates. In: 2024 IEEE 63rd Conference on Decision and Control (CDC), pp. 6844\u20136849. IEEE (2024)","DOI":"10.1109\/CDC56724.2024.10886850"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejcon.2020.04.001","volume":"57","author":"A Nejati","year":"2021","unstructured":"Nejati, A., Soudjani, S., Zamani, M.: Compositional abstraction-based synthesis for continuous-time stochastic hybrid systems. Eur. J. Control. 57, 82\u201394 (2021)","journal-title":"Eur. J. Control."},{"issue":"7767","key":"24_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1038\/d41586-019-02310-3","volume":"572","author":"JM Perkel","year":"2019","unstructured":"Perkel, J.M.: Julia: come for the syntax, stay for the speed. Nature 572(7767), 141\u2013142 (2019)","journal-title":"Nature"},{"issue":"1","key":"24_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.automatica.2005.08.007","volume":"42","author":"S Prajna","year":"2006","unstructured":"Prajna, S.: Barrier certificates for nonlinear model validation. Automatica 42(1), 117\u2013126 (2006)","journal-title":"Automatica"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Prajna, S., Jadbabaie, A., Pappas, G.J.: A framework for worst-case and stochastic safety verification using barrier certificates. IEEE Trans. Autom. Control 52(8) (2007)","DOI":"10.1109\/TAC.2007.902736"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Prajna, S., Papachristodoulou, A., Parrilo, P.A.: Introducing SOSTOOLS: a general purpose sum of squares programming solver. In: Conference on Decision and Control, vol. 1. IEEE (2002)","DOI":"10.1109\/CDC.2002.1184594"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Ramos, J.A., Dos\u00a0Santos, P.L.: Mathematical modeling, system identification, and controller design of a two tank system. In: 2007 46th IEEE Conference on Decision and Control. IEEE (2007)","DOI":"10.1109\/CDC.2007.4434949"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Rew, R., Davis, G.: NetCDF: an interface for scientific data access. IEEE Comput. Graphics Appl. 10(4) (1990)","DOI":"10.1109\/38.56302"},{"key":"24_CR24","doi-asserted-by":"publisher","unstructured":"Santoyo, C., Dutreix, M., Coogan, S.: A barrier function approach to finite-time stochastic system verification and control. Automatica 125 (2021). https:\/\/doi.org\/10.1016\/j.automatica.2020.109439","DOI":"10.1016\/j.automatica.2020.109439"},{"issue":"2","key":"24_CR25","doi-asserted-by":"publisher","first-page":"10428","DOI":"10.1016\/j.ifacol.2023.10.1058","volume":"56","author":"M Schneeberger","year":"2023","unstructured":"Schneeberger, M., D\u00f6rfler, F., Mastellone, S.: SoS construction of compatible control Lyapunov and barrier functions. IFAC-PapersOnLine 56(2), 10428\u201310434 (2023)","journal-title":"IFAC-PapersOnLine"},{"key":"24_CR26","doi-asserted-by":"publisher","unstructured":"Soroka, E., Kochenderfer, M.J., Lall, S.: Satisfiability.jl: satisfiability modulo theories in Julia. J. Open Source Softw. 9(100), 6757 (2024). https:\/\/doi.org\/10.21105\/joss.06757","DOI":"10.21105\/joss.06757"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Wang, L., Han, D., Egerstedt, M.: Permissive barrier certificates for safe stabilization using sum-of-squares. In: Annual American Control Conference (ACC), pp. 585\u2013590. IEEE (2018)","DOI":"10.23919\/ACC.2018.8431617"},{"key":"24_CR28","unstructured":"Wei, T., et al.: Modelverification. jl: a comprehensive toolbox for formally verifying deep neural networks, arXiv preprint arXiv:2407.01639 (2024)"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Wooding, B., Horbanov, V., Lavaei, A.: Protect: parallelized construction of safety barrier certificates for nonlinear polynomial systems, arXiv preprint arXiv:2404.14804 (2024)","DOI":"10.1007\/978-3-032-11176-0_26"},{"key":"24_CR30","unstructured":"Zhang, H., Weng, T.W., Chen, P.Y., Hsieh, C.J., Daniel, L.: Efficient neural network robustness certification with general activation functions. Adv. Neural Inf. Process. Syst. 31 (2018)"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35298-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T13:25:02Z","timestamp":1788009902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35298-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,30]]},"ISBN":["9783032352972","9783032352989"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35298-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,30]]},"assertion":[{"value":"30 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST+FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest-formats.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}