{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:32Z","timestamp":1720624952295},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)80955-1","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"65-76","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Time Stamps for Fixed-Point Approximation"],"prefix":"10.1016","volume":"45","author":[{"given":"Daniel","family":"Damian","sequence":"first","affiliation":[]},{"family":"Brics","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Bourdoncle F., Efficient chaotic iteration strategies with widenings, in: Proceedings of the International Conference on Formal Methods in Programming and their Applications, Lecture Notes in Computer Science 735 (1993), pp. 128\u2013141.","DOI":"10.1007\/BFb0039704"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB2","unstructured":"Charlier, B. L. and P. V. Hentenryck, A universal top-down fixpoint algorithm, Technical Report CS-92-25, Brown University, Providence, Rhode Island (1992)."},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Chen L.-L. and W. L. Harrison, An efficient approach to computing fixpoints for complex program analysis, in: Proceedings of the 8th ACM International Conference on Supercomputing (1994), pp. 98\u2013106.","DOI":"10.1145\/181181.181308"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB4","first-page":"31","article-title":"Efficient computation of fixpoints that arise in complex program analysis","volume":"3","author":"Chen","year":"1995","journal-title":"Journal of Programming Languages"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Clack C. and S. L. Peyton Jones, Strictness analysis\u2013-a practical approach, in: J.-P. Jouannaud, editor, Proceedings of the Second International Conference on Functional Programming and Computer Architecture, number 201 in Lecture Notes in Computer Science (1985), pp. 35\u201349.","DOI":"10.1007\/3-540-15975-4_28"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Cousot P. and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: R. Sethi, editor, Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages (1977), pp. 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Fecht C. and H. Seidl, An even faster solver for general systems of equations, in: R. Cousot and D. A. Schmidt, editors, Proceedings of 3rd Static Analysis Symposium, Lecture Notes in Computer Science 1145 (1996), pp. 189\u2013204.","DOI":"10.1007\/3-540-61739-6_42"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB8","unstructured":"Fecht C. and H. Seidl, Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems, in: C. Hankin, editor, Proceedings of the 7th European Symposium on Programming, Lecture Notes in Computer Science 1381 (1998), pp. 90\u2013104."},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB9","unstructured":"Hunt S., \u201cAbstract Interpretation of Functional Languages: From Theory to Practice,\u201d Ph.D. thesis, Department of Computing, Imperial College of Science Technology and Medicine, London, UK (1991)."},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB10","first-page":"527","volume":"4","author":"Jones","year":"1995"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB11","series-title":"Static Analysis, number 864 in Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-58485-4_50","article-title":"Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration","author":"J\u00f8rgensen","year":"1994"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","article-title":"Monotone data flow analysis frameworks","volume":"7","author":"Kam","year":"1977","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB13","series-title":"\u201cPrinciples of Program Analysis\u201d","author":"Nielson","year":"1999"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB14","unstructured":"O'Keefe, R. A., Finite fixed-point problems, in: J.-L. Lassez, editor, Logic Programming, Proceedings of the Fourth International Conference (1987), pp. 729\u2013743."},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Rosendahl M., Higher-order chaotic iteration sequences, in: M. Bruynooghe and J. Penjam, editors, Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming, number 714 in Lecture Notes in Computer Science (1993), pp. 332\u2013345.","DOI":"10.1007\/3-540-57186-8_89"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Sabry A. and M. Felleisen, Is continuation-passing useful for data flow analysis?, in: V. Sarkar, editor, Proceedings of the ACM SIGPLAN'94 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 29, No 6 (1994), pp. 1\u201312.","DOI":"10.1145\/178243.178244"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","article-title":"Precise interprocedural dataflow analysis with applications to constant propagation","volume":"167","author":"Sagiv","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB18","series-title":"Static Analysis, number 983 in Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60360-3_28","article-title":"Natural-semantics-based abstract interpretation","author":"Schmidt","year":"1995"},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB19","unstructured":"Shivers O., \u201cControl-Flow Analysis of Higher-Order Languages,\u201d Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania (1991), Technical Report CMU-CS-91-145."},{"key":"10.1016\/S1571-0661(04)80955-1_NEWBIB20","unstructured":"Young J. and P. Hudak, Finding fixpoints on function spaces, Technical Report YALEEU\/DCS\/RR-505, Yale University, New Haven, CT (1986)."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:55:38Z","timestamp":1549173338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104809551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":20,"alternative-id":["S1571066104809551"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80955-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}