{"id":"https://openalex.org/W1988233180","doi":"https://doi.org/10.1145/1706299.1706311","title":"A simple, verified validator for software pipelining","display_name":"A simple, verified validator for software pipelining","publication_year":2010,"publication_date":"2010-01-17","ids":{"openalex":"https://openalex.org/W1988233180","doi":"https://doi.org/10.1145/1706299.1706311","mag":"1988233180"},"language":"en","primary_location":{"id":"doi:10.1145/1706299.1706311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1706299.1706311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00529836/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031329578","display_name":"Jean-Baptiste Tristan","orcid":"https://orcid.org/0000-0003-2574-7883"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Baptiste Tristan","raw_affiliation_strings":["INRIA Paris-Rocquencourt, Le Chesnay, France","INRIA, Paris-Rocquencourt, Le Chesnay, France"],"affiliations":[{"raw_affiliation_string":"INRIA Paris-Rocquencourt, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA, Paris-Rocquencourt, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058330133","display_name":"Xavier Leroy","orcid":"https://orcid.org/0000-0002-8971-9171"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Xavier Leroy","raw_affiliation_strings":["INRIA Paris-Rocquencourt, Le Chesnay, France","INRIA, Paris-Rocquencourt, Le Chesnay, France"],"affiliations":[{"raw_affiliation_string":"INRIA Paris-Rocquencourt, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA, Paris-Rocquencourt, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031329578"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":4.4944,"has_fulltext":true,"cited_by_count":53,"citation_normalized_percentile":{"value":0.94873277,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"83","last_page":"92"},"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.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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/software-pipelining","display_name":"Software pipelining","score":0.9020531177520752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8782894015312195},{"id":"https://openalex.org/keywords/validator","display_name":"Validator","score":0.6582999229431152},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5494210720062256},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.5163922905921936},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4964678883552551},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4467509388923645},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.43278220295906067},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.42267754673957825},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.4088902175426483},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.17301592230796814}],"concepts":[{"id":"https://openalex.org/C188854837","wikidata":"https://www.wikidata.org/wiki/Q268469","display_name":"Software pipelining","level":3,"score":0.9020531177520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8782894015312195},{"id":"https://openalex.org/C35292069","wikidata":"https://www.wikidata.org/wiki/Q1575458","display_name":"Validator","level":2,"score":0.6582999229431152},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5494210720062256},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.5163922905921936},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4964678883552551},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4467509388923645},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.43278220295906067},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.42267754673957825},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4088902175426483},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.17301592230796814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1706299.1706311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1706299.1706311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:inria-00529836v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00529836","pdf_url":"https://inria.hal.science/inria-00529836/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Jan 2010, Madrid, Spain. ⟨10.1145/1706299.1706311⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00529836v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00529836","pdf_url":"https://inria.hal.science/inria-00529836/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Jan 2010, Madrid, Spain. ⟨10.1145/1706299.1706311⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1988233180.pdf","grobid_xml":"https://content.openalex.org/works/W1988233180.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W37253703","https://openalex.org/W1491178396","https://openalex.org/W1494199306","https://openalex.org/W1575176197","https://openalex.org/W1774384314","https://openalex.org/W1963718362","https://openalex.org/W1981899763","https://openalex.org/W2005055779","https://openalex.org/W2023035194","https://openalex.org/W2040856861","https://openalex.org/W2042220347","https://openalex.org/W2055394579","https://openalex.org/W2079552794","https://openalex.org/W2088514859","https://openalex.org/W2097699872","https://openalex.org/W2098293014","https://openalex.org/W2110347987","https://openalex.org/W2114067856","https://openalex.org/W2116461111","https://openalex.org/W2129151831","https://openalex.org/W2134087751","https://openalex.org/W2140529677","https://openalex.org/W2140656851","https://openalex.org/W2144387778","https://openalex.org/W2148662736","https://openalex.org/W2152397470","https://openalex.org/W2154942048","https://openalex.org/W2157758640","https://openalex.org/W2911450990","https://openalex.org/W4232919122","https://openalex.org/W4249245425","https://openalex.org/W6601535436","https://openalex.org/W6629325410","https://openalex.org/W6677084613","https://openalex.org/W6830692397"],"related_works":["https://openalex.org/W4237750055","https://openalex.org/W2068350864","https://openalex.org/W2160557488","https://openalex.org/W2136520452","https://openalex.org/W3013660549","https://openalex.org/W2530146034","https://openalex.org/W18945967","https://openalex.org/W1513982523","https://openalex.org/W128077810","https://openalex.org/W2113755524"],"abstract_inverted_index":{"Software":[0],"pipelining":[1],"is":[2,78,99,102],"a":[3,14,51,64],"loop":[4,15,65,113],"optimization":[5,40],"that":[6,55,100],"overlaps":[7],"the":[8,30,36],"execution":[9],"of":[10,13,32,35,95],"several":[11],"iterations":[12],"to":[16,42,59,83,88,106,110],"expose":[17],"more":[18],"instruction-level":[19],"parallelism.":[20],"It":[21],"can":[22,72],"result":[23],"in":[24],"first-class":[25],"performance":[26],"characteristics,":[27],"but":[28],"at":[29],"cost":[31],"significant":[33],"obfuscation":[34],"code,":[37],"making":[38],"this":[39,47,96],"difficult":[41],"test":[43],"and":[44,66,76,81,104],"debug.":[45],"In":[46],"paper,":[48],"we":[49],"present":[50],"translation":[52],"validation":[53],"algorithm":[54,71],"uses":[56],"symbolic":[57,108],"evaluation":[58,109],"detect":[60],"semantics":[61],"discrepancies":[62],"between":[63],"its":[67],"pipelined":[68],"version.":[69],"Our":[70],"be":[73,84],"implemented":[74],"simply":[75],"efficiently,":[77],"provably":[79],"sound,":[80],"appears":[82],"complete":[85],"with":[86],"respect":[87],"most":[89],"modulo":[90],"scheduling":[91],"algorithms.":[92],"A":[93],"conclusion":[94],"case":[97],"study":[98],"it":[101],"possible":[103],"effective":[105],"use":[107],"reason":[111],"about":[112],"transformations.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}