{"id":"https://openalex.org/W4235600985","doi":"https://doi.org/10.1109/memcod.2003.1210100","title":"Exact runtime analysis using automata-based symbolic simulation","display_name":"Exact runtime analysis using automata-based symbolic simulation","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W4235600985","doi":"https://doi.org/10.1109/memcod.2003.1210100"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2003.1210100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","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/A5081546580","display_name":"Tobias Sch\u00fcle","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"T. Schule","raw_affiliation_strings":["Department of Computer Science, Reactive Systems Group, University of Kaiserslautern, Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Reactive Systems Group, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081184867","display_name":"Klaus Schneider","orcid":"https://orcid.org/0000-0002-1305-7132"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"K. Schneider","raw_affiliation_strings":["Department of Computer Science, Reactive Systems Group, University of Kaiserslautern, Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Reactive Systems Group, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081546580"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":1.0635,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79378784,"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":"153","last_page":"162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8240708112716675},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.7429141402244568},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6522446870803833},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6479459404945374},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.589140772819519},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5687248110771179},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.564942479133606},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48367366194725037},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.4513331353664398},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4340601861476898},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.4282345771789551},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.425006628036499},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4232003092765808},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.41921183466911316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37216800451278687},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.15153828263282776},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0856473445892334}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8240708112716675},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7429141402244568},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6522446870803833},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6479459404945374},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.589140772819519},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5687248110771179},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.564942479133606},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48367366194725037},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.4513331353664398},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4340601861476898},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.4282345771789551},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.425006628036499},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4232003092765808},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.41921183466911316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37216800451278687},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.15153828263282776},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0856473445892334},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2003.1210100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W114165006","https://openalex.org/W1533245127","https://openalex.org/W1535950032","https://openalex.org/W1540012118","https://openalex.org/W1557490801","https://openalex.org/W1561021211","https://openalex.org/W1578881602","https://openalex.org/W1777025722","https://openalex.org/W2012140001","https://openalex.org/W2024800288","https://openalex.org/W2080267935","https://openalex.org/W2114067856","https://openalex.org/W2138856440","https://openalex.org/W2147661183","https://openalex.org/W2149932816","https://openalex.org/W2151561628","https://openalex.org/W4231602332","https://openalex.org/W4241066806","https://openalex.org/W4243532162","https://openalex.org/W4302339081","https://openalex.org/W6604714938","https://openalex.org/W6631778176","https://openalex.org/W6634513804","https://openalex.org/W6638089876","https://openalex.org/W6681870916","https://openalex.org/W6683591352","https://openalex.org/W6738225487"],"related_works":["https://openalex.org/W3127558385","https://openalex.org/W3200605392","https://openalex.org/W4210940113","https://openalex.org/W1981523035","https://openalex.org/W4232638395","https://openalex.org/W2024421699","https://openalex.org/W170340177","https://openalex.org/W4317533142","https://openalex.org/W2081396910","https://openalex.org/W2393109501"],"abstract_inverted_index":{"In":[0],"this":[1,56],"paper,":[2],"we":[3,58],"present":[4],"a":[5,60,87],"technique":[6],"for":[7,80],"determining":[8],"tight":[9],"bounds":[10],"on":[11],"the":[12,24,31,44,83],"execution":[13],"time":[14],"of":[15,23,47,52,63,86],"assembler":[16],"programs.":[17],"Thus,":[18],"our":[19],"method":[20],"is":[21,41],"independent":[22],"design":[25],"flow,":[26],"but":[27],"takes":[28],"into":[29],"account":[30],"target":[32],"architecture":[33],"to":[34,42,70],"obtain":[35],"accurate":[36],"estimates.":[37],"The":[38],"key":[39],"idea":[40],"compute":[43],"maximal":[45],"number":[46],"executed":[48],"instructions":[49],"by":[50],"means":[51],"symbolic":[53],"simulation.":[54],"To":[55],"end,":[57],"utilize":[59],"slight":[61],"extension":[62],"Presburger":[64],"arithmetic":[65],"that":[66],"can":[67],"be":[68],"translated":[69],"finite":[71],"automata.":[72],"Finite":[73],"automata":[74],"are":[75],"an":[76],"efficient":[77],"data":[78],"structure":[79],"symbolically":[81],"traversing":[82],"state":[84],"space":[85],"program.":[88]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}