{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:23:35Z","timestamp":1725881015297},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319542911"},{"type":"electronic","value":"9783319542928"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-54292-8_9","type":"book-chapter","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T02:12:49Z","timestamp":1487211169000},"page":"96-104","source":"Crossref","is-referenced-by-count":0,"title":["Reduce the Complexity of the Polyhedron Minimization Using the Max Plus Pruning Method"],"prefix":"10.1007","author":[{"given":"Yassamine","family":"Seladji","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM (1999)","DOI":"10.1145\/301250.301257"},{"key":"9_CR2","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: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages (POPL 1977), pp. 238\u2013252. ACM Press (1977)","DOI":"10.1145\/512950.512973"},{"key":"9_CR3","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: 10.1007\/3-540-55844-6_142"},{"key":"9_CR4","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":"9_CR5","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, pp. 1054\u20131061. IEEE (2011). http:\/\/dblp.uni-trier.de\/db\/conf\/cdc\/cdc2011.html#GaubertMQ11"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33125-1_5","volume-title":"Static Analysis","author":"E Goubault","year":"2012","unstructured":"Goubault, E., Putot, S., V\u00e9drine, F.: Modular static analysis with zonotopes. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 24\u201340. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33125-1_5"},{"key":"9_CR7","volume-title":"Fundamentals of Convex Analysis","author":"JB Hiriart-Urrut","year":"2004","unstructured":"Hiriart-Urrut, J.B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Heidelberg (2004)"},{"issue":"1","key":"9_CR8","doi-asserted-by":"crossref","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. High. Order Symbolic Comput. 19(1), 31\u2013100 (2006)","journal-title":"High. Order Symbolic Comput."},{"key":"9_CR9","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: 10.1007\/978-3-540-30579-8_2"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-38088-4_11","volume-title":"NASA Formal Methods","author":"Y Seladji","year":"2013","unstructured":"Seladji, Y., Bouissou, O.: Numerical abstract domain using support functions. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 155\u2013169. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38088-4_11"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-45013-0_7","volume-title":"Logic Based Program Synthesis and Transformation","author":"A Simon","year":"2003","unstructured":"Simon, A., King, A., Howe, J.M.: Two variables per linear inequality as an abstract domain. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol. 2664, pp. 71\u201389. Springer, Heidelberg (2003). doi: 10.1007\/3-540-45013-0_7"},{"key":"9_CR12","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). doi: 10.1007\/978-3-642-31424-7_15"}],"container-title":["Lecture Notes in Computer Science","Numerical Software Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-54292-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T15:03:23Z","timestamp":1568819003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-54292-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319542911","9783319542928"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-54292-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}