{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:46:16Z","timestamp":1725515176605},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691631"},{"type":"electronic","value":"9783540691662"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69166-2_4","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T09:25:03Z","timestamp":1215941103000},"page":"47-61","source":"Crossref","is-referenced-by-count":0,"title":["Convex Hull of Arithmetic Automata"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-73368-3_36","volume-title":"Computer Aided Verification","author":"B. Becker","year":"2007","unstructured":"Becker, B., Dax, C., Eisinger, J., Klaedtke, F.: Lira: Handling constraints of linear arithmetics over the integers and the reals. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 307\u2013310. Springer, Heidelberg (2007)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/11817963_40","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"2006","unstructured":"Boigelot, B., Herbreteau, F.: The power of hybrid acceleration. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 438\u2013451. Springer, Heidelberg (2006)"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1071596.1071601","volume":"6","author":"B. Boigelot","year":"2005","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Log.\u00a06(3), 614\u2013633 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11817963_9","volume-title":"Computer Aided Verification","author":"S. Bardin","year":"2006","unstructured":"Bardin, S., Leroux, J., Point, G.: Fast extended release. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 63\u201366. Springer, Heidelberg (2006)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0055049","volume-title":"Automata, Languages and Programming","author":"B. Boigelot","year":"1998","unstructured":"Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata (extended abstract). In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 152\u2013163. Springer, Heidelberg (1998)"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ipl.2005.04.004","volume":"96","author":"A. Finkel","year":"2005","unstructured":"Finkel, A., Leroux, J.: The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Information Processing Letter\u00a096(1), 30\u201335 (2005)","journal-title":"Information Processing Letter"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"Karr, M.: Affine relationships among variables of a program. Acta Informatica\u00a06, 133\u2013151 (1976)","journal-title":"Acta Informatica"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/LICS.2004.1319606","volume-title":"19th IEEE Symposium on Logic in Computer Science (LICS 2004)","author":"L. Latour","year":"2004","unstructured":"Latour, L.: From automata to formulas: Convex integer polyhedra. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), Turku, Finland, July 14-17, 2004, pp. 120\u2013129. IEEE Computer Society, Los Alamitos (2004)"},{"key":"4_CR9","first-page":"89","volume-title":"Verification of Infinite State Systems, 5th International Workshop, INFINITY 2003","author":"J. Leroux","year":"2003","unstructured":"Leroux, J.: The affine hull of a binary automaton is computable in polynomial time. In: Verification of Infinite State Systems, 5th International Workshop, INFINITY 2003, Marseille, France, September 2, 2003, vol.\u00a098, pp. 89\u2013104. Elsevier, Amsterdam (2003)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/LICS.2005.2","volume-title":"20th IEEE Symposium on Logic in Computer Science (LICS 2005)","author":"J. Leroux","year":"2005","unstructured":"Leroux, J.: A polynomial time presburger criterion and synthesis for number decision diagrams. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), Chicago, IL, USA, June 26-29, 2005, pp. 147\u2013156. IEEE Computer Society, Los Alamitos (2005)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Leroux, J., Point, G.: TaPAS: The Talence Presburger Arithmetic Suite (submited, 2008)","DOI":"10.1007\/978-3-642-00768-2_18"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74061-2_12","volume-title":"Static Analysis","author":"J. Leroux","year":"2007","unstructured":"Leroux, J., Sutre, G.: Accelerated data-flow analysis. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, Springer, Heidelberg (2007)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-540-77050-3_43","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"J. Leroux","year":"2007","unstructured":"Leroux, J., Sutre, G.: Acceleration in convex data-flow analysis. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 520\u2013531. Springer, Heidelberg (2007)"},{"key":"4_CR14","series-title":"D. Lugiez","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-540-30500-2_35","volume-title":"Implementation and Application of Automata","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D.: From automata to semilinear sets: A logical solution for sets L(C, P). In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. D. Lugiez, vol.\u00a03317, pp. 321\u2013322. Springer, Heidelberg (2005)"},{"key":"4_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69166-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:19:47Z","timestamp":1558279187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69166-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540691631","9783540691662"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69166-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}