{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:47:11Z","timestamp":1752461231597},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6043,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0743-1066(96)00013-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"53-81","source":"Crossref","is-referenced-by-count":6,"title":["A confluent semantic basis for the analysis of concurrent constraint logic programs"],"prefix":"10.1016","volume":"30","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[]},{"given":"Moreno","family":"Falaschi","sequence":"additional","affiliation":[]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[]},{"given":"William","family":"Winsborough","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(96)00013-1_BIB1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01784721","article-title":"Deadlock Analysis in Networks of Communicating Processes","volume":"4","author":"Brookes","year":"1991","journal-title":"Distributed Computing"},{"issue":"4","key":"10.1016\/S0743-1066(96)00013-1_BIB2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(79)90065-6","article-title":"Deadlock Absence Proofs for Networks of Communicating Processes","volume":"9","author":"Chandy","year":"1979","journal-title":"Information Processing Lett."},{"key":"10.1016\/S0743-1066(96)00013-1_BIB3","series-title":"Proc. 8th Int. Conf. on Logic Programming","first-page":"331","article-title":"Suspension Analysis for Concurrent Logic Programs","author":"Codish","year":"1991"},{"issue":"3","key":"10.1016\/S0743-1066(96)00013-1_BIB4","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/177492.177656","article-title":"Suspension Analyses for Concurrent Logic Programs","volume":"16","author":"Codish","year":"1994","journal-title":"ACM Trans. Programming Languages and Syst."},{"key":"10.1016\/S0743-1066(96)00013-1_BIB5","series-title":"Proc. 20th Int. Colloquium on Automata, Languages, and Programming","first-page":"633","article-title":"Efficient Analysis of Concurrent Constraint Logic Programs","volume":"vol. 700","author":"Codish","year":"1993"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB6","series-title":"Proc. North American Conf. on Logic Programming'90","first-page":"215","article-title":"Abstract Interpretation for Concurrent Logic Languages","author":"Codognet","year":"1990"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB7","doi-asserted-by":"crossref","unstructured":"Codognet, C. and Codognet, P., Guarded Constructive Disjunction: Angel or Demon?, in: [20], pp. 345\u2013361.","DOI":"10.1007\/3-540-60299-2_21"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB8","series-title":"Proc. 4th ACM Symp. Principles of Programming Languages, ACM","first-page":"238","article-title":"Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints","author":"Cousot","year":"1977"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB9","series-title":"Proc. 8th IEEE Symp. on Logic in Computer Science","first-page":"210","article-title":"Compositional Analysis for Concurrent Constraint Programming","author":"Falaschi","year":"1993"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB10","series-title":"Proc. 4th Int. Conf. on Algebraic Methodology and Software Technology (AMAST'95)","first-page":"531","article-title":"Confluence and Concurrent Constraint Programming","volume":"vol. 936","author":"Falaschi","year":"1995"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB11","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB12","series-title":"Proc. Int. Conf. on Fifth Generation Computer Systems","first-page":"897","article-title":"Less Abstract Semantics for Abstract Interpretation of FGHC Programs","author":"Horiuchi","year":"1992"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","article-title":"Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation","volume":"13","author":"Janssens","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closures and Fairness in the Semantics of Programming Logic","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/S0743-1066(96)00013-1_BIB15","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB16","series-title":"Proc. 21st ACM Symp. on Principles of Programming Languages","article-title":"Analyzing Logic Programs with Dynamic Scheduling","author":"Marriott","year":"1994"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB17","doi-asserted-by":"crossref","unstructured":"Marriott, K. and Oderski, M., A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice, in: [20], pp. 310\u2013327.","DOI":"10.1007\/3-540-60299-2_19"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB18","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB19","first-page":"289","article-title":"Towards a Theory of Types in Prolog","author":"Mishra","year":"1984"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB20","series-title":"Proc. 1st Int. Conf. on Principles and Practice of Constraint Programming (CP'95)","volume":"vol. 976","year":"1995"},{"issue":"4","key":"10.1016\/S0743-1066(96)00013-1_BIB21","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(84)90027-X","article-title":"Heterogeneous SLD Resolution","volume":"1","author":"Naish","year":"1984","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/S0743-1066(96)00013-1_BIB22","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/117009.117015","article-title":"Data Flow Analysis of Communicating Finite State Machines","volume":"13","author":"Peng","year":"1991","journal-title":"ACM Trans. Programming Languages and Syst."},{"key":"10.1016\/S0743-1066(96)00013-1_BIB23","series-title":"Proc. 18th Annu. ACM Symp. on Principles of Programming Languages, ACM","article-title":"Semantic Foundation of Concurrent Constraint Programming","author":"Saraswat","year":"1991"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB24_1","article-title":"Concurrent Constraint Programming Languages","author":"Saraswat","year":"1989"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB24_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85983-0_15","article-title":"Concurrent Constraint Programming Languages","author":"Saraswat","year":"1993"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB25","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","article-title":"Enumeration of Success Patterns in Logic Programs","volume":"34","author":"Sato","year":"1984","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/S0743-1066(96)00013-1_BIB26","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/72551.72555","article-title":"The Family of Concurrent Logic Programming Languages","volume":"21","author":"Shapiro","year":"1989","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB27","series-title":"Proc. ACM SIGPLAN'94 Conf. on Programming Language Design and Implementation, ACM","first-page":"337","article-title":"Type Analysis of Prolog Using Type Graphs","author":"Van Hentenryck","year":"1994"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB28","series-title":"Proc. 3rd Int. Conf. on Logic Programming","first-page":"255","article-title":"P-Prolog: A Parallel Language Based on Exclusive Relation","volume":"vol. 225","author":"Yang","year":"1986"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB29","series-title":"Proc. 16th Annu. ACM Symp. on Principles of Programming Languages, ACM","first-page":"116","article-title":"Moded Type Systems for Logic Programming","author":"Yelick","year":"1989"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB30","series-title":"Proc. 5th Int. Symp. on Programming Language Implementation and Logic Programming","first-page":"57","article-title":"Abstracting Synchronization in Concurrent Constraint Programming","volume":"vol. 844","author":"Zaffanella","year":"1994"},{"key":"10.1016\/S0743-1066(96)00013-1_BIB31","doi-asserted-by":"crossref","unstructured":"Zaffanella, E., Domain Independent Ask Approximation in ccp, in: [20], pp. 362\u2013379.","DOI":"10.1007\/3-540-60299-2_22"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696000131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696000131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T17:31:37Z","timestamp":1578504697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106696000131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0743106696000131"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(96)00013-1","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}