{"id":"https://openalex.org/W2610066027","doi":"https://doi.org/10.1145/3060257","title":"Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems","display_name":"Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems","publication_year":2017,"publication_date":"2017-04-30","ids":{"openalex":"https://openalex.org/W2610066027","doi":"https://doi.org/10.1145/3060257","mag":"2610066027"},"language":"en","primary_location":{"id":"doi:10.1145/3060257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3060257","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/Verifying_Increasingly_Expressive_Temporal_Logics_for_Infinite-State_Systems/10199066","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112528389","display_name":"Byron Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Byron Cook","raw_affiliation_strings":["University College London, UK"],"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057529586","display_name":"Heidy Khlaaf","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Heidy Khlaaf","raw_affiliation_strings":["University College London, UK"],"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045161607","display_name":"Nir Piterman","orcid":"https://orcid.org/0000-0002-8242-5357"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nir Piterman","raw_affiliation_strings":["University of Leicester, UK"],"affiliations":[{"raw_affiliation_string":"University of Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112528389"],"corresponding_institution_ids":["https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":1.4227,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83031533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"64","issue":"2","first_page":"1","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9994999766349792,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9980999827384949,"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/computation-tree-logic","display_name":"Computation tree logic","score":0.9165679812431335},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.8205258846282959},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.7163790464401245},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7076987028121948},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6998941898345947},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6155332326889038},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5989652276039124},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5364770293235779},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4883110523223877},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4855506122112274},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.46206697821617126},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43684208393096924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2569228410720825}],"concepts":[{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.9165679812431335},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.8205258846282959},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7163790464401245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7076987028121948},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6998941898345947},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6155332326889038},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5989652276039124},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5364770293235779},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4883110523223877},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4855506122112274},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.46206697821617126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43684208393096924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2569228410720825},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C202751555","wikidata":"https://www.wikidata.org/wiki/Q221681","display_name":"In vitro","level":2,"score":0.0},{"id":"https://openalex.org/C154317977","wikidata":"https://www.wikidata.org/wiki/Q376266","display_name":"Cytotoxic T cell","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3060257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3060257","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10075277","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10075277/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   Journal of the ACM , 64  (2)    , Article 15. (2017)      ","raw_type":"Article"},{"id":"pmh:oai:figshare.com:article/10199066","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Verifying_Increasingly_Expressive_Temporal_Logics_for_Infinite-State_Systems/10199066","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:lra.le.ac.uk:2381/39502","is_oa":true,"landing_page_url":"http://dl.acm.org/citation.cfm?id=3060257","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/10199066","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Verifying_Increasingly_Expressive_Temporal_Logics_for_Infinite-State_Systems/10199066","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W17381159","https://openalex.org/W42364276","https://openalex.org/W120333500","https://openalex.org/W1491593738","https://openalex.org/W1511600686","https://openalex.org/W1540180001","https://openalex.org/W1562463698","https://openalex.org/W1565898282","https://openalex.org/W1589106570","https://openalex.org/W1600824603","https://openalex.org/W1606950856","https://openalex.org/W1964528821","https://openalex.org/W1968932663","https://openalex.org/W1969820590","https://openalex.org/W1975657455","https://openalex.org/W1984478483","https://openalex.org/W1989813138","https://openalex.org/W1998387957","https://openalex.org/W2004306067","https://openalex.org/W2023808162","https://openalex.org/W2030926579","https://openalex.org/W2032684325","https://openalex.org/W2041403185","https://openalex.org/W2053262709","https://openalex.org/W2078078820","https://openalex.org/W2098171268","https://openalex.org/W2099687675","https://openalex.org/W2112476716","https://openalex.org/W2132107743","https://openalex.org/W2140673956","https://openalex.org/W2153144732","https://openalex.org/W2153737593","https://openalex.org/W2157319504","https://openalex.org/W2165306422","https://openalex.org/W2226594342","https://openalex.org/W2277924821","https://openalex.org/W2293708017","https://openalex.org/W2319388297","https://openalex.org/W2752885492","https://openalex.org/W2913459036","https://openalex.org/W3032958005","https://openalex.org/W3160870209","https://openalex.org/W4211153347","https://openalex.org/W4236847445","https://openalex.org/W4240621788","https://openalex.org/W4248689402","https://openalex.org/W4254770492"],"related_works":["https://openalex.org/W146107827","https://openalex.org/W2381825341","https://openalex.org/W1551070491","https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W2143025323","https://openalex.org/W2350953867","https://openalex.org/W1592102986","https://openalex.org/W2062273688"],"abstract_inverted_index":{"Temporal":[0,67],"logic":[1],"is":[2,228,314,335],"a":[3,19,36,41,49,114,172,177,264,281,322],"formal":[4],"system":[5,42,142],"for":[6,39,100,135,157,187,238,307],"specifying":[7],"and":[8,31,34,89,119,127,144,216,251,316,332,349,378],"reasoning":[9,205],"about":[10,60,206],"propositions":[11],"qualified":[12],"in":[13,70,234,241,276,310,319],"terms":[14],"of":[15,46,51,96,116,138,160,175,193,213,273,284,288,329,341,366],"time.":[16],"It":[17],"offers":[18],"unified":[20],"approach":[21,275,348],"to":[22,28,57,280,304,362,370],"program":[23,226,257,260],"verification":[24,159],"as":[25,81],"it":[26,334],"applies":[27],"both":[29,117],"sequential":[30],"parallel":[32],"programs":[33,361],"provides":[35],"uniform":[37],"framework":[38],"describing":[40],"at":[43],"any":[44],"level":[45],"abstraction.":[47],"Thus,":[48],"number":[50],"automated":[52,153,185],"systems":[53,154,309],"have":[54,77,150,345],"been":[55],"proposed":[56],"exclusively":[58,133],"reason":[59],"either":[61],"Computation-Tree":[62],"Logic":[63,68],"(CTL)":[64],"or":[65],"Linear":[66],"(LTL)":[69],"the":[71,84,94,123,136,158,181,207,211,235,255,271,301,312,327,339,364],"infinite-state":[72,167,308],"setting.":[73],"Unfortunately,":[74],"these":[75],"logics":[76],"significantly":[78],"reduced":[79],"expressiveness":[80,137,365],"they":[82],"restrict":[83],"interplay":[85,124,209],"between":[86,125,210],"temporal":[87,214],"operators":[88,215],"path":[90,217],"quantifiers,":[91],"thus":[92,132,179,278],"disallowing":[93],"expression":[95],"many":[97],"practical":[98],"properties,":[99],"example,":[101],"\u201calong":[102],"some":[103],"future":[104,244],"an":[105,200],"event":[106],"occurs":[107,220],"infinitely":[108],"often.\u201d":[109],"Contrarily,":[110],"CTL":[111,118,130,163,190,222,265,305,367],"*":[112,131,164,191,223,266,306,368],",":[113],"superset":[115],"LTL,":[120],"can":[121],"facilitate":[122],"path-based":[126],"state-based":[128],"reasoning.":[129],"allows":[134],"properties":[139,165,192,291],"involving":[140],"existential":[141],"stabilization":[143],"\u201cpossibility\u201d":[145],"properties.":[146],"Until":[147],"now,":[148],"there":[149],"not":[151],"existed":[152],"that":[155,203,219,231,258,262,292],"allow":[156],"such":[161,176],"expressive":[162],"over":[166,254],"systems.":[168],"This":[169,268],"article":[170,269],"proposes":[171],"method":[173,198],"capable":[174,287],"task,":[178],"introducing":[180],"first":[182,229],"known":[183],"fully":[184],"tool":[186,294],"symbolically":[188],"proving":[189,289],"(infinite-state)":[194],"integer":[195],"programs.":[196],"The":[197],"uses":[199],"internal":[201],"encoding":[202],"admits":[204],"subtle":[208],"nesting":[212],"quantifiers":[218],"within":[221],"proofs.":[224],"A":[225],"transformation":[227],"employed":[230],"trades":[232],"nondeterminism":[233,239],"transition":[236],"relation":[237],"explicit":[240],"variables":[242],"predicting":[243],"outcomes":[245],"when":[246],"necessary.":[247],"We":[248,325,344],"then":[249],"synthesize":[250],"quantify":[252],"preconditions":[253],"transformed":[256],"represent":[259],"states":[261],"satisfy":[263],"formula.":[267],"demonstrates":[270],"viability":[272],"our":[274,347,351],"practice,":[277],"leading":[279],"new":[282],"class":[283],"fully-automated":[285],"tools":[286],"crucial":[290],"no":[293],"could":[295],"previously":[296],"prove.":[297],"Additionally,":[298],"we":[299],"consider":[300],"linear-past":[302],"extension":[303,331],"which":[311],"past":[313],"linear":[315],"each":[317],"moment":[318],"time":[320],"has":[321],"unique":[323],"past.":[324],"discuss":[326],"practice":[328],"this":[330],"how":[333],"further":[336],"supported":[337],"through":[338],"use":[340],"history":[342],"variables.":[343],"implemented":[346],"report":[350],"benchmarks":[352],"carried":[353],"out":[354],"on":[355],"case":[356],"studies":[357],"ranging":[358],"from":[359,375],"smaller":[360],"demonstrate":[363],"specifications,":[369],"larger":[371],"code":[372],"bases":[373],"drawn":[374],"device":[376],"drivers":[377],"various":[379],"industrial":[380],"examples.":[381]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}