{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:43:39Z","timestamp":1770273819066,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_85","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"1016-1028","source":"Crossref","is-referenced-by-count":42,"title":["A Note on Karr\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"85_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44898-5_19","volume-title":"Static Analysis","author":"R. Bagnara","year":"2003","unstructured":"Bagnara, R., Hill, P., Ricci, E., Zaffanella, E.: Precise Widening Operators for Convex Polyhedra. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 337\u2013354. Springer, Heidelberg (2003)"},{"key":"85_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: 4th POPL (1977)","DOI":"10.1145\/512950.512973"},{"key":"85_CR3","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints among Variables of a Program. In: 5th POPL, pp. 84\u201397 (1978)","DOI":"10.1145\/512760.512770"},{"key":"85_CR4","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.: Discovering Affine Equalities Using Random Interpretation. In: 30th POPL, pp. 74\u201384 (2003)","DOI":"10.1145\/604131.604138"},{"key":"85_CR5","volume-title":"Flow analysis of computer programs","author":"M.S. Hecht","year":"1977","unstructured":"Hecht, M.S.: Flow analysis of computer programs. Elsevier North-Holland, Amsterdam (1977)"},{"key":"85_CR6","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 Inf.\u00a06, 133\u2013151 (1976)","journal-title":"Acta Inf."},{"key":"85_CR7","unstructured":"Leroux, J.: Algorithmique de la V\u00e9rification des Syst\u00e8mes \u00e0 Compteurs: Approximation et Acc\u00e9l\u00e9ration. PhD thesis, Ecole Normale Sup\u00e9rieure de Cachan (2003)"},{"key":"85_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-45309-1_13","volume-title":"Programming Languages and Systems","author":"M. M\u00fcller-Olm","year":"2001","unstructured":"M\u00fcller-Olm, M., R\u00fcthing, O.: The Complexity of Constant Propagation. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 190\u2013205. Springer, Heidelberg (2001)"},{"key":"85_CR9","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Computing Polynomial Program Invariants (2003) (submitted)","DOI":"10.1016\/j.ipl.2004.05.004"},{"key":"85_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/3-540-45789-5_4","volume-title":"Static Analysis","author":"M. M\u00fcller-Olm","year":"2002","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Polynomial Constants are Decidable. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 4\u201319. Springer, Heidelberg (2002)"},{"key":"85_CR11","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise Interprocedural Analysis through Linear Algebra. In: 31st POPL, pp. 330\u2013341 (2004)","DOI":"10.1145\/964001.964029"},{"key":"85_CR12","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:07Z","timestamp":1605759847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}