{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:04:50Z","timestamp":1648818290759},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0020-0190(01)00314-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"79-88","source":"Crossref","is-referenced-by-count":0,"title":["Managing the granularity of constraint-based analyses by rule transformation"],"prefix":"10.1016","volume":"83","author":[{"given":"Byeong-Mo","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00314-3_BIB001","series-title":"Proceedings of ACM Conference on OOPSLA","article-title":"Fast static analysis of C++ virtual function calls","author":"Bacon","year":"1996"},{"issue":"4","key":"10.1016\/S0020-0190(01)00314-3_BIB002","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1017\/S0956796800000496","article-title":"Abstract interpretation by dyanamic partitioning","volume":"2","author":"Bourdoncle","year":"1992","journal-title":"J. Funct. Programming"},{"issue":"2\u20133","key":"10.1016\/S0020-0190(01)00314-3_BIB003","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract interpretation and application to logic programs","volume":"13","author":"Cousot","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB004","series-title":"Proceedings of '95 Conference on Funtional Programming Languages and Computer Architecture","first-page":"25","article-title":"Formal language, grammars and set-constraint-based program analysis by abstract interpretation","author":"Cousot","year":"1995"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB005","series-title":"Proceedings of International Conference on Compiler Construction","article-title":"Reducing the cost of data flow analysis by congruence partitioning","author":"Duesterwald","year":"1994"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB006","series-title":"ACM SIGPLAN Conference on PLDI","article-title":"Partial online cycle elimination in inclusion constraint graphs","author":"Fahndrich","year":"1998"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB007","series-title":"Proceedings of ACM Symposium on Principles of Programming Languages","article-title":"Componential set-based analysis","author":"Flanagan","year":"1997"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB008","series-title":"Set-based program analysis, Ph.D Thesis","author":"Heintze","year":"1992"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB009","series-title":"Proceedings of the 9th ACM Symposium on Principles of Programming Languages","article-title":"A flexible approach interprocedural data flow analysis and programs with recursive data structures","author":"Jones","year":"1982"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB010","series-title":"Principles of Program Analysis","author":"Nielson","year":"1999"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB011","series-title":"Proceedings of ACM Conference on OOPSLA","article-title":"Scalable propagation-based call graph construction algorithms","author":"Tip","year":"2000"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB012","series-title":"Proceedings of ACM Symposium on Principles of Programming Languages","article-title":"Projection merging: Reducing redundancies in inclusion constraint graphs","author":"Su","year":"2000"},{"key":"10.1016\/S0020-0190(01)00314-3_BIB013","series-title":"Proceedings of 1999 ECOOP Workshop on Formal Techniques for Java Programs, Lisbon, Portugal","article-title":"Exception analysis for Java","author":"Yi","year":"1999"},{"issue":"1","key":"10.1016\/S0020-0190(01)00314-3_BIB014","article-title":"A Cost-effective estimation of uncaught exceptions in Standard ML programs","volume":"237","author":"Yi","year":"2000","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T08:28:56Z","timestamp":1556872136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0020019001003143"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00314-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}