{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T15:47:33Z","timestamp":1750780053738,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319216898"},{"type":"electronic","value":"9783319216904"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21690-4_24","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T02:08:27Z","timestamp":1436926107000},"page":"415-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation"],"prefix":"10.1007","author":[{"given":"Mendes","family":"Oulamara","sequence":"first","affiliation":[]},{"given":"Arnaud J.","family":"Venet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/050622560","volume":"17","author":"E Yildirim","year":"2006","unstructured":"Yildirim, E.: Alper. On the minimum volume covering ellipsoid of ellipsoids. SIAM J. Optim. 17(3), 621\u2013641 (2006)","journal-title":"SIAM J. Optim."},{"key":"24_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2. SIAM, Philadelphia (2001)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-24725-8_4","volume-title":"Programming Languages and Systems","author":"J Feret","year":"2004","unstructured":"Feret, J.: Static analysis of digital filters. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 33\u201348. Springer, Heidelberg (2004)"},{"key":"24_CR4","unstructured":"Feret, J.: Numerical abstract domains for digital filters. In: International Workshop on Numerical and Symbolic Abstract Domains (NSAD 2005) (2005)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Roux, P., Jobredeaux, R., Garoche, P. L., F\u00e9ron, \u00c9.: A generic ellipsoid abstract domain for linear time invariant systems. In: Proceedings of the 15th ACM International Conference on Hybrid Systems: Computation and Control, pp. 105\u2013114. ACM (2012)","DOI":"10.1145\/2185632.2185651"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-319-06410-9_38","volume-title":"FM 2014: Formal Methods","author":"P Roux","year":"2014","unstructured":"Roux, P., Garoche, P.-L.: Computing quadratic invariants with min- and max-policy iterations: a practical comparison. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 563\u2013578. Springer, Heidelberg (2014)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-31424-7_15","volume-title":"Computer Aided Verification","author":"AJ Venet","year":"2012","unstructured":"Venet, A.J.: The gauge domain: scalable analysis of linear inequality invariants. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 139\u2013154. Springer, Heidelberg (2012)"},{"key":"24_CR8","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: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. ACM (1977)","DOI":"10.1145\/512950.512973"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Logic Comput. 2(4), 511\u2013547 (1992)","journal-title":"J. Logic Comput."},{"key":"24_CR10","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2013","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.R.: Semidefinite Optimization and Convex Algebraic Geometry, vol. 13. SIAM, Philadelphia (2013)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1008203903341","volume":"10","author":"L Porkolab","year":"1997","unstructured":"Porkolab, L., Khachiyan, L.: On the complexity of semidefinite programs. J. Global Optim. 10(4), 351\u2013365 (1997)","journal-title":"J. Global Optim."},{"issue":"11","key":"24_CR13","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1109\/TAC.2002.804474","volume":"47","author":"J Daafouz","year":"2002","unstructured":"Daafouz, J., Riedinger, P., Iung, C.: Stability analysis and control synthesis for switched systems: a switched lyapunov function approach. IEEE Trans. Autom. Control 47(11), 1883\u20131887 (2002)","journal-title":"IEEE Trans. Autom. Control"},{"key":"24_CR14","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: CVXOPT: A Python package for convex optimization, version 1.1.6. (2013). \n                      http:\/\/www.cvxopt.org"},{"key":"24_CR15","unstructured":"Johansson, F., et al.: mpmath: a Python library for arbitrary-precision floating-point arithmetic, version 0.18, December 2013"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCSE.2011.37","volume":"13","author":"S Walt van der","year":"2011","unstructured":"van der Walt, S., Colbert, S.C., Varoquaux, G.: The NumPy array: a structure for efficient numerical computation. Comput. Sci. Eng. 13, 22\u201330 (2011)","journal-title":"Comput. Sci. Eng."},{"key":"24_CR17","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)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21690-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T20:08:24Z","timestamp":1563826104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21690-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319216898","9783319216904"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21690-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}