{"id":"https://openalex.org/W2071142966","doi":"https://doi.org/10.1145/2505879.2505902","title":"Efficient computation of program equivalence for confluent concurrent constraint programming","display_name":"Efficient computation of program equivalence for confluent concurrent constraint programming","publication_year":2013,"publication_date":"2013-09-16","ids":{"openalex":"https://openalex.org/W2071142966","doi":"https://doi.org/10.1145/2505879.2505902","mag":"2071142966"},"language":"en","primary_location":{"id":"doi:10.1145/2505879.2505902","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505902","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069477085","display_name":"Lu\u00eds Pino","orcid":"https://orcid.org/0000-0003-4475-7470"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Luis F. Pino","raw_affiliation_strings":["INRIA/DGA and LIX, \u00c9cole Polytechnique, Palaiseau, France","Concurrency, Mobility and Transactions"],"affiliations":[{"raw_affiliation_string":"INRIA/DGA and LIX, \u00c9cole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I4210139461","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Concurrency, Mobility and Transactions","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004609161","display_name":"Filippo Bonchi","orcid":"https://orcid.org/0000-0002-3433-723X"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Filippo Bonchi","raw_affiliation_strings":["Universit\u00e9 de Lyon, LIP, Lyon, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lyon, LIP, Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I100532134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107827722","display_name":"Frank Valencia","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Frank D. Valencia","raw_affiliation_strings":["CNRS and LIX, \u00c9cole Polytechnique, Palaiseau, France","Concurrency, Mobility and Transactions"],"affiliations":[{"raw_affiliation_string":"CNRS and LIX, \u00c9cole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I4210139461","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Concurrency, Mobility and Transactions","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069477085"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210139461"],"apc_list":null,"apc_paid":null,"fwci":0.9954,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.82911133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"263","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7279072999954224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6319689750671387},{"id":"https://openalex.org/keywords/observational-equivalence","display_name":"Observational equivalence","score":0.6023569703102112},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5293952822685242},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5046294927597046},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.4954036474227905},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.476214736700058},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46794265508651733},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4618488848209381},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.43934255838394165},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4289375841617584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38621577620506287},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.3662806749343872},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3015570640563965},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23188555240631104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15354707837104797}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7279072999954224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6319689750671387},{"id":"https://openalex.org/C2777721189","wikidata":"https://www.wikidata.org/wiki/Q17121921","display_name":"Observational equivalence","level":2,"score":0.6023569703102112},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5293952822685242},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5046294927597046},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.4954036474227905},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.476214736700058},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46794265508651733},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4618488848209381},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.43934255838394165},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4289375841617584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38621577620506287},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.3662806749343872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3015570640563965},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23188555240631104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15354707837104797},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2505879.2505902","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505902","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00909394v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00909394","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PPDP 2013 - 15th International Symposium on Principles and Practice of Declarative Programming, Sep 2013, Madrid, Spain. pp.263-274, ⟨10.1145/2505879.2505902⟩","raw_type":"Conference papers"},{"id":"pmh:oai:arpi.unipi.it:11568/900133","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/900133","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7200000286102295}],"awards":[{"id":"https://openalex.org/G4165940507","display_name":null,"funder_award_id":"ANR-09-BLAN-0169-01 PANDA","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1487583155","https://openalex.org/W1523766116","https://openalex.org/W1539807509","https://openalex.org/W1556261722","https://openalex.org/W1582642570","https://openalex.org/W1582856109","https://openalex.org/W1585676371","https://openalex.org/W1769384601","https://openalex.org/W1895748942","https://openalex.org/W2033431741","https://openalex.org/W2041090148","https://openalex.org/W2058115882","https://openalex.org/W2068361557","https://openalex.org/W2072538510","https://openalex.org/W2094220291","https://openalex.org/W2105430692","https://openalex.org/W2124325155","https://openalex.org/W2126431612","https://openalex.org/W2137865376","https://openalex.org/W2143029909","https://openalex.org/W2143082793","https://openalex.org/W2154003318","https://openalex.org/W2156155209","https://openalex.org/W2163319710","https://openalex.org/W2164297069","https://openalex.org/W2463035841","https://openalex.org/W2561675875","https://openalex.org/W2914597273","https://openalex.org/W2951378405","https://openalex.org/W3089306788","https://openalex.org/W4232027917","https://openalex.org/W6631390264"],"related_works":["https://openalex.org/W3036972880","https://openalex.org/W3129725704","https://openalex.org/W2072493788","https://openalex.org/W2257517306","https://openalex.org/W91938043","https://openalex.org/W1768718906","https://openalex.org/W1556046194","https://openalex.org/W1988438613","https://openalex.org/W2020890916","https://openalex.org/W2596262883"],"abstract_inverted_index":{"Concurrent":[0],"Constraint":[1],"Programming":[2],"(ccp)":[3],"is":[4,57,201],"a":[5,90,133,205],"well-established":[6],"declarative":[7],"framework":[8],"from":[9,89,161],"concurrency":[10],"theory.":[11],"Its":[12,197],"foundations":[13],"and":[14,37,183,188],"principles":[15],"e.g.,":[16],"semantics,":[17,187],"proof":[18],"systems,":[19],"axiomatizations,":[20],"have":[21,43],"been":[22,45,170],"thoroughly":[23],"studied":[24],"for":[25,41,63,87,116,143],"over":[26,128],"the":[27,33,51,64,95,104,129,144,162,171],"last":[28],"two":[29,111,123],"decades.":[30],"In":[31,72],"contrast,":[32],"development":[34],"of":[35,53,67,93,106,121,147,157,164,173,203],"algorithms":[36],"automatic":[38],"verification":[39,61,80],"procedures":[40,115,124,159],"ccp":[42,68,148],"hitherto":[44],"far":[46],"too":[47],"little":[48],"considered.":[49],"To":[50],"best":[52],"our":[54,211],"knowledge":[55],"there":[56],"only":[58],"one":[59],"existing":[60],"algorithm":[62,81,108],"standard":[65],"notion":[66],"program":[69,118],"(observational)":[70],"equivalence.":[71,119],"this":[73,79,107],"paper":[74],"we":[75,207],"first":[76],"show":[77],"that":[78,202],"has":[82,125,132,169,177],"an":[83,126,184],"exponential-time":[84],"complexity":[85,105],"even":[86],"programs":[88],"representative":[91],"sub-language":[92],"ccp;":[94],"summation-free":[96],"fragment":[97],"(ccp\\+).":[98],"We":[99],"then":[100],"significantly":[101],"improve":[102],"on":[103],"by":[109],"providing":[110],"alternative":[112],"polynomial-time":[113],"decision":[114],"ccp\\+":[117],"Each":[120],"these":[122],"advantage":[127],"other.":[130],"One":[131],"better":[134],"time":[135],"complexity.":[136],"The":[137,155],"other":[138],"can":[139,190],"be":[140,191],"easily":[141],"adapted":[142],"full":[145],"language":[146],"to":[149,180,193,209],"produce":[150],"significant":[151],"state":[152],"space":[153],"reductions.":[154],"relevance":[156],"both":[158],"derives":[160],"importance":[163],"ccp\\+.":[165],"This":[166],"fragment,":[167],"which":[168],"subject":[172],"many":[174],"theoretical":[175],"studies,":[176],"strong":[178],"ties":[179],"first-order":[181],"logic":[182],"elegant":[185],"denotational":[186],"it":[189],"used":[192],"model":[194],"real-world":[195],"situations.":[196],"most":[198],"distinctive":[199],"feature":[200],"confluence,":[204],"property":[206],"exploit":[208],"obtain":[210],"polynomial":[212],"procedures.":[213]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}