{"id":"https://openalex.org/W2141509697","doi":"https://doi.org/10.1017/s1471068404002054","title":"On model checking data-independent systems with arrays without reset","display_name":"On model checking data-independent systems with arrays without reset","publication_year":2004,"publication_date":"2004-08-12","ids":{"openalex":"https://openalex.org/W2141509697","doi":"https://doi.org/10.1017/s1471068404002054","mag":"2141509697"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068404002054","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068404002054","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-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/A5016064325","display_name":"Ranko Lazi\u0107","orcid":"https://orcid.org/0000-0003-3663-5182"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"R. S. LAZI\u0106","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK (e-mail:","Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK (e-mail: ranko.lazic@dcs.warwick.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK (e-mail:","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK (e-mail: ranko.lazic@dcs.warwick.ac.uk)#TAB#","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041585440","display_name":"Tom Newcomb","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"T. C. NEWCOMB","raw_affiliation_strings":["Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail:","Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail: tom.newcomb@comlab.ox.ac.uk, bill.roscoe@comlab.ox.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail:","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail: tom.newcomb@comlab.ox.ac.uk, bill.roscoe@comlab.ox.ac.uk)#TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045639409","display_name":"A. W. Roscoe","orcid":"https://orcid.org/0000-0001-7557-3901"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. W. ROSCOE","raw_affiliation_strings":["Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail:","Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail: tom.newcomb@comlab.ox.ac.uk, bill.roscoe@comlab.ox.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail:","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Buildings, Parks Road, Oxford OX1 3QD, UK (e-mail: tom.newcomb@comlab.ox.ac.uk, bill.roscoe@comlab.ox.ac.uk)#TAB#","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016064325"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":2.0725,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87239429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"4","issue":"5-6","first_page":"659","last_page":"693"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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.9976999759674072,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9976999759674072,"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/decidability","display_name":"Decidability","score":0.8850292563438416},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.8119549751281738},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.7447842955589294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7274062633514404},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.65390944480896},{"id":"https://openalex.org/keywords/data-type","display_name":"Data type","score":0.49563729763031006},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4601375162601471},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4571729302406311},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.4564622938632965},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.455971360206604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4532415270805359},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.4110279977321625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4075638949871063},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30562078952789307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22018063068389893}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8850292563438416},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8119549751281738},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.7447842955589294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7274062633514404},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.65390944480896},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.49563729763031006},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4601375162601471},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4571729302406311},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.4564622938632965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.455971360206604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4532415270805359},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.4110279977321625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4075638949871063},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30562078952789307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22018063068389893},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1017/s1471068404002054","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068404002054","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.1523","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.comlab.ox.ac.uk/pub/Documents/techreports/RR-02-02.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.3979","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ecs.soton.ac.uk/~mal/vcl2001/ranko.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.2046","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.2046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.comlab.ox.ac.uk/oucl/research/areas/concurrency/publications/papers/tplp.ps.gz","raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:982ce37a-073e-407f-bebc-04a27059de7b","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:982ce37a-073e-407f-bebc-04a27059de7b","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:fdb54075-20fc-4386-95a6-44548e0e5ffb","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:fdb54075-20fc-4386-95a6-44548e0e5ffb","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W121208955","https://openalex.org/W1527008463","https://openalex.org/W1547100201","https://openalex.org/W1595452620","https://openalex.org/W1857327297","https://openalex.org/W1883667652","https://openalex.org/W1967174286","https://openalex.org/W1972065960","https://openalex.org/W1977116278","https://openalex.org/W1990183105","https://openalex.org/W2009965218","https://openalex.org/W2012001501","https://openalex.org/W2029601347","https://openalex.org/W2061438988","https://openalex.org/W2113566309","https://openalex.org/W2116989825","https://openalex.org/W2155058593","https://openalex.org/W2176705267","https://openalex.org/W2519134721","https://openalex.org/W2949601309","https://openalex.org/W2987907651","https://openalex.org/W3146075203","https://openalex.org/W3147784910","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1551070491","https://openalex.org/W2103740034","https://openalex.org/W2095002986","https://openalex.org/W2753745283","https://openalex.org/W14017695","https://openalex.org/W2234073770","https://openalex.org/W2063465696","https://openalex.org/W2203774400","https://openalex.org/W2471765219","https://openalex.org/W2350953867"],"abstract_inverted_index":{"A":[0],"system":[1,29],"is":[2,79,144,171,215,235],"data-independent":[3,49,132,222],"with":[4,50,67,120,159,224],"respect":[5,51],"to":[6,24,52,125,131],"a":[7,86,90,129,172,253,258],"data":[8],"type":[9,20,38,55,237,244],"$X$":[10,21,39,57,70,100,111,163,234],"iff":[11],"the":[12,80,108,139,175,181,185,202,207,212,236,243],"operations":[13],"it":[14,190],"can":[15,153],"perform":[16],"on":[17],"values":[18,36,72],"of":[19,37,45,99,156,162,180,184,206,211,228,238,245,260],"are":[22,48,114,123],"restricted":[23],"just":[25],"equality":[26],"testing.":[27],"The":[28],"may":[30,62,194],"also":[31,199],"store,":[32],"input":[33],"and":[34,58,61,71,101,112,116,164,230,241],"output":[35],".":[40,75,103,166],"We":[41,167,198],"study":[42],"model":[43,126,220],"checking":[44,221],"systems":[46,133,158,223],"which":[47],"two":[53],"distinct":[54],"variables":[56],"$Y$":[59,74,102,113,165,242],",":[60],"in":[63],"addition":[64],"use":[65],"arrays":[66,225],"indices":[68],"from":[69,73],"Our":[76],"main":[77],"interest":[78],"following":[81],"parameterised":[82,177,203],"model-checking":[83,142,178,204],"problem:":[84],"whether":[85],"given":[87,91],"program":[88],"satisfies":[89],"temporal-logic":[92],"formula":[93],"for":[94,146,174,219],"all":[95,157],"non-empty":[96],"finite":[97,121,160],"instances":[98,161],"Initially,":[104],"we":[105,136,152,251],"consider":[106],"instead":[107],"abstraction":[109],"where":[110,117,233],"infinite":[115],"partial":[118],"functions":[119],"domains":[122],"used":[124],"arrays.":[127],"Using":[128],"translation":[130],"without":[134],"arrays,":[135],"show":[137,168],"that":[138,169,189,201],"$\\mu$":[140,186,213],"-calculus":[141,214],"problem":[143,179,205],"decidable":[145],"these":[147],"systems.":[148],"From":[149],"this":[150],"result,":[151],"deduce":[154,200],"properties":[155],"there":[170],"procedure":[173],"above":[176],"universal":[182,208],"fragment":[183,210],"-calculus,":[187],"such":[188],"always":[191],"terminates":[192],"but":[193],"give":[195],"false":[196],"negatives.":[197],"disjunction-free":[209],"decidable.":[216],"Practical":[217],"motivations":[218],"include":[226],"verification":[227],"memory":[229,239,255],"cache":[231],"systems,":[232],"addresses,":[240],"storable":[246],"values.":[247],"As":[248],"an":[249],"example":[250],"verify":[252],"fault-tolerant":[254],"interface":[256],"over":[257],"set":[259],"unreliable":[261],"memories.":[262]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}