{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:48Z","timestamp":1742617188835,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:18:48Z","timestamp":1330294728000},"page":"189-204","source":"Crossref","is-referenced-by-count":10,"title":["An even faster solver for general systems of equations"],"prefix":"10.1007","author":[{"given":"Christian","family":"Fecht","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"F. Bourdoncle. Abstract Interpretation by Dynamic Partitioning. Journal of Functional Programming, 2(4), 1992.","DOI":"10.1017\/S0956796800000496"},{"key":"14_CR2","volume-title":"Technical report 92-22","author":"B. Charlier Le","year":"1992","unstructured":"B. Le Charlier and P. Van Hentenryck. A Universal Top-Down Fixpoint Algorithm. Technical report 92-22, Institute of Computer Science, University of Namur, Belgium, 1992."},{"issue":"1","key":"14_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. Charlier Le","year":"1994","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. TOPLAS, 16(1):35\u2013101, 1994.","journal-title":"TOPLAS"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and B. Steffen. A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus. In CAV'91. Springer, LNCS 575, 1991.","DOI":"10.1007\/3-540-55179-4_6"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"A. Cortesi, G. Fil\u00e9, and W. Winsborough. Prop revisited: Propositional formulas as abstract domain for groundness analysis. In LICS'91, 322\u2013327, Amsterdam, The Netherlands, 1991.","DOI":"10.1109\/LICS.1991.151656"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In POPL'77, 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming, 13(2):103\u2013179, 1992.","journal-title":"Journal of Logic Programming"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(86)90034-4","volume":"46","author":"A. Dicky","year":"1986","unstructured":"A. Dicky. An Algebraic and Algorithmic Method of Analysing Transition Systems. TCS, 46:285\u2013303, 1986.","journal-title":"TCS"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Christian Fecht. GENA \u2014 a Tool for Generating Prolog Analyzers from Specifications. SAS'95, 418\u2013419. Springer Verlang, LNCS 983, 1995.","DOI":"10.1007\/3-540-60360-3_53"},{"key":"14_CR10","volume-title":"Flow Analysis of Computer Programs","author":"M.S. Hecht","year":"1977","unstructured":"M.S. Hecht. Flow Analysis of Computer Programs. Amsterdam: Elsevier North-Holland, 1977."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00282621","volume":"24","author":"S. Horwitz","year":"1987","unstructured":"S. Horwitz, A. Demers and T. Teitelbaum. An Efficient General Iteration Algorithm for Dataflow Analysis. Acta Informatica, 24, 679\u2013694, 1987.","journal-title":"Acta Informatica"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"N. J\u00d8rgensen. Finding Fixpoints in Finite Function Spaces Using Neededness Analysis and Chaotic Iteration. In SAS'94, 329\u2013345. Springer, LNCS 864, 1994.","DOI":"10.1007\/3-540-58485-4_50"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"G.A. Kildall. A Unified Approach to Global Program Optimization. In POPL'73, 194\u2013206, 1973.","DOI":"10.1145\/512927.512945"},{"issue":"3","key":"14_CR14","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/177492.177650","volume":"16","author":"K. Marriott","year":"1994","unstructured":"K. Marriott, H. S\u00d8ndergaard, and N.D. Jones. Denotational Abstract Interpretation of Logic Programs. ACM Transactions of Programming Languages and Systems, 16(3):607\u2013648, 1994.","journal-title":"ACM Transactions of Programming Languages and Systems"},{"key":"14_CR15","unstructured":"M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Application, 189\u2013233. Prentice-Hall, 1981."},{"issue":"3","key":"14_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(94)00029-6","volume":"23","author":"P. Hentenryck Van","year":"1995","unstructured":"P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Evaluation of the domain Prop. The Journal of Logic Programming, 23(3):237\u2013278, 1995.","journal-title":"The Journal of Logic Programming"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"B. Vergauwen, J. Wauman, and J. Lewi. Efficient fixpoint computation. In SAS'94, 314\u2013328. Springer, LNCS 864, 1994.","DOI":"10.1007\/3-540-58485-4_49"},{"key":"14_CR18","unstructured":"R. Wilhelm and D. Maurer. Compiler Construction. Addison-Wesley, 1995."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:24:55Z","timestamp":1742599495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}