{"id":"https://openalex.org/W1863102867","doi":"https://doi.org/10.1109/fmcad.2015.7542264","title":"Difference constraints: an adequate abstraction for complexity analysis of imperative programs","display_name":"Difference constraints: an adequate abstraction for complexity analysis of imperative programs","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W1863102867","doi":"https://doi.org/10.1109/fmcad.2015.7542264","mag":"1863102867"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2015.7542264","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2015.7542264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Formal Methods in Computer-Aided Design (FMCAD)","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/A5031521357","display_name":"Moritz Sinn","orcid":"https://orcid.org/0000-0002-8922-0936"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Moritz Sinn","raw_affiliation_strings":["TU Wien, Austria","TU Wien,  Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"TU Wien,  Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063337176","display_name":"Florian Zuleger","orcid":"https://orcid.org/0000-0003-1468-8398"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Florian Zuleger","raw_affiliation_strings":["TU Wien, Austria","TU Wien,  Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"TU Wien,  Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110701511","display_name":"Helmut Veith","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Helmut Veith","raw_affiliation_strings":["TU Wien, Austria","TU Wien,  Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"TU Wien,  Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031521357"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":3.4515,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.93224135,"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":"144","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5959098935127258},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5496389865875244},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.533483624458313},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5278734564781189},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.521870493888855},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5111740231513977},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.4961570203304291},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.46647223830223083},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41884270310401917},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4182450473308563},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"Analysis of algorithms","score":0.41011911630630493},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4005744159221649},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.36506181955337524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3509178161621094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3067886233329773}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5959098935127258},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5496389865875244},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.533483624458313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5278734564781189},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.521870493888855},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5111740231513977},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4961570203304291},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.46647223830223083},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41884270310401917},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4182450473308563},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.41011911630630493},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4005744159221649},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.36506181955337524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3509178161621094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3067886233329773},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"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/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/fmcad.2015.7542264","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2015.7542264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W66240089","https://openalex.org/W80442178","https://openalex.org/W110849379","https://openalex.org/W1515621470","https://openalex.org/W1523037784","https://openalex.org/W1595456961","https://openalex.org/W1636902686","https://openalex.org/W1863102867","https://openalex.org/W1950786671","https://openalex.org/W1987927249","https://openalex.org/W2029579251","https://openalex.org/W2058033966","https://openalex.org/W2073629816","https://openalex.org/W2094712524","https://openalex.org/W2122917953","https://openalex.org/W2149998063","https://openalex.org/W2153185479","https://openalex.org/W3014740296","https://openalex.org/W4246166885","https://openalex.org/W4299668927","https://openalex.org/W6602702177","https://openalex.org/W6636746886","https://openalex.org/W6641024502"],"related_works":["https://openalex.org/W2990853482","https://openalex.org/W2374430960","https://openalex.org/W2327776271","https://openalex.org/W2041069649","https://openalex.org/W2047754121","https://openalex.org/W2461808546","https://openalex.org/W2045590835","https://openalex.org/W2953001340","https://openalex.org/W1589381382","https://openalex.org/W342214647"],"abstract_inverted_index":{"Difference":[0],"constraints":[1],"have":[2],"been":[3],"used":[4],"for":[5,83,121,162],"termination":[6],"analysis":[7,85,114,120],"in":[8,31,42,166],"the":[9,17,27,32,38,43,58,79,84,106,141,160,173],"literature,":[10],"where":[11],"they":[12],"denote":[13],"relational":[14],"inequalities":[15],"of":[16,29,40,60,86,108,125,143],"form":[18],"x'":[19],"\u2264":[20],"y":[21,41],"+":[22],"c,":[23],"and":[24,68,90,111,127,137],"describe":[25,91],"that":[26,57,134],"value":[28,39],"x":[30],"current":[33],"state":[34,45],"is":[35],"at":[36],"most":[37],"previous":[44],"plus":[46],"some":[47],"constant":[48],"c":[49],"\u2208":[50],"\u2124.":[51],"In":[52],"this":[53],"paper,":[54],"we":[55],"argue":[56],"complexity":[59,110,119,161],"imperative":[61],"programs":[62,89,94,126],"typically":[63],"arises":[64],"from":[65,172],"counter":[66],"increments":[67],"resets,":[69],"which":[70],"can":[71,95],"be":[72,96],"modeled":[73],"naturally":[74],"by":[75,115],"difference":[76,87,99],"constraints.We":[77],"present":[78],"first":[80],"practical":[81],"algorithm":[82],"constraint":[88,100],"how":[92],"C":[93,154],"abstracted":[97],"to":[98,105],"programs.":[101],"Our":[102],"approach":[103,145],"contributes":[104],"field":[107],"automated":[109,117],"(resource)":[112],"bound":[113,138],"enabling":[116],"amortized":[118],"a":[122,129,147],"new":[123],"class":[124],"providing":[128],"conceptually":[130],"simple":[131],"program":[132],"model":[133],"relates":[135],"invariant-":[136],"analysis.We":[139],"demonstrate":[140],"effectiveness":[142],"our":[144,156],"through":[146],"thorough":[148],"experimental":[149],"comparison":[150],"on":[151],"real":[152],"world":[153],"code:":[155],"tool":[157],"Loopus":[158],"computes":[159],"considerably":[163],"more":[164],"functions":[165],"less":[167],"time":[168],"than":[169],"related":[170],"tools":[171],"literature.":[174]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}