{"id":"https://openalex.org/W2101329288","doi":"https://doi.org/10.1109/hldvt.2009.5340168","title":"A symbolic execution framework for algorithm-level modelling","display_name":"A symbolic execution framework for algorithm-level modelling","publication_year":2009,"publication_date":"2009-11-01","ids":{"openalex":"https://openalex.org/W2101329288","doi":"https://doi.org/10.1109/hldvt.2009.5340168","mag":"2101329288"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2009.5340168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2009.5340168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International High Level Design Validation and Test Workshop","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/A5068008369","display_name":"Ziyad Hanna","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ziyad Hanna","raw_affiliation_strings":["Computing Laboratory, Oxford University, Oxford, UK","Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Laboratory, Oxford University, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, England","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015518667","display_name":"Tom Melham","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tom Melham","raw_affiliation_strings":["Computing Laboratory, Oxford University, Oxford, UK","Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Laboratory, Oxford University, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, England","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14644285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3114","issue":null,"first_page":"94","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9994000196456909,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8923618793487549},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.8388762474060059},{"id":"https://openalex.org/keywords/abstract-state-machines","display_name":"Abstract state machines","score":0.6834508180618286},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5998928546905518},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5404345393180847},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5356293320655823},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.5167831182479858},{"id":"https://openalex.org/keywords/execution-model","display_name":"Execution model","score":0.4918653964996338},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.448742151260376},{"id":"https://openalex.org/keywords/formal-semantics","display_name":"Formal semantics (linguistics)","score":0.4329254925251007},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.43034934997558594},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.41599804162979126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3747938275337219},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.3064459562301636},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.14985957741737366}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8923618793487549},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.8388762474060059},{"id":"https://openalex.org/C145243422","wikidata":"https://www.wikidata.org/wiki/Q333385","display_name":"Abstract state machines","level":3,"score":0.6834508180618286},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5998928546905518},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5404345393180847},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5356293320655823},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.5167831182479858},{"id":"https://openalex.org/C2776834041","wikidata":"https://www.wikidata.org/wiki/Q25346349","display_name":"Execution model","level":2,"score":0.4918653964996338},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.448742151260376},{"id":"https://openalex.org/C146499914","wikidata":"https://www.wikidata.org/wiki/Q5469969","display_name":"Formal semantics (linguistics)","level":2,"score":0.4329254925251007},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.43034934997558594},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.41599804162979126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3747938275337219},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3064459562301636},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.14985957741737366},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/hldvt.2009.5340168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2009.5340168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International High Level Design Validation and Test Workshop","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:5a8d8c73-9227-4a70-ac38-a02f71015087","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:5a8d8c73-9227-4a70-ac38-a02f71015087","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1504504841","https://openalex.org/W1521083034","https://openalex.org/W1537307653","https://openalex.org/W1549880792","https://openalex.org/W1553693026","https://openalex.org/W1606059631","https://openalex.org/W2048677734","https://openalex.org/W2101512909","https://openalex.org/W2111946363","https://openalex.org/W2112643551","https://openalex.org/W2115929832","https://openalex.org/W2123814724","https://openalex.org/W2130088511","https://openalex.org/W2152540097","https://openalex.org/W2154701980","https://openalex.org/W2172052797","https://openalex.org/W4249778561","https://openalex.org/W6633127449","https://openalex.org/W6662899192"],"related_works":["https://openalex.org/W2385508105","https://openalex.org/W2073736684","https://openalex.org/W2013028647","https://openalex.org/W2124431509","https://openalex.org/W3021477639","https://openalex.org/W60938034","https://openalex.org/W2790733222","https://openalex.org/W1498867194","https://openalex.org/W4253430307","https://openalex.org/W1555618383"],"abstract_inverted_index":{"This":[0],"work":[1],"aims":[2],"to":[3,144,160,172],"address":[4],"the":[5,126,146],"well-known":[6],"and":[7,41,60,77,108,118,132,151,159],"acute":[8],"challenge":[9],"of":[10,45,96,148],"functional":[11],"validation":[12],"for":[13,25,92,105,139,155],"complex,":[14],"contemporary":[15],"microarchitectural":[16,157],"circuit":[17,140],"designs.":[18],"We":[19,87,116,142],"provide":[20],"a":[21,33,78,103,123,128,136],"new":[22],"formal":[23,80,166],"framework":[24,91,154],"algorithm":[26,158],"level":[27],"modelling":[28,31,127],"-":[29],"design":[30,114,137],"at":[32],"high":[34,173],"abstraction":[35],"level,":[36],"focused":[37],"exclusively":[38],"on":[39,50,84],"function":[40],"algorithms.":[42],"The":[43],"semantics":[44],"our":[46,120,149],"models":[47,64,97],"is":[48],"based":[49,82],"abstract":[51],"state":[52],"machines":[53],"with":[54,73],"synchronous":[55],"parallel":[56],"execution,":[57,59],"sequential":[58],"nondeterminism.":[61],"To":[62],"express":[63],"we":[65],"propose":[66],"an":[67,89],"executable,":[68],"object-oriented":[69],"architecture":[70],"specification":[71],"language":[72,150],"rich":[74],"data":[75],"types":[76],"well-defined":[79],"semantics,":[81],"initially":[83],"Microsoft's":[85],"AsmL.":[86],"describe":[88],"experimental":[90],"direct":[93],"symbolic":[94,152],"execution":[95,153],"in":[98],"this":[99],"language,":[100],"intended":[101],"as":[102,111,113],"basis":[104],"both":[106],"property":[107],"refinement":[109,134],"verification,":[110],"well":[112],"exploration.":[115],"explain":[117],"illustrate":[119],"approach":[121],"through":[122],"case":[124],"study,":[125],"simple":[129],"muop":[130],"scheduler":[131],"its":[133],"towards":[135],"model":[138],"implementation.":[141],"aim":[143],"show":[145],"utility":[147],"exploring":[156],"validate":[161],"designs":[162],"using":[163],"dynamic":[164],"or":[165],"techniques,":[167],"yielding":[168],"more":[169],"productive":[170],"convergence":[171],"quality":[174],"implementations.":[175]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}