{"id":"https://openalex.org/W4210813503","doi":"https://doi.org/10.1109/ase51524.2021.9678584","title":"ASE: A Value Set Decision Procedure for Symbolic Execution","display_name":"ASE: A Value Set Decision Procedure for Symbolic Execution","publication_year":2021,"publication_date":"2021-11-01","ids":{"openalex":"https://openalex.org/W4210813503","doi":"https://doi.org/10.1109/ase51524.2021.9678584"},"language":"en","primary_location":{"id":"doi:10.1109/ase51524.2021.9678584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ase51524.2021.9678584","pdf_url":null,"source":{"id":"https://openalex.org/S4363608212","display_name":"2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)","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/A5028280383","display_name":"Alireza S. Abyaneh","orcid":null},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Alireza S. Abyaneh","raw_affiliation_strings":["Department of Computer Sciences, University of Salzburg, Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044364762","display_name":"Christoph M. Kirsch","orcid":"https://orcid.org/0000-0002-0961-0564"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]},{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["AT","CZ"],"is_corresponding":false,"raw_author_name":"Christoph M. Kirsch","raw_affiliation_strings":["Czech Technical University, Prague, Czech Republic","Department of Computer Sciences, University of Salzburg, Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Department of Computer Sciences, University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8096,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7152265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8923026323318481},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8532906770706177},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8126699328422546},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.7748590111732483},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6444119811058044},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5446429252624512},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5365597605705261},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5134361982345581},{"id":"https://openalex.org/keywords/predicate-abstraction","display_name":"Predicate abstraction","score":0.5075896978378296},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4830251634120941},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47448089718818665},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.45465776324272156},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.44199568033218384},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.4353763163089752},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.3452591896057129},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3441820740699768},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.11273160576820374},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.10911256074905396}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8923026323318481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8532906770706177},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8126699328422546},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.7748590111732483},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6444119811058044},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5446429252624512},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5365597605705261},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5134361982345581},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.5075896978378296},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4830251634120941},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47448089718818665},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.45465776324272156},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.44199568033218384},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.4353763163089752},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3452591896057129},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3441820740699768},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.11273160576820374},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.10911256074905396},{"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":1,"locations":[{"id":"doi:10.1109/ase51524.2021.9678584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ase51524.2021.9678584","pdf_url":null,"source":{"id":"https://openalex.org/S4363608212","display_name":"2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.8100000023841858}],"awards":[],"funders":[{"id":"https://openalex.org/F4320311649","display_name":"Ministry of Education","ror":"https://ror.org/036nq5137"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1505872263","https://openalex.org/W1548138666","https://openalex.org/W1549880792","https://openalex.org/W1710734607","https://openalex.org/W1777881387","https://openalex.org/W1853199847","https://openalex.org/W1996543446","https://openalex.org/W2030906223","https://openalex.org/W2060573639","https://openalex.org/W2101512909","https://openalex.org/W2106315863","https://openalex.org/W2138721431","https://openalex.org/W2140687990","https://openalex.org/W2141097255","https://openalex.org/W2149647957","https://openalex.org/W2278821771","https://openalex.org/W2295903414","https://openalex.org/W2514974017","https://openalex.org/W2613170812","https://openalex.org/W2762126174","https://openalex.org/W2798817047","https://openalex.org/W2883591435","https://openalex.org/W2888546876","https://openalex.org/W2948273719","https://openalex.org/W2952369269","https://openalex.org/W2963723316","https://openalex.org/W2966228400","https://openalex.org/W4246691913","https://openalex.org/W6632841748","https://openalex.org/W6637688222","https://openalex.org/W6737788765","https://openalex.org/W6767097574"],"related_works":["https://openalex.org/W1938597047","https://openalex.org/W1815155750","https://openalex.org/W2951913576","https://openalex.org/W4298483060","https://openalex.org/W2184716478","https://openalex.org/W2287565210","https://openalex.org/W4210813503","https://openalex.org/W2048447692","https://openalex.org/W200284069","https://openalex.org/W2782813868"],"abstract_inverted_index":{"A":[0],"symbolic":[1,28,38,160],"execution":[2,39,161],"engine":[3,41,94,119,144],"regularly":[4],"queries":[5,170],"a":[6,70,140,146],"Satisfiability":[7],"Modulo":[8],"Theory":[9],"(SMT)":[10],"solver":[11,22,48],"to":[12,53,99,128],"determine":[13],"reachability":[14,55],"of":[15,27,111,142,148,168],"code":[16],"during":[17],"execution.":[18,29],"Unfortunately,":[19],"the":[20,25,46,100,109,123,133,166,173,178],"SMT":[21,47,115,169],"is":[23],"often":[24,50,158],"bottleneck":[26],"Inspired":[30],"by":[31,51,163],"abstract":[32,37],"interpretation,":[33],"we":[34,65],"propose":[35],"an":[36,58],"(ASE)":[40],"which":[42],"aims":[43],"at":[44],"querying":[45],"less":[49],"trying":[52,181],"compute":[54],"faster":[56],"through":[57],"increasingly":[59],"weaker":[60],"abstraction.":[61],"For":[62],"this":[63],"purpose,":[64],"have":[66,136],"designed":[67,137],"and":[68,103,131,138],"implemented":[69,113,139],"value":[71,78,88],"set":[72],"decision":[73],"procedure":[74],"based":[75],"on":[76,130],"strided":[77],"interval":[79],"(SVI)":[80],"sets":[81,89],"for":[82,90,145,180],"efficiently":[83,120],"determining":[84],"precise,":[85],"or":[86],"under-approximating":[87],"variables.":[91],"Our":[92,117,151],"ASE":[93,118],"begins":[95],"reasoning":[96],"with":[97],"respect":[98],"SVI":[101],"abstraction,":[102],"then":[104],"only":[105],"if":[106],"needed":[107],"uses":[108],"theory":[110],"bit-vectors":[112],"in":[114],"solvers.":[116],"detects":[121],"when":[122],"former":[124],"abstraction":[125,174],"becomes":[126],"incomplete":[127],"move":[129],"try":[132],"next":[134],"abstraction.We":[135],"prototype":[141,157],"our":[143,156],"subset":[147],"64-bit":[149],"RISC-V.":[150],"experimental":[152],"evaluation":[153],"shows":[154],"that":[155],"improves":[159],"time":[162],"significantly":[164],"reducing":[165],"number":[167],"while,":[171],"whenever":[172],"does":[175],"not":[176],"work,":[177],"overhead":[179],"still":[182],"remains":[183],"low.":[184]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}