{"id":"https://openalex.org/W2045163506","doi":"https://doi.org/10.1145/1101908.1101915","title":"Efficient temporal-logic query checking for presburger systems","display_name":"Efficient temporal-logic query checking for presburger systems","publication_year":2005,"publication_date":"2005-11-07","ids":{"openalex":"https://openalex.org/W2045163506","doi":"https://doi.org/10.1145/1101908.1101915","mag":"2045163506"},"language":"en","primary_location":{"id":"doi:10.1145/1101908.1101915","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1101908.1101915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering","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/A5055058352","display_name":"Dezhuang Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]},{"id":"https://openalex.org/I1327163397","display_name":"State University of New York","ror":"https://ror.org/01q1z8k08","country_code":"US","type":"education","lineage":["https://openalex.org/I1327163397"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dezhuang Zhang","raw_affiliation_strings":["State University of New York at Stony Brook, Stony Brook, NY","State University of New York at Stony Brook, Stony Brook, NY#TAB#"],"affiliations":[{"raw_affiliation_string":"State University of New York at Stony Brook, Stony Brook, NY","institution_ids":["https://openalex.org/I59553526","https://openalex.org/I1327163397"]},{"raw_affiliation_string":"State University of New York at Stony Brook, Stony Brook, NY#TAB#","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016408902","display_name":"Rance Cleaveland","orcid":"https://orcid.org/0000-0002-4952-5380"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rance Cleaveland","raw_affiliation_strings":["University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055058352"],"corresponding_institution_ids":["https://openalex.org/I1327163397","https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":0.3514,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60467684,"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":"24","last_page":"33"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.785868227481842},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6929882168769836},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6883708238601685},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6522493958473206},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.6305232048034668},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.595323920249939},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.5678923726081848},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.4699820578098297},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4536066949367523},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43374136090278625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3267863094806671},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2906413674354553},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.2156643271446228}],"concepts":[{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.785868227481842},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6929882168769836},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6883708238601685},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6522493958473206},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.6305232048034668},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.595323920249939},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.5678923726081848},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.4699820578098297},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4536066949367523},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43374136090278625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3267863094806671},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2906413674354553},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.2156643271446228}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1101908.1101915","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1101908.1101915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.8462","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.8462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~rance/publications/papers/ase05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W22697707","https://openalex.org/W166818797","https://openalex.org/W1526440063","https://openalex.org/W1532358383","https://openalex.org/W1565930383","https://openalex.org/W1578141429","https://openalex.org/W1589887037","https://openalex.org/W1590315663","https://openalex.org/W1777025722","https://openalex.org/W1933906947","https://openalex.org/W2015640848","https://openalex.org/W2046213250","https://openalex.org/W2057260173","https://openalex.org/W2096161423","https://openalex.org/W2097026217","https://openalex.org/W2097699872","https://openalex.org/W2102548669","https://openalex.org/W2118774213","https://openalex.org/W2125708466","https://openalex.org/W2126188125","https://openalex.org/W2132331020","https://openalex.org/W2203616022","https://openalex.org/W2561675875","https://openalex.org/W2756011084","https://openalex.org/W4205241946","https://openalex.org/W4239521259","https://openalex.org/W6631744874","https://openalex.org/W6678543191"],"related_works":["https://openalex.org/W1532447905","https://openalex.org/W858755136","https://openalex.org/W31328628","https://openalex.org/W1981889059","https://openalex.org/W2352091395","https://openalex.org/W3005864166","https://openalex.org/W946220898","https://openalex.org/W2996932295","https://openalex.org/W2759584604","https://openalex.org/W1526924704"],"abstract_inverted_index":{"This":[0],"paper":[1,117],"develops":[2],"a":[3,11,46,49,56,83,107],"framework":[4],"for":[5,10,85],"solving":[6,132],"temporal-logic":[7,36],"query-checking":[8],"problems":[9],"class":[12],"of":[13,58,60,152],"infinite-state":[14],"system":[15,33],"models":[16],"that":[17,65,111],"compute":[18,55],"with":[19,53],"integer-valued":[20],"variables":[21],"(so-called":[22],"Presburger":[23,27],"systems,":[24],"in":[25,136],"which":[26,137],"formulas":[28,61,138],"are":[29],"used":[30],"to":[31,62,131],"define":[32],"behavior).":[34],"The":[35,116],"query":[37,77],"checking":[38,78],"problem":[39],"may":[40,139],"be":[41,129],"formulated":[42],"as":[43,82],"follows:":[44],"given":[45,74],"model":[47],"and":[48,87,100,123],"temporal":[50,68,98,134],"logic":[51,99],"formula":[52,69],"placeholders,":[54],"set":[57],"assignments":[59],"placeholders":[63],"such":[64],"the":[66,73,133,149],"resulting":[67],"is":[70,104],"satisfied":[71],"by":[72],"model.":[75],"Temporal-logic":[76],"has":[79,93],"proved":[80],"useful":[81],"means":[84],"requirements":[86],"design":[88],"understanding;":[89],"existing":[90],"work,":[91],"however,":[92],"focused":[94],"only":[95],"on":[96,106,113],"propositional":[97],"finite-state":[101],"systems.Our":[102],"method":[103],"based":[105],"symbolic":[108],"model-checking":[109,121],"technique":[110],"relies":[112],"proof":[114],"search.":[115],"first":[118],"introduces":[119],"this":[120],"approach":[122],"then":[124],"shows":[125],"how":[126],"it":[127],"can":[128],"adapted":[130],"queries":[135],"contain":[140],"integer":[141],"variables.":[142],"We":[143],"also":[144],"present":[145],"experimental":[146],"results":[147],"showing":[148],"computational":[150],"efficacy":[151],"our":[153],"approach.":[154]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}