{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:46:28Z","timestamp":1743000388724,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319522333"},{"type":"electronic","value":"9783319522340"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-52234-0_26","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T23:52:06Z","timestamp":1484092326000},"page":"483-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding Relevant Templates via the Principal Component Analysis"],"prefix":"10.1007","author":[{"given":"Yassamine","family":"Seladji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Abdi, H., Williams, L.J.: Principal component analysis (2010)","DOI":"10.1002\/wics.101"},{"issue":"12","key":"26_CR2","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/j.jsc.2011.12.052","volume":"47","author":"G Amato","year":"2012","unstructured":"Amato, G., Parton, M., Scozzari, F.: Discovering invariants via simple component analysis. J. Symb. Comput. 47(12), 1533\u20131560 (2012)","journal-title":"J. Symb. Comput."},{"key":"26_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., \u00c1brah\u00e1m, E.: Choice of directions for the approximation of reachable sets for hybrid systems. In: Computer Aided Systems Theory - EUROCAST 2011\u201313th International Conference, Las Palmas de Gran Canaria, Spain (2011)","DOI":"10.1007\/978-3-642-27549-4_69"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-19718-5_10","volume-title":"Programming Languages and Systems","author":"MA Col\u00f3n","year":"2011","unstructured":"Col\u00f3n, M.A., Sankaranarayanan, S.: Generalizing the template polyhedral domain. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 176\u2013195. Springer, Heidelberg (2011). doi:\n                    10.1007\/978-3-642-19718-5_10"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Programming Language Implementation and Logic Programming","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269\u2013295. Springer, Heidelberg (1992). doi:\n                    10.1007\/3-540-55844-6_142"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL, pp. 84\u201397. ACM Press (1978)","DOI":"10.1145\/512760.512770"},{"key":"26_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: POPL, pp. 238\u2013252. ACM Press (1977)","DOI":"10.1145\/512950.512973"},{"key":"26_CR9","unstructured":"Gale, D.: Linear programming and the simplex method. Notices AMS 54(3), 364\u2013369 (2007). Spanoudakis, G., Kloukinas, C., Mahbub, K."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Gaubert, S., McEneaney, W.M., Qu, Z.: Curse of dimensionality reduction in max-plus based approximation methods: theoretical estimates and improved pruning algorithms. In: CDC-ECE. IEEE (2011)","DOI":"10.1109\/CDC.2011.6161386"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Goubault, E., Putot, S., V\u00e9drine, F.: Modular static analysis with zonotopes. In: Proceedings of Static Analysis - 19th International Symposium, SAS 2012, Deauville, France (2012)","DOI":"10.1007\/978-3-642-33125-1_5"},{"key":"26_CR12","unstructured":"Hiriart-Urrut, J.B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Berlin (2004)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Jolliffe, I.: Principal Component Analysis. Springer, New York (1986)","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Laviron, V., Logozzo, F.: Subpolyhedra: a family of numerical abstract domains for the (more) scalable inference of linear inequalities. In: STTT (2011)","DOI":"10.1007\/s10009-011-0199-5"},{"key":"26_CR15","unstructured":"Lieven De Lathauwer, B.D.M., Vandewalle, J.: A multilinear singular value decomposition. SIAM. J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000)"},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher-Order Symbolic Comput. 19(1), 31\u2013100 (2006)","journal-title":"Higher-Order Symbolic Comput."},{"key":"26_CR17","unstructured":"Moore, B.: Principal component analysis in linear systems: controllability, observability, and model reduction. IEEE Trans. Autom. Control 26(1), 17\u201332 (1981)"},{"key":"26_CR18","unstructured":"Nesterov, Y., Nemirovski\u012d, A.: Interior-point polynomial algorithms in convex programming. SIAM studies in applied mathematics, Society for Industrial and Applied Mathematics (1994). \n                    http:\/\/opac.inria.fr\/record=b1084763"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11609773_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Col\u00f3n, M.A., Sipma, H., Manna, Z.: Efficient strongly relational polyhedral analysis. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 111\u2013125. Springer, Heidelberg (2005). doi:\n                    10.1007\/11609773_8"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-30579-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25\u201341. Springer, Heidelberg (2005). doi:\n                    10.1007\/978-3-540-30579-8_2"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Seladji, Y., Bouissou, O.: Numerical abstract domain using support functions. In: Proceedings of NASA Formal Methods, 5th International Symposium, NFM 2013, Moffett Field, CA, USA, pp. 155\u2013169 (2013)","DOI":"10.1007\/978-3-642-38088-4_11"},{"key":"26_CR22","unstructured":"Shlens, J.: A tutorial on principal component analysis. CoRR (2014)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-36580-X_35","volume-title":"Hybrid Systems: Computation and Control","author":"O Stursberg","year":"2003","unstructured":"Stursberg, O., Krogh, B.H.: Efficient representation and computation of reachable sets for hybrid systems. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 482\u2013497. Springer, Heidelberg (2003). doi:\n                    10.1007\/3-540-36580-X_35"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Tipping, M.E.: Bishop: probabilistic principal component analysis. J. Royal Stat. Soc. Ser B (Statistical Methodology) 61(3), 611\u2013622 (1999)","DOI":"10.1111\/1467-9868.00196"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52234-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:10:07Z","timestamp":1558318207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52234-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319522333","9783319522340"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52234-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 January 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.researchr.org\/home\/VMCAI-2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}