{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T03:46:26Z","timestamp":1777866386163,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031982071","type":"print"},{"value":"9783031982088","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-98208-8_3","type":"book-chapter","created":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T17:56:56Z","timestamp":1752429416000},"page":"30-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dependent Assertion Logic for\u00a0Modular Software Verification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9716-3142","authenticated-orcid":false,"given":"Lukas","family":"Gr\u00e4tz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Ahrendt, W., Beckert, B., Bubel, R., H\u00e4hnle, R., Schmitt, P.H., Ulbrich, M. (eds.): Deductive Software Verification, The KeY Book, From Theory to Practice, Lecture Notes in Computer Science, vol. 10001. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-49812-6","DOI":"10.1007\/978-3-319-49812-6"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Baldoni, R., Coppa, E., D\u2019Elia, D.C., Demetrescu, C., Finocchi, I.: A survey of symbolic execution techniques. ACM Comput. Surv. 51(3), 50:1\u201350:39 (2018). https:\/\/doi.org\/10.1145\/3182657","DOI":"10.1145\/3182657"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.: Boogie: a modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364\u2013387. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11804192_17"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Baumann, C., Beckert, B., Blasum, H., Bormer, T.: Lessons learned from microkernel verification - specification is the new bottleneck. In: Cassez, F., Huuck, R., Klein, G., Schlich, B. (eds.) Proceedings Seventh Conference on Systems Software Verification, SSV 2012, Sydney, Australia, 28\u201330 November 2012. EPTCS, vol.\u00a0102, pp. 18\u201332 (2012). https:\/\/doi.org\/10.4204\/EPTCS.102.4","DOI":"10.4204\/EPTCS.102.4"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-72308-2_3","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"B Beckert","year":"2017","unstructured":"Beckert, B., Schiffl, J., Schmitt, P.H., Ulbrich, M.: Proving JDK\u2019s dual pivot quicksort correct. In: Paskevich, A., Wies, T. (eds.) VSTTE 2017. LNCS, vol. 10712, pp. 35\u201348. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72308-2_3"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/0022-0000(82)90018-6","volume":"25","author":"M Ben-Ari","year":"1982","unstructured":"Ben-Ari, M., Halpern, J.Y., Pnueli, A.: Deterministic propositional dynamic logic: finite models, complexity, and completeness. J. Comput. Syst. Sci. 25(3), 402\u2013417 (1982). https:\/\/doi.org\/10.1016\/0022-0000(82)90018-6","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"3_CR7","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C., Jacopini, G.: Flow diagrams, Turing machines and languages with only two formation rules. Commun. ACM 9(5), 366\u2013371 (1966). https:\/\/doi.org\/10.1145\/355592.365646","journal-title":"Commun. ACM"},{"key":"3_CR8","unstructured":"Dijkstra, E.W.: Notes on structured programming. Technical Report 70-WSK-03, Technological University Eindhoven, Department of Mathematics, EWD249 (1969)"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/362929.362947","volume":"11","author":"EW Dijkstra","year":"1968","unstructured":"Dijkstra, E.W.: Letters to the editor: go to statement considered harmful. Commun. ACM 11(3), 147\u2013148 (1968). https:\/\/doi.org\/10.1145\/362929.362947","journal-title":"Commun. ACM"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-37036-6_8","volume-title":"Programming Languages and Systems","author":"J-C Filli\u00e2tre","year":"2013","unstructured":"Filli\u00e2tre, J.-C., Paskevich, A.: Why3\u2014where programs meet provers. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 125\u2013128. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_8"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18(2), 194\u2013211 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90046-1","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Friedmann, O., Lange, M.: A solver for modal fixpoint logics. In: Bolander, T., Bra\u00fcner, T. (eds.) Proceedings of the 6th Workshop on Methods for Modalities, M4M-6 2009, Copenhagen, Denmark, 12\u201314 November, 2009. Electronic Notes in Theoretical Computer Science, vol.\u00a0262, pp. 99\u2013111. Elsevier (2009). https:\/\/doi.org\/10.1016\/J.ENTCS.2010.04.008","DOI":"10.1016\/J.ENTCS.2010.04.008"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Georgiou, P., Gleiss, B., Kov\u00e1cs, L.: Trace logic for inductive loop reasoning. In: 2020 Formal Methods in Computer Aided Design, FMCAD 2020, Haifa, Israel, 21\u201324 September 2020, pp. 255\u2013263. IEEE (2020). https:\/\/doi.org\/10.34727\/2020\/ISBN.978-3-85448-042-6_33","DOI":"10.34727\/2020\/ISBN.978-3-85448-042-6_33"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-91908-9_18","volume-title":"Computing and Software Science","author":"R H\u00e4hnle","year":"2019","unstructured":"H\u00e4hnle, R., Huisman, M.: Deductive software verification: from pen-and-paper proofs to industrial tools. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 345\u2013373. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91908-9_18"},{"key":"3_CR15","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0022-0000(83)90014-4","volume":"26","author":"D Harel","year":"1983","unstructured":"Harel, D., Pnueli, A., Stavi, J.: Propositional dynamic logic of nonregular programs. J. Comput. Syst. Sci. 26(2), 222\u2013243 (1983). https:\/\/doi.org\/10.1016\/0022-0000(83)90014-4","journal-title":"J. Comput. Syst. Sci."},{"issue":"11","key":"3_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1145\/361219.361222","volume":"18","author":"HF Ledgard","year":"1975","unstructured":"Ledgard, H.F., Marcotty, M.: A genealogy of control structures. Commun. ACM 18(11), 629\u2013639 (1975). https:\/\/doi.org\/10.1145\/361219.361222","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"3_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/J.JLAP.2006.11.003","volume":"73","author":"C L\u00f6ding","year":"2007","unstructured":"L\u00f6ding, C., Lutz, C., Serre, O.: Propositional dynamic logic with recursive programs. J. Log. Algebraic Methods Program. 73(1\u20132), 51\u201369 (2007). https:\/\/doi.org\/10.1016\/J.JLAP.2006.11.003","journal-title":"J. Log. Algebraic Methods Program."},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Meyer, B.: Applying \u201cdesign by contract\u201d. Computer 25(10), 40\u201351 (1992). https:\/\/doi.org\/10.1109\/2.161279","DOI":"10.1109\/2.161279"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-662-49122-5_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P M\u00fcller","year":"2016","unstructured":"M\u00fcller, P., Schwerhoff, M., Summers, A.J.: Viper: a verification infrastructure for permission-based reasoning. In: Jobstmann, B., Leino, K. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 41\u201362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_2"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Pratt, V.R.: Semantical considerations on floyd-hoare logic. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, 25\u201327 October 1976, pp. 109\u2013121. IEEE Computer Society (1976). https:\/\/doi.org\/10.1109\/SFCS.1976.27","DOI":"10.1109\/SFCS.1976.27"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-09526-8_48","volume-title":"Mathematical Foundations of Computer Science 1979","author":"MK Valiev","year":"1979","unstructured":"Valiev, M.K.: On axiomatization of deterministic propositional dynamic logic. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 482\u2013491. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09526-8_48"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98208-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:36:08Z","timestamp":1777538168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98208-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"ISBN":["9783031982071","9783031982088"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98208-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,9]]},"assertion":[{"value":"9 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cyprusconferences.org\/tase2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}