{"id":"https://openalex.org/W4244879046","doi":"https://doi.org/10.1145/1190216.1190264","title":"Specialization of CML message-passing primitives","display_name":"Specialization of CML message-passing primitives","publication_year":2007,"publication_date":"2007-01-17","ids":{"openalex":"https://openalex.org/W4244879046","doi":"https://doi.org/10.1145/1190216.1190264"},"language":"en","primary_location":{"id":"doi:10.1145/1190216.1190264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","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/A5030967328","display_name":"John Reppy","orcid":"https://orcid.org/0000-0002-5881-298X"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Reppy","raw_affiliation_strings":["University of Chicago"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chicago","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036542454","display_name":"Yingqi Xiao","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yingqi Xiao","raw_affiliation_strings":["University of Chicago"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chicago","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40347166"],"apc_list":null,"apc_paid":null,"fwci":2.7393,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91632609,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"315","last_page":"326"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8825675845146179},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6545403003692627},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.6482043266296387},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.6036626100540161},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.573776125907898},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5398340821266174},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.5322705507278442},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.519744873046875},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.4949297308921814},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4833890497684479},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4416276216506958},{"id":"https://openalex.org/keywords/call-graph","display_name":"Call graph","score":0.41011568903923035},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3858889043331146},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.2097213864326477},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15601322054862976}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8825675845146179},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6545403003692627},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.6482043266296387},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.6036626100540161},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.573776125907898},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5398340821266174},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.5322705507278442},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.519744873046875},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4949297308921814},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4833890497684479},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4416276216506958},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.41011568903923035},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3858889043331146},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.2097213864326477},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15601322054862976}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1190216.1190264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1556803451","https://openalex.org/W1969411922","https://openalex.org/W1978035064","https://openalex.org/W1980895171","https://openalex.org/W1986804682","https://openalex.org/W2004944457","https://openalex.org/W2009863303","https://openalex.org/W2015888335","https://openalex.org/W2036601332","https://openalex.org/W2055341574","https://openalex.org/W2104045047","https://openalex.org/W2123364143","https://openalex.org/W2170466119","https://openalex.org/W2172149339","https://openalex.org/W2912819106","https://openalex.org/W4211008702"],"related_works":["https://openalex.org/W2058218097","https://openalex.org/W2030063121","https://openalex.org/W2380745217","https://openalex.org/W2080046362","https://openalex.org/W2138385884","https://openalex.org/W3002464080","https://openalex.org/W2505543667","https://openalex.org/W2166895275","https://openalex.org/W2998775986","https://openalex.org/W2573637329"],"abstract_inverted_index":{"Concurrent":[0],"ML":[1],"(CML)":[2],"is":[3,10,19,109,150,183,200,217,234],"a":[4,42,55,74,90,113,130,157,163,184],"statically-typed":[5,95],"higher-order":[6,96],"concurrent":[7,97],"language":[8],"that":[9,99,132,137,188,224],"embedded":[11],"in":[12,68,112],"Standard":[13],"ML.":[14],"Its":[15],"most":[16],"notable":[17],"feature":[18],"its":[20],"support":[21],"for":[22,71,94,122],"first-class":[23,38],"synchronous":[24],"operations.":[25,106],"This":[26,107],"mechanism":[27],"allows":[28],"programmers":[29],"to":[30,52,81,167,193,236],"encapsulate":[31],"complicated":[32],"communication":[33,105],"and":[34,62,155,248,259],"synchronization":[35,120],"protocols":[36],"as":[37,243],"abstractions,":[39],"which":[40,165],"encourages":[41],"modular":[43,151,169],"style":[44,170],"of":[45,104,160,171,178,203,211,229,240,256],"programming":[46],"where":[47,118],"the":[48,101,119,145,168,181,190,201,209,212,222,226,254],"underlying":[49],"channels":[50],"used":[51],"communicate":[53],"with":[54],"given":[56],"thread":[57],"are":[58,125,141],"hidden":[59],"behind":[60],"data":[61],"type":[63],"abstraction.While":[64],"CML":[65,83,173],"has":[66,78],"been":[67,79],"active":[69],"use":[70],"well":[72],"over":[73,221],"decade,":[75],"little":[76],"attention":[77],"paid":[80],"optimizing":[82],"programs.":[84,174],"In":[85],"this":[86],"paper,":[87],"we":[88,133],"present":[89],"new":[91],"program":[92],"analysis":[93,148,176,187,220,233,258],"languages":[98],"enables":[100],"compile-time":[102],"specialization":[103,108],"particularly":[110],"important":[111],"multiprocessor":[114],"or":[115],"multicore":[116],"setting,":[117],"overhead":[121],"general-purpose":[123,146],"operations":[124,140],"high.":[126],"Preliminary":[127],"results":[128,210],"from":[129],"prototype":[131],"have":[134,252],"built":[135],"demonstrate":[136],"specialized":[138],"channel":[139],"much":[142],"faster":[143],"than":[144],"operations.Our":[147],"technique":[149],"(i.e.,,":[152],"it":[153],"analyzes":[154],"optimizes":[156],"single":[158],"unit":[159],"abstraction":[161],"at":[162],"time),":[164],"plays":[166],"many":[172],"The":[175,198,214],"consists":[177],"three":[179],"steps:":[180],"first":[182],"type-sensitive":[185],"control-flow":[186,206],"uses":[189],"program's":[191],"type-abstractions":[192],"compute":[194],"more":[195],"precise":[196],"results.":[197,262],"second":[199],"construction":[202],"an":[204,218],"extended":[205],"graph":[207,223],"using":[208],"CFA.":[213],"last":[215],"step":[216],"iterative":[219],"approximates":[225],"usage":[227],"patterns":[228,239],"known":[230],"channels.":[231,250],"Our":[232],"designed":[235],"detect":[237],"special":[238],"use,":[241],"such":[242],"one-shot":[244],"channels,":[245,247],"fan-in":[246],"fan-out":[249],"We":[251],"proven":[253],"safety":[255],"our":[257],"state":[260],"those":[261]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}