{"id":"https://openalex.org/W2007984116","doi":"https://doi.org/10.1145/1869459.1869483","title":"Monitor optimization via stutter-equivalent loop transformation","display_name":"Monitor optimization via stutter-equivalent loop transformation","publication_year":2010,"publication_date":"2010-10-17","ids":{"openalex":"https://openalex.org/W2007984116","doi":"https://doi.org/10.1145/1869459.1869483","mag":"2007984116"},"language":"en","primary_location":{"id":"doi:10.1145/1869459.1869483","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1869459.1869483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM international conference on Object oriented programming systems languages and applications","raw_type":"proceedings-article"},"type":"article","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/A5039037722","display_name":"Rahul Purandare","orcid":"https://orcid.org/0000-0001-8677-0601"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rahul Purandare","raw_affiliation_strings":["University of Nebraska - Lincoln, Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"University of Nebraska - Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086757331","display_name":"Matthew B. Dwyer","orcid":"https://orcid.org/0000-0002-1937-1544"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew B. Dwyer","raw_affiliation_strings":["University of Nebraska - Lincoln, Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"University of Nebraska - Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025318877","display_name":"Sebastian Elbaum","orcid":"https://orcid.org/0000-0001-9592-1352"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sebastian Elbaum","raw_affiliation_strings":["University of Nebraska - Lincoln, Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"University of Nebraska - Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039037722"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":4.85365636,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.954039,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"270","last_page":"285"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.754426121711731},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6629530787467957},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6298384070396423},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5765359401702881},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5657463073730469},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5309979915618896},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5269121527671814},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.5003519058227539},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.49242815375328064},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.465512752532959},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43346381187438965},{"id":"https://openalex.org/keywords/loop-fission","display_name":"Loop fission","score":0.43304187059402466},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4304959177970886},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.42736101150512695},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.42526209354400635},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39602094888687134},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3906858265399933},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24449989199638367},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.11003583669662476}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.754426121711731},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6629530787467957},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6298384070396423},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5765359401702881},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5657463073730469},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5309979915618896},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5269121527671814},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.5003519058227539},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.49242815375328064},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.465512752532959},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43346381187438965},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.43304187059402466},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4304959177970886},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.42736101150512695},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.42526209354400635},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39602094888687134},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3906858265399933},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24449989199638367},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.11003583669662476},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1869459.1869483","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1869459.1869483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM international conference on Object oriented programming systems languages and applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1484352283","https://openalex.org/W1498432697","https://openalex.org/W1971327145","https://openalex.org/W1995350708","https://openalex.org/W1996832037","https://openalex.org/W2002089154","https://openalex.org/W2021875003","https://openalex.org/W2044590882","https://openalex.org/W2047276559","https://openalex.org/W2067544274","https://openalex.org/W2086192617","https://openalex.org/W2103714221","https://openalex.org/W2115484804","https://openalex.org/W2115725211","https://openalex.org/W2128223360","https://openalex.org/W2129058735","https://openalex.org/W2129683568","https://openalex.org/W2130711572","https://openalex.org/W2146279349","https://openalex.org/W2150308295","https://openalex.org/W2150593762","https://openalex.org/W2156881251","https://openalex.org/W2158229244","https://openalex.org/W2166091242","https://openalex.org/W2169589594","https://openalex.org/W2339217994","https://openalex.org/W2571737579","https://openalex.org/W4302339081","https://openalex.org/W6629784141"],"related_works":["https://openalex.org/W2888997865","https://openalex.org/W2112914024","https://openalex.org/W2525463489","https://openalex.org/W1608803044","https://openalex.org/W2970480852","https://openalex.org/W4205784628","https://openalex.org/W1970625600","https://openalex.org/W1483759049","https://openalex.org/W1993524544","https://openalex.org/W2374474610"],"abstract_inverted_index":{"There":[0],"has":[1,30],"been":[2],"significant":[3],"interest":[4],"in":[5,22,27],"equipping":[6],"programs":[7,73],"with":[8],"runtime":[9],"checks":[10],"aimed":[11],"at":[12],"detecting":[13],"errors":[14],"to":[15,40,87],"improve":[16],"fault":[17],"detection":[18],"during":[19],"testing":[20],"and":[21,74],"the":[23,66,76,82],"field.":[24],"Recent":[25],"work":[26],"this":[28],"area":[29],"studied":[31],"methods":[32],"for":[33,69],"efficiently":[34],"monitoring":[35],"a":[36,50],"program":[37,83],"execution's":[38],"conformance":[39],"path":[41],"property":[42],"specifications,":[43],"e.g.,":[44],"such":[45],"as":[46],"those":[47],"captured":[48],"by":[49,65,85],"finite":[51],"state":[52],"automaton.":[53],"These":[54],"techniques":[55],"show":[56],"great":[57],"promise,":[58],"but":[59],"their":[60],"broad":[61],"applicability":[62],"is":[63],"hampered":[64],"fact":[67],"that":[68],"certain":[70],"combinations":[71],"of":[72,78],"properties":[75],"overhead":[77],"checking":[79],"can":[80],"slow":[81],"down":[84],"up":[86],"3500%.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}