{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:14:08Z","timestamp":1743034448669,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030862046"},{"type":"electronic","value":"9783030862053"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86205-3_16","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T08:02:57Z","timestamp":1630396977000},"page":"287-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Formal Verification of a Java Component Using the RESOLVE Framework"],"prefix":"10.1007","author":[{"given":"Laine","family":"Rumreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo A. G.","family":"Sivilotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"issue":"11","key":"16_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1145\/583854.582448","volume":"37","author":"J Aldrich","year":"2002","unstructured":"Aldrich, J., Kostadinov, V., Chambers, C.: Alias annotations for program understanding. SIGPLAN Not. 37(11), 311\u2013330 (2002). https:\/\/doi.org\/10.1145\/583854.582448","journal-title":"SIGPLAN Not."},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/3229783.3229801","volume":"43","author":"S Asim","year":"2018","unstructured":"Asim, S.: An exercise in design: the binary decision diagram. SIGSOFT Softw. Eng. Notes 43(3), 19 (2018). https:\/\/doi.org\/10.1145\/3229783.3229801","journal-title":"SIGSOFT Softw. Eng. Notes"},{"key":"16_CR3","unstructured":"Asim, S.: The binary decision diagram: abstraction and implementation. Master\u2019s thesis, The Ohio State University (2018)"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Aziz, A., et al.: HSIS: a BDD-based environment for formal verification. In: 1994 31st Design Automation Conference, Los Alamitos, CA, USA, pp. 454\u2013459. IEEE Computer Society (1994). https:\/\/doi.org\/10.1145\/196244.196467","DOI":"10.1145\/196244.196467"},{"issue":"6","key":"16_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1953122.1953145","volume":"54","author":"M Barnett","year":"2011","unstructured":"Barnett, M., F\u00e4hndrich, M., Leino, K.R.M., M\u00fcller, P., Schulte, W., Venter, H.: Specification and verification: the Spec# experience. Commun. ACM 54(6), 81\u201391 (2011). https:\/\/doi.org\/10.1145\/1953122.1953145","journal-title":"Commun. ACM"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-030-45237-7_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Beyer","year":"2020","unstructured":"Beyer, D.: Advances in automatic software verification: SV-COMP 2020. In: TACAS 2020. LNCS, vol. 12079, pp. 347\u2013367. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_21"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-28644-8_2","volume-title":"CONCUR 2004 - Concurrency Theory","author":"S Brookes","year":"2004","unstructured":"Brookes, S.: A semantics for concurrent separation logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 16\u201334. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_2"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J Burch","year":"1992","unstructured":"Burch, J., Clarke, E., McMillan, K., Dill, D., Hwang, L.: Symbolic model checking: $$10^{20}$$ States and beyond. Inf. Comput. 98(2), 142\u2013170 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90017-A","journal-title":"Inf. Comput."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-10575-8_8","volume-title":"Handbook of Model Checking","author":"S Chaki","year":"2018","unstructured":"Chaki, S., Gurfinkel, A.: BDD-based symbolic model checking. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 219\u2013245. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_8"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-03359-9_2","volume-title":"Theorem Proving in Higher Order Logics","author":"E Cohen","year":"2009","unstructured":"Cohen, E., et al.: VCC: a practical system for verifying concurrent C. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 23\u201342. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_2"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10009-016-0433-2","volume":"19","author":"T van Dijk","year":"2016","unstructured":"van Dijk, T., van de Pol, J.: Sylvan: multi-core framework for decision diagrams. Int. J. Softw. Tools Technol. Transf. 19, 675\u2013696 (2016). https:\/\/doi.org\/10.1007\/s10009-016-0433-2","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"16_CR12","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":"5","key":"16_CR13","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/543552.512558","volume":"37","author":"C Flanagan","year":"2002","unstructured":"Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for Java. SIGPLAN Not. 37(5), 234\u2013245 (2002). https:\/\/doi.org\/10.1145\/543552.512558","journal-title":"SIGPLAN Not."},{"issue":"4","key":"16_CR14","first-page":"40","volume":"12","author":"R H\u00e4hnle","year":"1998","unstructured":"H\u00e4hnle, R., Menzel, W., Schmitt, P.H.: Integrierter deduktiver software-entwurf. K\u00fcnstliche Intell. 12(4), 40\u201341 (1998)","journal-title":"K\u00fcnstliche Intell."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-35746-6_6","volume-title":"Tools for Practical Software Verification","author":"L Herbert","year":"2012","unstructured":"Herbert, L., Leino, K.R.M., Quaresma, J.: Using Dafny, an automatic program verifier. In: Meyer, B., Nordio, M. (eds.) LASER 2011. LNCS, vol. 7682, pp. 156\u2013181. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35746-6_6"},{"key":"16_CR16","unstructured":"Heym, W.: Computer program verification: improvements for human reasoning. Ph.D. thesis, Ohio State University (1995)"},{"key":"16_CR17","unstructured":"Hoffman, D.: Techniques for the specification and verification of enterprise applications. Ph.D. thesis, Ohio State University (2016)"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/130943.130947","volume":"3","author":"J Hogg","year":"1992","unstructured":"Hogg, J., Lea, D., Wills, A., deChampeaux, D., Holt, R.: The Geneva convention on the treatment of object aliasing. SIGPLAN OOPS Mess. 3(2), 11\u201316 (1992). https:\/\/doi.org\/10.1145\/130943.130947","journal-title":"SIGPLAN OOPS Mess."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-20398-5_4","volume-title":"NASA Formal Methods","author":"B Jacobs","year":"2011","unstructured":"Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., Piessens, F.: VeriFast: a powerful, sound, predictable, fast verifier for C and Java. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 41\u201355. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20398-5_4"},{"key":"16_CR20","volume-title":"The Rust Programming Language","author":"S Klabnik","year":"2018","unstructured":"Klabnik, S., Nichols, C.: The Rust Programming Language. No Starch Press, San Francisco (2018)"},{"key":"16_CR21","unstructured":"Kulczycki, G., Sitaraman, M., Ogden, W., Leavens, G.: Preserving clean semantics for calls with repeated arguments. Technical report RSRG-04-01, Department of Computer Science, Clemson University (2003). http:\/\/www.cs.clemson.edu\/~resolve"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Kulczycki, G., Vasudeo, J.: Simplifying reasoning about objects with Tako. In: Proceedings of the 2006 Conference on Specification and Verification of Component-Based Systems, SAVCBS 2006, pp. 57\u201364. Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1181195.1181207","DOI":"10.1145\/1181195.1181207"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-69902-6_25","volume-title":"New Frontiers in Artificial Intelligence","author":"R Kurai","year":"2007","unstructured":"Kurai, R., Minato, S., Zeugmann, T.: N-gram analysis based on zero-suppressed BDDs. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS (LNAI), vol. 4384, pp. 289\u2013300. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69902-6_25"},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"CY Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. 38(4), 985\u2013999 (1959). https:\/\/doi.org\/10.1002\/j.1538-7305.1959.tb01585.x","journal-title":"Bell Syst. Tech. J."},{"key":"16_CR25","unstructured":"Lind-Nielsen, J.: BuDDy - A Binary Decision Diagram Package (2003). http:\/\/vlsicad.eecs.umich.edu\/BK\/Slots\/cache\/www.itu.dk\/research\/buddy\/"},{"issue":"2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10115-009-0252-9","volume":"24","author":"E Loekito","year":"2010","unstructured":"Loekito, E., Bailey, J., Pei, J.: A binary decision diagram based approach for mining frequent subsequences. Knowl. Inf. Syst. 24(2), 235\u2013268 (2010). https:\/\/doi.org\/10.1007\/s10115-009-0252-9","journal-title":"Knowl. Inf. Syst."},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-10431-7_4","volume-title":"Software Engineering and Formal Methods","author":"A Lovato","year":"2014","unstructured":"Lovato, A., Macedonio, D., Spoto, F.: A thread-safe library for binary decision diagrams. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 35\u201349. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10431-7_4"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-39799-8_15","volume-title":"Computer Aided Verification","author":"G Lv","year":"2013","unstructured":"Lv, G., Su, K., Xu, Y.: CacBDD: a BDD package with dynamic cache management. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 229\u2013234. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_15"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BFb0053062","volume-title":"ECOOP 1996\u2014Object-Oriented Programming","author":"NH Minsky","year":"1996","unstructured":"Minsky, N.H.: Towards alias-free pointers. In: Cointe, P. (ed.) ECOOP 1996. LNCS, vol. 1098, pp. 189\u2013209. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0053062"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.scico.2015.09.006","volume":"113","author":"DJ Pearce","year":"2015","unstructured":"Pearce, D.J., Groves, L.: Designing a verifying compiler: lessons learned from developing whiley. Sci. Comput. Program. 113, 191\u2013220 (2015). https:\/\/doi.org\/10.1016\/j.scico.2015.09.006. Formal Techniques for Safety-Critical Systems","journal-title":"Sci. Comput. Program."},{"key":"16_CR31","unstructured":"Qian, F.: SableJBDD: A Java Binary Decision Diagram Package (2004). http:\/\/www.sable.mcgill.ca\/~fqian\/SableJBDD\/"},{"key":"16_CR32","unstructured":"Rumreich, L.: The binary decision diagram: formal verification of a reference implementation. Master\u2019s thesis, The Ohio State University (2021)"},{"issue":"5","key":"16_CR33","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00165-010-0154-3","volume":"23","author":"M Sitaraman","year":"2011","unstructured":"Sitaraman, M., et al.: Building a push-button RESOLVE verifier: progress and challenges. Formal Aspects Comput. 23(5), 607\u2013626 (2011). https:\/\/doi.org\/10.1007\/s00165-010-0154-3","journal-title":"Formal Aspects Comput."},{"issue":"4","key":"16_CR34","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/190679.199221","volume":"19","author":"M Sitaraman","year":"1994","unstructured":"Sitaraman, M., Weide, B.: Component-based software using RESOLVE. ACM SIGSOFT Softw. Eng. Notes 19(4), 21\u201322 (1994). https:\/\/doi.org\/10.1145\/190679.199221","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"key":"16_CR35","unstructured":"Sivilotti, P., Asim, S., Rumreich, L.: BDD: A Binary Decision Diagram Software Component (2021). https:\/\/github.com\/osu-rsrg\/BDD"},{"key":"16_CR36","doi-asserted-by":"publisher","unstructured":"Sivilotti, P.A., Lang, M.: Interfaces first (and foremost) with Java. In: Proceedings of the 41st ACM Technical Symposium on Computer Science Education, SIGCSE 2010, pp. 515\u2013519. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1734263.1734436","DOI":"10.1145\/1734263.1734436"},{"key":"16_CR37","unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 3.0.0 (2015). http:\/\/vlsi.colorado.edu\/fabio\/CUDD\/"},{"key":"16_CR38","unstructured":"Vahidi, A.: JDD: a pure Java BDD and Z-BDD library (2019). https:\/\/bitbucket.org\/vahidi\/jdd\/src\/master\/"},{"issue":"1","key":"16_CR39","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TSMCA.2007.909493","volume":"38","author":"L Xing","year":"2008","unstructured":"Xing, L.: An efficient binary-decision-diagram-based approach for network reliability and sensitivity analysis. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 38(1), 105\u2013115 (2008). https:\/\/doi.org\/10.1109\/TSMCA.2007.909493","journal-title":"IEEE Trans. Syst. Man Cybern. Part A Syst. Hum."},{"issue":"3","key":"16_CR40","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1109\/32.372147","volume":"21","author":"SH Zweben","year":"1995","unstructured":"Zweben, S.H., Edwards, S.H., Weide, B.W., Hollingsworth, J.E.: The effects of layering and encapsulation on software development cost and quality. IEEE Trans. Softw. Eng. 21(3), 200\u2013208 (1995). https:\/\/doi.org\/10.1109\/32.372147","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86205-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T23:08:42Z","timestamp":1630537722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86205-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030862046","9783030862053"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86205-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Birmingham","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/frocos2021.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}