{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:30:07Z","timestamp":1693852207200},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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,2]]},"DOI":"10.1016\/s0020-0190(01)00223-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"179-185","source":"Crossref","is-referenced-by-count":4,"title":["A proof method for the correctness of modularized 0CFA"],"prefix":"10.1016","volume":"81","author":[{"given":"Oukseh","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwangkeun","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunheung","family":"Paek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00223-X_BIB001","unstructured":"O. Shivers, Control-flow analysis of higher-order languages, Ph.D. Thesis, Carnegie Mellon University, Technical Report CMU-CS-91-145, May 1991"},{"key":"10.1016\/S0020-0190(01)00223-X_BIB002","series-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation","first-page":"261","article-title":"Linear-time subtransitive control flow analysis","author":"Heintze","year":"1997"},{"key":"10.1016\/S0020-0190(01)00223-X_BIB003","series-title":"Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"332","article-title":"Infinitary control flow analysis: A collecting semantics for closure analysis","author":"Nielson","year":"1997"},{"key":"10.1016\/S0020-0190(01)00223-X_BIB004","doi-asserted-by":"crossref","unstructured":"K. Yi, S. Ryu, A cost-effective estimation of uncaught exceptions in Standard ML programs, Theoretical Comput. Sci., to appear; extended version of [5]","DOI":"10.1016\/S0304-3975(00)00317-0"},{"key":"10.1016\/S0020-0190(01)00223-X_BIB005","series-title":"Proceedings of the 4th International Symposium on Static Analysis","first-page":"98","article-title":"Towards a cost-effective estimation of uncaught exceptions in SML programs","volume":"1302","author":"Yi","year":"1997"},{"key":"10.1016\/S0020-0190(01)00223-X_BIB006","unstructured":"K. Yi, S. Ryu, SML\/NJ Exception Analyzer 0.98, URL http:\/\/compiler.kaist.ac.kr\/pub\/exna\/exna-README.html"},{"key":"10.1016\/S0020-0190(01)00223-X_BIB007","series-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation","first-page":"13","article-title":"Separate compilation for Standard ML","author":"Appel","year":"1994"},{"issue":"2","key":"10.1016\/S0020-0190(01)00223-X_BIB008","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1145\/316686.316703","article-title":"Componential set-based analysis","volume":"21","author":"Flanagan","year":"1999","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/S0020-0190(01)00223-X_BIB009","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(91)90033-X","article-title":"Co-induction in relational semantics","volume":"87","author":"Milner","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00223-X_BIB010","series-title":"Research on program analysis system","article-title":"A proof method for the correctness of modularized kCFAs, Technical Memorandum ROPAS-2000-9","author":"Lee","year":"2000"},{"issue":"1","key":"10.1016\/S0020-0190(01)00223-X_BIB011","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/271510.271523","article-title":"Polymorphic splitting: An effective polyvariant flow analysis","volume":"20","author":"Wright","year":"1998","journal-title":"ACM Trans. Prog. Lang. Syst."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900100223X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900100223X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T05:50:32Z","timestamp":1556862632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900100223X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S002001900100223X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00223-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}