{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T19:27:23Z","timestamp":1673206043808},"reference-count":24,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-6423(02)00130-2","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"121-144","source":"Crossref","is-referenced-by-count":1,"title":["Infinitary relations and their representation"],"prefix":"10.1016","volume":"47","author":[{"given":"Laurent","family":"Mauborgne","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(02)00130-2_BIB1","first-page":"218","article-title":"Differential BDDs","volume":"Vol. 1000","author":"Anuchitanakul","year":"1995"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB2","series-title":"8th International Symposium on Programming Languages, Implementation, Logic and Programs","first-page":"107","article-title":"A reactive implementation of pos using ROBDDs","volume":"Vol. 1140","author":"Bagnara","year":"1996"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB3","unstructured":"J.P. Billon, Perfect normal form for discrete programs, Technical Report 87039, BULL, 1987."},{"key":"10.1016\/S0167-6423(02)00130-2_BIB4","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph based algorithms for boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0167-6423(02)00130-2_BIB5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic boolean manipulation with ordered binary-decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB6","series-title":"International Congress on Logic, Methodology and Philosophy of Science","article-title":"On a decision method in restricted second order arithmetics","author":"B\u00fcchi","year":"1960"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB7","series-title":"Fifth Annual Symposium on Logic in Computer Science","article-title":"Symbolic modek checking","author":"Burch","year":"1990"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB8","series-title":"Workshop on Static Analysis, no. 81\u201382, Bigre","article-title":"The \u03bc-calculus over finite domains as an abstract semantics of Prolog","author":"Corsini","year":"1992"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB9","unstructured":"P. Cousot, M\u00e9thodes it\u00e9ratives de construction et d'approximation de points fixes d'op\u00e9rateurs monotones sur un treillis, analyse s\u00e9mantique des programmes, Ph.D. Thesis, Universit\u00e9 de Grenoble, March 1978."},{"key":"10.1016\/S0167-6423(02)00130-2_BIB10","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot, Abstract interpretation; a unified lattice model for static analysis of programs by construction of approximation of fixpoints, in: 4th ACM Symposium on Principles of Programming Languages (POPL \u201977), Los Angeles, CA, 1977, pp. 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB11","series-title":"International Conference on Computer-Aided Design","first-page":"3","article-title":"Evaluation and improvements of boolean comparison method based on binary decision diagram","author":"Fujita","year":"1988"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB12","series-title":"Computer Aided Verification","first-page":"15","article-title":"Parametric circuit representation using inductive boolean functions","volume":"Vol. 697","author":"Gupta","year":"1993"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB13","series-title":"International Conference on Computer-Aided Design","first-page":"476","article-title":"Variable ordering and selection for FSM traversal","author":"Jeong","year":"1991"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB14","doi-asserted-by":"crossref","unstructured":"B. Le Charlier, P. van Hentenryck, Groundness analysis for Prolog: Implementation and evaluation of the domain prop, in: PEPM\u201993, Copenhagen, Denmark, 1993.","DOI":"10.1145\/154630.154641"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB15","series-title":"12th International Joint Conference on Artificial Intelligence","first-page":"294","article-title":"A logically complete reasoning maintenance system based on a logical constraint solver","author":"Madre","year":"1991"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB16","series-title":"Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency","first-page":"201","article-title":"The anchored version of the temporal framework","volume":"Vol. 354","author":"Manna","year":"1988"},{"issue":"1","key":"10.1016\/S0167-6423(02)00130-2_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-6423(96)00042-1","article-title":"Abstract interpretation using typed decision graphs","volume":"31","author":"Mauborgne","year":"1998","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB18","unstructured":"L. Mauborgne, Representation of sets of trees for abstract interpretation, Ph.D. Thesis, \u00c9cole Polytechnique, 1999."},{"key":"10.1016\/S0167-6423(02)00130-2_BIB19","series-title":"European Symposium on Programming (ESOP 2000)","first-page":"275","article-title":"Improving the representation of infinite trees to deal with sets of trees","volume":"Vol. 1782","author":"Mauborgne","year":"2000"},{"issue":"4","key":"10.1016\/S0167-6423(02)00130-2_BIB20","first-page":"290","article-title":"An incremental unique representation for regular trees","volume":"7","author":"Mauborgne","year":"2000","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0167-6423(02)00130-2_BIB21","series-title":"Static Analysis Symposium (SAS\u201900)","first-page":"302","article-title":"Tree schemata and fair termination","volume":"Vol. 1824","author":"Mauborgne","year":"2000"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/218019a0","article-title":"\u201cmemo\u201d functions and machine learning","volume":"218","author":"Michie","year":"1968","journal-title":"Nature"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB23","series-title":"12th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0015772","article-title":"The complementation problem for b\u00fcchi automata, with applications to temporal logic","author":"Sistla","year":"1985"},{"key":"10.1016\/S0167-6423(02)00130-2_BIB24","doi-asserted-by":"crossref","unstructured":"A. Srinivasan, T. Kam, S. Malik, R.K. Brayton, Algorithms for discrete function manipulation, in: IEEE International Conference on Computer-Aided Design, Santa Clara, CA, 1990, pp. 92\u201395.","DOI":"10.1109\/ICCAD.1990.129849"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302001302?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302001302?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T16:52:49Z","timestamp":1553705569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642302001302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":24,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167642302001302"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(02)00130-2","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}