{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:58:12Z","timestamp":1752983892642},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697350"},{"type":"electronic","value":"9783540697381"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-69738-1_20","type":"book-chapter","created":{"date-parts":[[2007,11,12]],"date-time":"2007-11-12T07:58:07Z","timestamp":1194854287000},"page":"268-282","source":"Crossref","is-referenced-by-count":17,"title":["An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints"],"prefix":"10.1007","author":[{"given":"Mathias","family":"P\u00e9ron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Halbwachs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Information and Computation\u00a0104(1), 2\u201334 (1993)","journal-title":"Information and Computation"},{"key":"20_CR2","first-page":"46","volume-title":"PLDI\u201993","author":"F. Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: PLDI\u201993, pp. 46\u201355. ACM, New York (1993)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: 2nd Int. Symp. on Programming, pp. 106\u2013130. Dunod, Paris (1976)","DOI":"10.1145\/390019.808314"},{"key":"20_CR4","unstructured":"Claris\u00f3, R.C., Cortadella, J.: Verification of parametric timed circuits using octahedra. In: Designing correct circuits, DCC\u201904, Barcelona (2004)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL\u201978, pp. 84\u201396 (January 1978)","DOI":"10.1145\/512760.512770"},{"key":"20_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., et al.: Introduction to Algorithms. The MIT Press, Cambridge (1990)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: beyond k-limiting. In: PLDI\u201994, pp. 230\u2013241 (1994)","DOI":"10.1145\/773473.178263"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D.L. Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. LNCS, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1990)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-09526-8_27","volume-title":"Mathematical Foundations of Computer Science 1979","author":"A. Goralcikov\u00e1","year":"1979","unstructured":"Goralcikov\u00e1, A., Koubek, V.: A reduct-and-closure algorithm for graphs. In: Becvar, J. (ed.) Mathematical Foundations of Computer Science 1979. LNCS, vol.\u00a074, pp. 301\u2013307. Springer, Heidelberg (1979)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-53982-4_10","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991","author":"P. Granger","year":"1991","unstructured":"Granger, P.: Static analysis of linear congruence equalities among variables of a program. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol.\u00a0493, pp. 169\u2013192. Springer, Heidelberg (1991)"},{"key":"20_CR11","unstructured":"Harvey, W., Stuckey, P.J.: A unit two variable per inequality integer constraint solver for constraint logic programming. In: Twentieth Australasian Computer Science Conference, ACSC\u201997, pp. 102\u2013111 (February 1997)"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1022323717928","volume":"8","author":"W. Harvey","year":"2003","unstructured":"Harvey, W., Stuckey, P.J.: Improving linear constraint propagation by changing constraint representation. Constraints\u00a08(2), 173\u2013207 (2003)","journal-title":"Constraints"},{"key":"20_CR13","unstructured":"Imbert, J.-L.: Variable elimination for generalized linear constraints. In: ICLP\u201993, pp. 499\u2013516 (1993)"},{"key":"20_CR14","unstructured":"Jeannet, B.: The NBAC verification\/slicing tool, http:\/\/www.inrialpes.fr\/pop-art\/people\/bjeannet\/nbac\/"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48294-6_3","volume-title":"Static Analysis","author":"B. Jeannet","year":"1999","unstructured":"Jeannet, B., Halbwachs, N., Raymond, P.: Dynamic partitioning in analyses of numerical properties. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, Springer, Heidelberg (1999)"},{"key":"20_CR16","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"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0747-7171(92)90002-L","volume":"13","author":"J.-L. Lassez","year":"1992","unstructured":"Lassez, J.-L., McAloon, K.: A canonical form for generalized linear constraints. J. Symb. Comput.\u00a013(1), 1\u201324 (1992)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"20_CR18","first-page":"271","volume":"6","author":"K.G. Larsen","year":"1999","unstructured":"Larsen, K.G., et al.: Clock difference diagrams. Nordic J. of Computing\u00a06(3), 271\u2013298 (1999)","journal-title":"Nordic J. of Computing"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Masdupuy, F.: Semantic analysis of interval congruences. In: International Conference on Formal Methods in Programming and Their Applications, pp. 142\u2013155 (1993)","DOI":"10.1007\/BFb0039705"},{"key":"20_CR20","first-page":"310","volume-title":"AST 2001 in WCRE 2001","author":"A. Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: AST 2001 in WCRE 2001, pp. 310\u2013319. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45789-5_11","volume-title":"Static Analysis","author":"A. Min\u00e9","year":"2002","unstructured":"Min\u00e9, A.: A few graph-based relational numerical abstract domains. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 117\u2013132. Springer, Heidelberg (2002)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-48168-0_9","volume-title":"Computer Science Logic","author":"J.B. M\u00f8ller","year":"1999","unstructured":"M\u00f8ller, J.B., et al.: Difference decision diagrams. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 111\u2013125. Springer, Heidelberg (1999)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"L. Mauborgne","year":"2005","unstructured":"Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, Springer, Heidelberg (2005)"},{"key":"20_CR24","series-title":"Lecture Notes in Artificial Intelligence","first-page":"359","volume-title":"Assistive Technology and Artificial Intelligence","author":"J.-F. Puget","year":"1998","unstructured":"Puget, J.-F.: A fast algorithm for the bound consistency of alldiff constraints. In: Mittal, V.O., et al. (eds.) Assistive Technology and Artificial Intelligence. LNCS (LNAI), vol.\u00a01458, pp. 359\u2013366. Springer, Heidelberg (1998)"},{"issue":"3","key":"20_CR25","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/291889.291900","volume":"20","author":"W. Pugh","year":"1998","unstructured":"Pugh, W., Wonnacott, D.: Constraint-based array dependence analysis. TOPLAS\u00a020(3), 635\u2013678 (1998)","journal-title":"TOPLAS"},{"key":"20_CR26","unstructured":"Rosenkrantz, D.J., Hunt III, H.B.: Processing conjunctive predicates and ueries. In: VLDB, pp. 64\u201372 (1980)"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-57273-2_69","volume-title":"Algorithms - ESA \u201993","author":"K. Simon","year":"1993","unstructured":"Simon, K., Crippa, D., Collenberg, F.: On the distribution of the transitive closure in a random acyclic digraph. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol.\u00a0726, pp. 345\u2013356. Springer, Heidelberg (1993)"},{"issue":"1-3","key":"20_CR28","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(88)90032-1","volume":"58","author":"K. Simon","year":"1988","unstructured":"Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. TCS\u00a058(1-3), 325\u2013346 (1988)","journal-title":"TCS"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_2","volume-title":"Static Analysis","author":"S. Sankaranarayanan","year":"2006","unstructured":"Sankaranarayanan, S., et al.: Static analysis in disjunctive numerical domains. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, Springer, Heidelberg (2006)"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11596110_20","volume-title":"Languages and Compilers for Parallel Computing","author":"R. Seater","year":"2005","unstructured":"Seater, R., Wonnacott, D.: Efficient Manipulation of Disequalities During Dependence Analysis. In: Pugh, B., Tseng, C.-W. (eds.) LCPC 2002. LNCS, vol.\u00a02481, pp. 295\u2013308. Springer, Heidelberg (2005)"}],"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-540-69738-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T13:49:26Z","timestamp":1684072166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69738-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540697350","9783540697381"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69738-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}