{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T06:58:52Z","timestamp":1779087532568,"version":"3.51.4"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030112448","type":"print"},{"value":"9783030112455","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11245-5_7","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T18:45:18Z","timestamp":1547145918000},"page":"136-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Disjunctive Relational Abstract Interpretation for Interprocedural Program Analysis"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Boutonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Halbwachs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-07131-8_31","volume-title":"Programming Methodology","author":"FE Allen","year":"1975","unstructured":"Allen, F.E.: Interprocedural analysis and the information derived by it. In: Hackl, C.E. (ed.) IBM 1974. LNCS, vol. 23, pp. 291\u2013321. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07131-8_31"},{"key":"7_CR2","unstructured":"Allen, F.E.: Interprocedural data flow analysis. In: IFIP Congress, pp. 398\u2013402 (1974)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2010.09.002","volume":"267","author":"C Ancourt","year":"2010","unstructured":"Ancourt, C., Coelho, F., Irigoin, F.: A modular static analysis approach to affine loop invariants detection. Electron. Notes Theor. Comput. Sci. 267(1), 3\u201316 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: How to combine widening and narrowing for non-monotonic systems of equations. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2013, Seattle, WA, pp. 377\u2013386, June 2013","DOI":"10.1145\/2491956.2462190"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45789-5_17","volume-title":"Static Analysis","author":"R Bagnara","year":"2002","unstructured":"Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the parma polyhedra library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 213\u2013229. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45789-5_17"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Barth, J.M.: An interprocedural data flow analysis algorithm. In: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 119\u2013131. ACM (1977)","DOI":"10.1145\/512950.512962"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19(4), 769\u2013779 (1994). https:\/\/doi.org\/10.1287\/moor.19.4.769 . https:\/\/doi.org\/10.1287\/moor.19.4.769","journal-title":"Math. Oper. Res."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-99725-4_11","volume-title":"Static Analysis","author":"A Becchi","year":"2018","unstructured":"Becchi, A., Zaffanella, E.: An efficient abstract domain for not necessarily closed polyhedra. In: Podelski, A. (ed.) SAS 2018. LNCS, vol. 11002, pp. 146\u2013165. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99725-4_11"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S0956796800000496","volume":"2","author":"F Bourdoncle","year":"1992","unstructured":"Bourdoncle, F.: Abstract interpretation by dynamic partitioning. J. Funct. Program. 2(4), 407\u2013435 (1992)","journal-title":"J. Funct. Program."},{"key":"7_CR10","unstructured":"Boutonnet, R., Asavoae, M.: The WCET analysis using counters - a preliminary assessment. In: Proceedings of 8th JRWRTC, in Conjunction with RTNS14, Versailles, France, October 2014"},{"key":"7_CR11","unstructured":"Clauss, P.: Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs. In: Proceedings of the 10th International Conference on Supercomputing, ICS 1996, Philadelphia, PA, USA, 25\u201328 May 1996, pp. 278\u2013285 (1996). http:\/\/doi.acm.org\/10.1145\/237578.237617"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th ACM Symposium on Principles of Programming Languages, POPL 1977, Los Angeles, January 1977","DOI":"10.1145\/512950.512973"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: IFIP Conference on Formal Description of Programming Concepts, St. Andrews, NB, Canada. North-Holland Publishing Company (1977)","DOI":"10.1145\/800022.808314"},{"key":"7_CR14","unstructured":"Cousot, P., Cousot, R.: Relational abstract interpretation of higher order functional programs (extended abstract). In: Proceedings of Actes JTASPEFL 1991 (Bordeaux), Laboratoire Bordelais de Recherche en Informatique (LaBRI), October 1991, pp. 33\u201336 (1991)"},{"key":"7_CR15","unstructured":"Cousot, P., Cousot, R.: Compositional separate modular static analysis of programs by abstract interpretation. In: Proceedings of SSGRR, pp. 6\u201310 (2001)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45937-5_13","volume-title":"Compiler Construction","author":"P Cousot","year":"2002","unstructured":"Cousot, P., Cousot, R.: Modular static program analysis. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, pp. 159\u2013179. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45937-5_13"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 84\u201396. ACM (1978)","DOI":"10.1145\/512760.512770"},{"issue":"6","key":"7_CR18","first-page":"21","volume":"33","author":"A Flexeder","year":"2011","unstructured":"Flexeder, A., M\u00fcller-Olm, M., Petter, M., Seidl, H.: Fast interprocedural linear two-variable equalities. ACM Trans. Programm. Lang. Syst. (TOPLAS) 33(6), 21 (2011)","journal-title":"ACM Trans. Programm. Lang. Syst. (TOPLAS)"},{"issue":"5","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1145\/293677.293680","volume":"20","author":"R Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Scozzari, F.: A logical model for relational abstract domains. ACM Trans. Programm. Lang. Syst. (TOPLAS) 20(5), 1067\u20131109 (1998)","journal-title":"ACM Trans. Programm. Lang. Syst. (TOPLAS)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-71316-6_18","volume-title":"Programming Languages and Systems","author":"S Gulwani","year":"2007","unstructured":"Gulwani, S., Tiwari, A.: Computing procedure summaries for interprocedural analysis. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 253\u2013267. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_18"},{"key":"7_CR21","unstructured":"Halbwachs, N.: D\u00e9termination automatique de relations lin\u00e9aires v\u00e9rifi\u00e9es par les variables d\u2019un programme. Ph.D. thesis, Universit\u00e9 Scientifique et M\u00e9dicale de Grenoble (1979)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-33125-1_6","volume-title":"Static Analysis","author":"JM Howe","year":"2012","unstructured":"Howe, J.M., King, A.: Polyhedral analysis using parametric objectives. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 41\u201357. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33125-1_6"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Jouvelot, P., Triolet, R.: Semantical interprocedural parallelization: an overview of the pips project. In: ACM International Conference on Supercomputing 25th Anniversary Volume, pp. 143\u2013150. ACM (2014)","DOI":"10.1145\/2591635.2667163"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1024480913162","volume":"23","author":"B Jeannet","year":"2003","unstructured":"Jeannet, B.: Dynamic partitioning in linear relation analysis: application to the verification of reactive systems. Formal Methods Syst. Des. 23(1), 5\u201337 (2003)","journal-title":"Formal Methods Syst. Des."},{"key":"7_CR25","unstructured":"Jeannet, B.: INTERPROC analyzer for recursive programs with numerical variables. INRIA. http:\/\/pop-art.inrialpes.fr\/interproc\/interprocweb.cgi . Accessed 06 Nov 2010"},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10270-012-0230-7","volume":"12","author":"B Jeannet","year":"2013","unstructured":"Jeannet, B.: Relational interprocedural verification of concurrent programs. Softw. Syst. Model. 12(2), 285\u2013306 (2013)","journal-title":"Softw. Syst. Model."},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11547662_14","volume-title":"Static Analysis","author":"B Jeannet","year":"2005","unstructured":"Jeannet, B., Gopan, D., Reps, T.: A relational abstraction for functions. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 186\u2013202. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11547662_14"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-48294-6_3","volume-title":"Static Analysis","author":"B Jeannet","year":"1999","unstructured":"Jeannet, B., Halbwachs, N., Raymond, P.: Dynamic partitioning in analyses of numerical properties. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 39\u201350. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48294-6_3"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-642-02658-4_52","volume-title":"Computer Aided Verification","author":"B Jeannet","year":"2009","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: a library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 661\u2013667. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-27815-3_22","volume-title":"Algebraic Methodology and Software Technology","author":"B Jeannet","year":"2004","unstructured":"Jeannet, B., Serwe, W.: Abstracting call-stacks for interprocedural verification of imperative programs. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 258\u2013273. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27815-3_22"},{"key":"7_CR31","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The Omega calculator and library, version 1.1. 0. College Park, MD 20742, 18 (1996)"},{"key":"7_CR32","doi-asserted-by":"publisher","DOI":"10.1201\/9780849332517","volume-title":"Data Flow Analysis: Theory and Practice","author":"U Khedker","year":"2009","unstructured":"Khedker, U., Sanyal, A., Sathe, B.: Data Flow Analysis: Theory and Practice. CRC Press, Boca Raton (2009)"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-73721-8_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J Kranz","year":"2018","unstructured":"Kranz, J., Simon, A.: Modular analysis of executables using on-demand heyting completion. Verification, Model Checking, and Abstract Interpretation. LNCS, vol. 10747, pp. 291\u2013312. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_14"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO 2004), Palo Alto, California, March 2004","DOI":"10.1109\/CGO.2004.1281665"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.entcs.2012.10.007","volume":"288","author":"V Maisonneuve","year":"2012","unstructured":"Maisonneuve, V.: Convex invariant refinement by control node splitting: a heuristic approach. Electron. Notes Theor. Comput. Sci. 288, 49\u201359 (2012)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.entcs.2014.08.003","volume":"307","author":"V Maisonneuve","year":"2014","unstructured":"Maisonneuve, V., Hermant, O., Irigoin, F.: Computing invariants with transformers: experimental scalability and accuracy. Electron. Notes Theor. Comput. Sci. 307, 17\u201331 (2014)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-66706-5_11","volume-title":"Static Analysis","author":"A Mar\u00e9chal","year":"2017","unstructured":"Mar\u00e9chal, A., Monniaux, D., P\u00e9rin, M.: Scalable minimizing-operators on polyhedra via parametric linear programming. In: Ranzato, F. (ed.) SAS 2017. LNCS, vol. 10422, pp. 212\u2013231. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66706-5_11"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-31987-0_2","volume-title":"Programming Languages and Systems","author":"L Mauborgne","year":"2005","unstructured":"Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 5\u201320. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_2"},{"key":"7_CR39","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: AST 2001 in WCRE 2001, pp. 310\u2013319. IEEE\/IEEE CS Press, October 2001"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-30579-8_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., R\u00fcthing, O., Seidl, H.: Checking herbrand equalities and beyond. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 79\u201396. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30579-8_6"},{"key":"7_CR41","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Computing interprocedurally valid relations in affine programs. Princ. Prog. Lang. (2004)"},{"key":"7_CR42","unstructured":"M\u00fcller-Olm, M., Seidl, H., Steffen, B.: Interprocedural analysis (almost) for free. Univ. Dekanat Informatik (2004)"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-77505-8_26","volume-title":"Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues","author":"C Popeea","year":"2007","unstructured":"Popeea, C., Chin, W.-N.: Inferring disjunctive postconditions. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol. 4435, pp. 331\u2013345. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77505-8_26"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Popeea, C., Chin, W.N.: Dual analysis for proving safety and finding bugs. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 2137\u20132143. ACM (2010)","DOI":"10.1145\/1774088.1774538"},{"issue":"4","key":"7_CR45","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.scico.2012.07.004","volume":"78","author":"C Popeea","year":"2013","unstructured":"Popeea, C., Chin, W.N.: Dual analysis for proving safety and finding bugs. Sci. Comput. Program. 78(4), 390\u2013411 (2013)","journal-title":"Sci. Comput. Program."},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 49\u201361. ACM (1995)","DOI":"10.1145\/199448.199462"},{"issue":"5","key":"7_CR47","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1275497.1275501","volume":"29","author":"X Rival","year":"2007","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. (TOPLAS) 29(5), 26 (2007)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"7_CR48","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. New York University, Courant Institute of Mathematical Sciences, Computer Science Department (1978)"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.T.: Fast polyhedra abstract domain. In: POPL, pp. 46\u201359 (2017)","DOI":"10.1145\/3093333.3009885"},{"key":"7_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-19718-5_24","volume-title":"Programming Languages and Systems","author":"P Sotin","year":"2011","unstructured":"Sotin, P., Jeannet, B.: Precise interprocedural analysis in the presence of pointers to the stack. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 459\u2013479. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19718-5_24"},{"key":"7_CR51","unstructured":"Spillman, T.C.: Exposing side-effects in a PL\/I optimizing compiler. In: IFIP Congress, vol. 1, pp. 376\u2013381 (1971)"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Yahav, E., Chandra, S.: Generating precise and concise procedure summaries. In: ACM SIGPLAN Notices, vol. 43, pp. 221\u2013234. ACM (2008)","DOI":"10.1145\/1328438.1328467"},{"issue":"6","key":"7_CR53","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/2666356.2594328","volume":"49","author":"Xin Zhang","year":"2014","unstructured":"Zhang, X., Mangal, R., Naik, M., Yang, H.: Hybrid top-down and bottom-up interprocedural analysis. In: ACM SIGPLAN Notices, vol. 49, pp. 249\u2013258. ACM (2014)","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11245-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:16:30Z","timestamp":1573701390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-11245-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030112448","9783030112455"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11245-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cascais","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl19.sigplan.org\/track\/VMCAI-2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}