{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T23:11:21Z","timestamp":1768777881322,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319667058","type":"print"},{"value":"9783319667065","type":"electronic"}],"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-66706-5_11","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:13:26Z","timestamp":1503015206000},"page":"212-231","source":"Crossref","is-referenced-by-count":15,"title":["Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Mar\u00e9chal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Monniaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u00ebl","family":"P\u00e9rin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"11_CR1","unstructured":"Bastoul, C.: Contributions to high-level program optimization. Habilitation thesis, Universit\u00e9 Paris-Sud (2012)"},{"issue":"1\u20132","key":"11_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1017\/S1471068404002261","volume":"5","author":"F Benoy","year":"2005","unstructured":"Benoy, F., King, A., Mesnard, F.: Computing convex hulls with a linear solver. Theor. Pract. Logic Program. (TPLP) 5(1\u20132), 259\u2013271 (2005)","journal-title":"Theor. Pract. Logic Program. (TPLP)"},{"issue":"6","key":"11_CR3","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0041-5553(68)90115-8","volume":"8","author":"NV Chernikova","year":"1968","unstructured":"Chernikova, N.V.: Algorithm for discovering the set of all the solutions of a linear programming problem. USSR Comput. Math. Math. Phys. 8(6), 282\u2013293 (1968)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"11_CR4","volume-title":"Linear Programming. Series of books in the Mathematical Sciences","author":"V Chvatal","year":"1983","unstructured":"Chvatal, V.: Linear Programming. Series of books in the Mathematical Sciences. W.H. Freeman, New York (1983)"},{"key":"11_CR5","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: ACM Principles of Programming Languages (POPL), pp. 238\u2013252. ACM Press (1977)","DOI":"10.1145\/512950.512973"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: ACM Principles of Programming Languages (POPL), pp. 84\u201397. ACM Press (1978)","DOI":"10.1145\/512760.512770"},{"key":"11_CR7","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Linear Programming 2: Theory and Extensions","author":"GB Dantzig","year":"2003","unstructured":"Dantzig, G.B., Thapa, M.N.: Linear Programming 2: Theory and Extensions. Springer Series in Operations Research and Financial Engineering. Springer, New York (2003)"},{"key":"11_CR8","unstructured":"Fouilh\u00e9, A.: Revisiting the abstract domain of polyhedra: constraints-only representation and formal proof. Ph.D. thesis, Universit\u00e9 de Grenoble (2015)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-12154-3_13","volume-title":"Verified Software: Theories, Tools and Experiments","author":"A Fouilhe","year":"2014","unstructured":"Fouilhe, A., Boulm\u00e9, S.: A certifying frontend for (sub)polyhedral abstract domains. In: Giannakopoulou, D., Kroening, D. (eds.) VSTTE 2014. LNCS, vol. 8471, pp. 200\u2013215. Springer, Cham (2014). doi: 10.1007\/978-3-319-12154-3_13"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-38856-9_19","volume-title":"Static Analysis","author":"A Fouilhe","year":"2013","unstructured":"Fouilhe, A., Monniaux, D., P\u00e9rin, M.: Efficient generation of correctness certificates for the abstract domain of polyhedra. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol. 7935, pp. 345\u2013365. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38856-9_19"},{"issue":"7","key":"11_CR11","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/mnsc.18.7.406","volume":"18","author":"T Gal","year":"1972","unstructured":"Gal, T., Nedoma, J.: Multiparametric linear programming. Manage. Sci. 18(7), 406\u2013422 (1972)","journal-title":"Manage. Sci."},{"key":"11_CR12","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). (in french)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10703-006-0013-2","volume":"29","author":"N Halbwachs","year":"2006","unstructured":"Halbwachs, N., Merchat, D., Gonnord, L.: Some ways to reduce the space dimension in polyhedra computations. Formal Meth. Syst. Des. 29(1), 79\u201395 (2006)","journal-title":"Formal Meth. Syst. Des."},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.entcs.2012.11.003","volume":"289","author":"J Henry","year":"2012","unstructured":"Henry, J., Monniaux, D., Moy, M.: PAGAI: a path sensitive static analyser. Electron. Notes Theoret. Comput. Sci. 289, 15\u201325 (2012)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"11_CR15","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). doi: 10.1007\/978-3-642-33125-1_6"},{"key":"11_CR16","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). doi: 10.1007\/978-3-642-02658-4_52"},{"issue":"2","key":"11_CR17","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10957-008-9384-4","volume":"138","author":"CN Jones","year":"2008","unstructured":"Jones, C.N., Kerrigan, E.C., Maciejowski, J.M.: On polyhedral projections and parametric programming. J. Optim. Theory Appl. 138(2), 207\u2013220 (2008)","journal-title":"J. Optim. Theory Appl."},{"issue":"10","key":"11_CR18","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1016\/j.automatica.2007.03.008","volume":"43","author":"CN Jones","year":"2007","unstructured":"Jones, C.N., Kerrigan, E.C., Maciejowski, J.M.: Lexicographic perturbation for multiparametric linear programming with applications to control. Automatica 43(10), 1808\u20131816 (2007)","journal-title":"Automatica"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Kohler, D.: Projection of convex polyhedral sets. Ph.D. thesis, University of California, Berkeley (1967)","DOI":"10.21236\/AD0659301"},{"key":"11_CR20","unstructured":"Le Verge, H.: A note on Chernikova\u2019s algorithm. Technical report 1662, INRIA (1992)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-662-49122-5_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Mar\u00e9chal","year":"2016","unstructured":"Mar\u00e9chal, A., Fouilh\u00e9, A., King, T., Monniaux, D., P\u00e9rin, M.: Polyhedral approximation of multivariate polynomials using handelman\u2019s theorem. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 166\u2013184. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49122-5_8"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Mar\u00e9chal, A., Monniaux, D., P\u00e9rin, M.: Scalable minimizing-operators on polyhedra via parametric linear programming. Technical report 4, Verimag, June 2017","DOI":"10.1007\/978-3-319-66706-5_11"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-52234-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Mar\u00e9chal","year":"2017","unstructured":"Mar\u00e9chal, A., P\u00e9rin, M.: Efficient elimination of redundancies in polyhedra by Raytracing. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 367\u2013385. Springer, Cham (2017). doi: 10.1007\/978-3-319-52234-0_20"},{"key":"11_CR24","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17, 179\u2013184 (1970)","journal-title":"Mathematika"},{"key":"11_CR25","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Convex Polytopes and the Upper Bound Conjecture","author":"P McMullen","year":"1971","unstructured":"McMullen, P., Shepard, G.C.: Convex Polytopes and the Upper Bound Conjecture. London Mathematical Society Lecture Note Series, vol. 3. Cambridge University Press, Cambridge (1971)"},{"issue":"1","key":"11_CR26","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":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-14295-6_51","volume-title":"Computer Aided Verification","author":"D Monniaux","year":"2010","unstructured":"Monniaux, D.: Quantifier elimination by lazy model enumeration. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 585\u2013599. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14295-6_51"},{"issue":"1\u20132","key":"11_CR28","first-page":"3","volume":"72","author":"B Roberto","year":"2008","unstructured":"Roberto, B., Hill, P.M., Zaffanella, E.: The Parma polyhedra library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1\u20132), 3\u201321 (2008)","journal-title":"Sci. Comput. Program."},{"key":"11_CR29","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1999","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1999)"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/11547662_23","volume-title":"Static Analysis","author":"A Simon","year":"2005","unstructured":"Simon, A., King, A.: Exploiting sparsity in polyhedral analysis. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 336\u2013351. Springer, Heidelberg (2005). doi: 10.1007\/11547662_23"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.: Fast polyhedra abstract domain. In: ACM Principles of Programming Languages (POPL), pp. 46\u201359. ACM Press (2017)","DOI":"10.1145\/3009837.3009885"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.T.: Making numerical program analysis fast. In: Programming Language Design and Implementation (PLDI), pp. 303\u2013313. ACM Press (2015)","DOI":"10.1145\/2737924.2738000"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66706-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T10:40:07Z","timestamp":1570012807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66706-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319667058","9783319667065"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66706-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}