{"id":"https://openalex.org/W3109326529","doi":"https://doi.org/10.1145/3493229.3493304","title":"lospre in linear time","display_name":"lospre in linear time","publication_year":2021,"publication_date":"2021-11-01","ids":{"openalex":"https://openalex.org/W3109326529","doi":"https://doi.org/10.1145/3493229.3493304","mag":"3109326529"},"language":"en","primary_location":{"id":"doi:10.1145/3493229.3493304","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3493229.3493304","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2011.10789","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086807055","display_name":"Philipp Klaus Krause","orcid":"https://orcid.org/0000-0002-6668-7891"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Philipp K. Krause","raw_affiliation_strings":["Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany","Albert-Ludwigs Univ. of Freiburg"],"affiliations":[{"raw_affiliation_string":"Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Albert-Ludwigs Univ. of Freiburg","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086807055"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01069519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"41"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7445386648178101},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5862281322479248},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4813328683376312},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.454662024974823},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.45456555485725403},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.4507834017276764},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.43938061594963074},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4260137677192688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38986295461654663},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3394789695739746},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23482894897460938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19159400463104248}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7445386648178101},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5862281322479248},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4813328683376312},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.454662024974823},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.45456555485725403},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.4507834017276764},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.43938061594963074},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4260137677192688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38986295461654663},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3394789695739746},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23482894897460938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19159400463104248},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3493229.3493304","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3493229.3493304","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2011.10789","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2011.10789","pdf_url":"https://arxiv.org/pdf/2011.10789","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3109326529","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2011.10789.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2011.10789","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2011.10789","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2011.10789","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2011.10789","pdf_url":"https://arxiv.org/pdf/2011.10789","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W41457056","https://openalex.org/W104370704","https://openalex.org/W143512583","https://openalex.org/W1525019394","https://openalex.org/W1685122025","https://openalex.org/W1818617877","https://openalex.org/W1964054968","https://openalex.org/W1983166063","https://openalex.org/W1989556004","https://openalex.org/W1989787788","https://openalex.org/W1995362766","https://openalex.org/W2002374396","https://openalex.org/W2002722727","https://openalex.org/W2009339416","https://openalex.org/W2025317174","https://openalex.org/W2027698649","https://openalex.org/W2028357390","https://openalex.org/W2056653303","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2066585576","https://openalex.org/W2074737297","https://openalex.org/W2082504162","https://openalex.org/W2086831405","https://openalex.org/W2087086761","https://openalex.org/W2090992322","https://openalex.org/W2100437891","https://openalex.org/W2118263004","https://openalex.org/W2125555950","https://openalex.org/W2129393463","https://openalex.org/W2134093679","https://openalex.org/W2150082535","https://openalex.org/W2156858199","https://openalex.org/W2345880976","https://openalex.org/W2808273647","https://openalex.org/W2918527871","https://openalex.org/W2920157079","https://openalex.org/W3009206924","https://openalex.org/W3185868054","https://openalex.org/W4234535942","https://openalex.org/W4238167709","https://openalex.org/W4239035626","https://openalex.org/W4252737723"],"related_works":["https://openalex.org/W3213132182","https://openalex.org/W2002427499","https://openalex.org/W3021430041","https://openalex.org/W2406359714","https://openalex.org/W3176132189","https://openalex.org/W2554165547","https://openalex.org/W2541520394","https://openalex.org/W3015682217","https://openalex.org/W2952585827","https://openalex.org/W2609269940","https://openalex.org/W2161044171","https://openalex.org/W2903256317","https://openalex.org/W2953023573","https://openalex.org/W5947967","https://openalex.org/W1523037784","https://openalex.org/W3121218067","https://openalex.org/W175405321","https://openalex.org/W2026790447","https://openalex.org/W185173282","https://openalex.org/W3044953000"],"abstract_inverted_index":{"Lifetime-optimal":[0],"speculative":[1],"partial":[2],"redundancy":[3,12],"elimination":[4,13],"(lospre)":[5],"is":[6,83,89,107,120,149],"the":[7,87,92,97,126,141,164,170,183],"most":[8],"advanced":[9],"currently":[10],"known":[11,19,36,172],"technique.":[14],"It":[15],"subsumes":[16],"many":[17,111],"previously":[18,35,171],"approaches,":[20],"such":[21,117],"as":[22,118],"common":[23,27],"subexpression":[24,28],"elimination,":[25,29],"global":[26],"and":[30,51,85,114,154,174],"loop-invariant":[31],"code":[32],"motion.":[33],"However,":[34],"lospre":[37,62],"algorithms":[38,176],"have":[39,48],"high":[40],"time":[41],"complexity;":[42],"faster":[43],"but":[44],"less":[45],"powerful":[46],"approaches":[47],"been":[49],"used":[50],"developed":[52],"further":[53],"instead.":[54],"We":[55,78,157],"present":[56],"a":[57,123,136],"simple":[58],"linear-time":[59],"algorithm":[60],"for":[61,63,110,115,161],"structured":[64,106,162],"programs":[65,103],"that":[66,80,86],"can":[67,177],"also":[68,158],"handle":[69],"some":[70],"more":[71],"general":[72],"scenarios":[73],"compared":[74],"to":[75,122],"previous":[76,184],"approaches.":[77],"prove":[79],"our":[81,145],"approach":[82,148],"optimal":[84],"runtime":[88,165],"linear":[90],"in":[91,96,135],"number":[93,127],"of":[94,104,128,144,166,169,186],"nodes":[95],"control-flow":[98],"graph.":[99],"The":[100],"condition":[101],"on":[102,125,151],"being":[105],"automatically":[108],"true":[109],"programming":[112],"languages":[113],"others,":[116],"C,":[119],"equivalent":[121],"bound":[124],"goto":[129],"labels":[130],"per":[131],"function.":[132],"An":[133],"implementation":[134],"mainstream":[137],"C":[138],"compiler":[139],"demonstrates":[140],"practical":[142],"feasibility":[143],"approach.":[146],"Our":[147],"based":[150],"graph-structure":[152],"theory":[153],"uses":[155],"tree-decompositions.":[156],"show":[159],"that,":[160],"programs,":[163],"deterministic":[167],"implementations":[168],"MC-PRE":[173],"MC-SSAPRE":[175],"be":[178],"bounded":[179],"by":[180],"$O(n^{2.5})$,":[181],"improving":[182],"bounds":[185],"$O(n^3)$.":[187]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}