{"id":"https://openalex.org/W2057086403","doi":"https://doi.org/10.1109/rtas.2014.6926000","title":"Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets","display_name":"Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2057086403","doi":"https://doi.org/10.1109/rtas.2014.6926000","mag":"2057086403"},"language":"en","primary_location":{"id":"doi:10.1109/rtas.2014.6926000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2014.6926000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)","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/A5024356179","display_name":"Bernard Blackham","orcid":null},"institutions":[{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Bernard Blackham","raw_affiliation_strings":["NICTA and University of New South Wales, Sydney, Australia","NICTA & University of New South Wales, Sydney, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"NICTA and University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I31746571"]},{"raw_affiliation_string":"NICTA & University of New South Wales, Sydney, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009613676","display_name":"Mark H. Liffiton","orcid":null},"institutions":[{"id":"https://openalex.org/I184616310","display_name":"Illinois Wesleyan University","ror":"https://ror.org/021aqk126","country_code":"US","type":"education","lineage":["https://openalex.org/I184616310"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark Liffiton","raw_affiliation_strings":["Illinois Wesleyan University, Bloomington, IL, USA","Illinois Wesleyan University, Bloomington 61701, USA"],"affiliations":[{"raw_affiliation_string":"Illinois Wesleyan University, Bloomington, IL, USA","institution_ids":["https://openalex.org/I184616310"]},{"raw_affiliation_string":"Illinois Wesleyan University, Bloomington 61701, USA","institution_ids":["https://openalex.org/I184616310"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025750562","display_name":"Gernot Heiser","orcid":"https://orcid.org/0000-0002-7069-0831"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Gernot Heiser","raw_affiliation_strings":["NICTA and University of New South Wales, Sydney, Australia","NICTA & University of New South Wales, Sydney, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"NICTA and University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I31746571"]},{"raw_affiliation_string":"NICTA & University of New South Wales, Sydney, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024356179"],"corresponding_institution_ids":["https://openalex.org/I31746571","https://openalex.org/I42894916"],"apc_list":null,"apc_paid":null,"fwci":4.2907,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.94403051,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"3","issue":null,"first_page":"169","last_page":"178"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"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.8612782955169678},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6295713186264038},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5888332724571228},{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"Worst-case execution time","score":0.5820363759994507},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.46959033608436584},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.464816153049469},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46233412623405457},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.43688666820526123},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41705143451690674},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41478773951530457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38667070865631104},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34910377860069275},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3271535634994507},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11304187774658203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09910577535629272},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07963630557060242}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8612782955169678},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6295713186264038},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5888332724571228},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.5820363759994507},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.46959033608436584},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.464816153049469},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46233412623405457},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.43688666820526123},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41705143451690674},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41478773951530457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38667070865631104},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34910377860069275},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3271535634994507},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11304187774658203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09910577535629272},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07963630557060242},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rtas.2014.6926000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2014.6926000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320315885","display_name":"Australian Government","ror":"https://ror.org/0314h5y94"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W92576581","https://openalex.org/W1490174819","https://openalex.org/W1505051593","https://openalex.org/W1507495123","https://openalex.org/W1577404745","https://openalex.org/W1593319293","https://openalex.org/W1831545713","https://openalex.org/W1843794072","https://openalex.org/W1964807936","https://openalex.org/W1982205631","https://openalex.org/W1983711842","https://openalex.org/W1984842289","https://openalex.org/W2020169768","https://openalex.org/W2067836954","https://openalex.org/W2076285066","https://openalex.org/W2110908283","https://openalex.org/W2116888614","https://openalex.org/W2127574686","https://openalex.org/W2135527638","https://openalex.org/W2136310957","https://openalex.org/W2145105471","https://openalex.org/W2146441023","https://openalex.org/W2150310937","https://openalex.org/W2154158220","https://openalex.org/W2155146646","https://openalex.org/W2158131309","https://openalex.org/W2162969303","https://openalex.org/W2163529295","https://openalex.org/W4230473054","https://openalex.org/W6603841182","https://openalex.org/W6630477613","https://openalex.org/W6635586397","https://openalex.org/W6682619116","https://openalex.org/W6683985949"],"related_works":["https://openalex.org/W1515433387","https://openalex.org/W1484796814","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2507397068","https://openalex.org/W1663166257","https://openalex.org/W4298153058","https://openalex.org/W2390473631","https://openalex.org/W2169086742","https://openalex.org/W2172093208"],"abstract_inverted_index":{"Static":[0],"analysis":[1,165],"techniques":[2],"can":[3,42,55,122],"be":[4,43,56],"used":[5],"to":[6,25,49,84,95,112,145,162],"compute":[7,138],"safe":[8],"bounds":[9],"on":[10,89,175],"the":[11,50,102,137,147,155,167,176],"worst-case":[12],"execution":[13],"time":[14],"(WCET)":[15],"of":[16,67,115,131,149,157,166],"programs.":[17],"For":[18],"large":[19],"programs,":[20,92],"abstractions":[21,30],"are":[22,72],"often":[23],"required":[24],"curb":[26],"computational":[27],"complexity.":[28],"These":[29,40],"may":[31],"introduce":[32],"infeasible":[33,69,87,116,124],"paths":[34,41,88,125],"which":[35,126],"result":[36],"in":[37,93],"significant":[38],"overestimation.":[39],"eliminated":[44],"by":[45,159],"adding":[46],"additional":[47],"constraints":[48,54,71],"static":[51],"analysis.":[52],"Such":[53],"found":[57],"manually":[58],"but":[59],"this":[60,77],"is":[61],"labour-intensive":[62],"and":[63,105],"error-prone.":[64],"Automated":[65],"methods":[66],"finding":[68],"path":[70],"thus":[73],"highly":[74],"desirable.":[75],"In":[76],"paper":[78],"we":[79],"present":[80],"Trickle:":[81],"a":[82,163],"method":[83],"automatically":[85],"detect":[86],"compiled":[90],"binary":[91],"order":[94],"refine":[96],"WCET":[97,164,178],"estimates.":[98],"We":[99,134,153,170],"build":[100],"upon":[101],"Sequoll":[103],"framework":[104],"apply":[106],"satisfiability":[107],"modulo":[108],"theory":[109],"(SMT)":[110],"solvers":[111],"find":[113,123],"classes":[114],"paths.":[117],"Unlike":[118],"other":[119],"techniques,":[120],"Trickle":[121,158],"contain":[127],"an":[128],"arbitrary":[129],"number":[130,148],"conflicting":[132],"conditions.":[133],"also":[135,171],"integrate":[136],"all":[139],"minimal":[140],"unsatisfiable":[141],"subsets":[142],"(CAMUS)":[143],"algorithm":[144],"reduce":[146],"refinement":[150],"iterations":[151],"required.":[152],"show":[154],"practicality":[156],"applying":[160],"it":[161],"seL4":[168],"microkernel.":[169],"evaluate":[172],"its":[173],"effectiveness":[174],"M\u00e4lardalen":[177],"benchmarks.":[179]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}