{"id":"https://openalex.org/W2003334372","doi":"https://doi.org/10.2168/lmcs-6(4:10)2010","title":"Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis","display_name":"Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis","publication_year":2010,"publication_date":"2010-12-21","ids":{"openalex":"https://openalex.org/W2003334372","doi":"https://doi.org/10.2168/lmcs-6(4:10)2010","mag":"2003334372"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-6(4:10)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:10)2010","pdf_url":"https://lmcs.episciences.org/966/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/966/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Silvio Ghilardi","orcid":null},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Silvio Ghilardi","raw_affiliation_strings":["Dipartimento di Scienze dell'Informazione, Universit degli Studi di Milano (Italy)"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione, Universit degli Studi di Milano (Italy)","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"last","author":{"id":null,"display_name":"Silvio Ranise","orcid":"https://orcid.org/0000-0001-7269-9285"},"institutions":[{"id":"https://openalex.org/I4210090861","display_name":"Ferioli & Gianotti (Italy)","ror":"https://ror.org/009v14c36","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210090861"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Silvio Ranise","raw_affiliation_strings":["FBK-Irst, Trento (Italy"],"affiliations":[{"raw_affiliation_string":"FBK-Irst, Trento (Italy","institution_ids":["https://openalex.org/I4210090861"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189158943"],"apc_list":null,"apc_paid":null,"fwci":5.1269,"has_fulltext":true,"cited_by_count":69,"citation_normalized_percentile":{"value":0.9545774,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"Volume 6, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9914000034332275,"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.9914000034332275,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.0017000000225380063,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.0007999999797903001,"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/reachability","display_name":"Reachability","score":0.9516000151634216},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6984999775886536},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5584999918937683},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.5547999739646912},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5338000059127808},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5321999788284302},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5127000212669373},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.49570000171661377},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.47440001368522644}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9516000151634216},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6984999775886536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5853999853134155},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5584999918937683},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.5547999739646912},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5338000059127808},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5321999788284302},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5127000212669373},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.49570000171661377},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.47440001368522644},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4659000039100647},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4456000030040741},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3887999951839447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38029998540878296},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.36719998717308044},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.36239999532699585},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.35679998993873596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35350000858306885},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3400999903678894},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-6(4:10)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:10)2010","pdf_url":"https://lmcs.episciences.org/966/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1010.1872","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1010.1872","pdf_url":"https://arxiv.org/pdf/1010.1872","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:a0abccf4ce4f4c148bcda71fde520f01","is_oa":true,"landing_page_url":"https://doaj.org/article/a0abccf4ce4f4c148bcda71fde520f01","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 6, Issue 4 (2010)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-6(4:10)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:10)2010","pdf_url":"https://lmcs.episciences.org/966/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2733290379","display_name":null,"funder_award_id":"216471","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5483342299","display_name":null,"funder_award_id":"FP7-ICT","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7850098718","display_name":null,"funder_award_id":"COFUND","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320326086","display_name":"Provincia Autonoma di Trento","ror":"https://ror.org/017e99q89"},{"id":"https://openalex.org/F4320338370","display_name":"FP7 Information and Communication Technologies","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2003334372.pdf","grobid_xml":"https://content.openalex.org/works/W2003334372.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W93625746","https://openalex.org/W1496749443","https://openalex.org/W1497571013","https://openalex.org/W1511737804","https://openalex.org/W1511903507","https://openalex.org/W1516900991","https://openalex.org/W1518757970","https://openalex.org/W1538434844","https://openalex.org/W1541228707","https://openalex.org/W1552077729","https://openalex.org/W1560527899","https://openalex.org/W1561112849","https://openalex.org/W1569747018","https://openalex.org/W1570418357","https://openalex.org/W1591445921","https://openalex.org/W1605302571","https://openalex.org/W1711276981","https://openalex.org/W1834186039","https://openalex.org/W1837934228","https://openalex.org/W1855789069","https://openalex.org/W1875437173","https://openalex.org/W1905380539","https://openalex.org/W1972085995","https://openalex.org/W1973291036","https://openalex.org/W1987814265","https://openalex.org/W1989689843","https://openalex.org/W1995151557","https://openalex.org/W2021255060","https://openalex.org/W2054424606","https://openalex.org/W2056646797","https://openalex.org/W2066210260","https://openalex.org/W2076972393","https://openalex.org/W2093356672","https://openalex.org/W2123160677","https://openalex.org/W2123910665","https://openalex.org/W2129073086","https://openalex.org/W2141509697","https://openalex.org/W2151643528","https://openalex.org/W2163482209","https://openalex.org/W3003421191","https://openalex.org/W4230919050","https://openalex.org/W4232096339","https://openalex.org/W4388311772","https://openalex.org/W6636096118","https://openalex.org/W6658752626","https://openalex.org/W6712512182","https://openalex.org/W7002165583"],"related_works":[],"abstract_inverted_index":{"The":[0],"safety":[1,36,63,225],"of":[2,17,26,34,49,53,103,106,142,150,160,190,209,224,231],"infinite":[3,107],"state":[4,51,108],"systems":[5,109],"can":[6,44,71],"be":[7,72],"checked":[8],"by":[9,112,128],"a":[10,54,94,151,173,185,221,229],"backward":[11,39,104,143,161,181,191],"reachability":[12,40,105,144,182],"procedure.":[13],"For":[14],"certain":[15],"classes":[16],"systems,":[18],"it":[19,43],"is":[20,41,83,194],"possible":[21],"to":[22,60,74,84,100,120,138,176,205],"prove":[23],"the":[24,27,32,35,50,62,77,81,101,122,125,129,136,140,148,158,168,188,210,213],"termination":[25,141],"procedure":[28],"and":[29,97,124,145,180],"hence":[30],"conclude":[31],"decidability":[33],"problem.":[37],"Although":[38],"property-directed,":[42],"unnecessarily":[45],"explore":[46],"(large)":[47],"portions":[48],"space":[52],"system":[55],"which":[56],"are":[57,118],"not":[58],"required":[59],"verify":[61],"property":[64],"under":[65,164],"consideration.":[66],"To":[67],"avoid":[68],"this,":[69],"invariants":[70],"used":[73,119],"dramatically":[75],"prune":[76],"search":[78],"space.":[79],"Indeed,":[80],"problem":[82],"guess":[85],"such":[86],"appropriate":[87],"invariants.":[88],"In":[89],"this":[90],"paper,":[91],"we":[92,146,199],"present":[93,172],"fully":[95],"declarative":[96],"symbolic":[98],"approach":[99,175],"mechanization":[102],"manipulating":[110],"arrays":[111],"Satisfiability":[113],"Modulo":[114],"Theories":[115,117],"solving.":[116],"specify":[121],"topology":[123],"data":[126],"manipulated":[127],"system.":[130],"We":[131,170],"identify":[132],"sufficient":[133],"conditions":[134],"on":[135,167,220],"theories":[137],"ensure":[139],"show":[147],"completeness":[149],"method":[152],"for":[153,187],"invariant":[154,178],"synthesis":[155,179],"(obtained":[156],"as":[157],"dual":[159],"reachability),":[162],"again,":[163],"suitable":[165],"hypotheses":[166],"theories.":[169],"also":[171],"pragmatic":[174],"interleave":[177],"so":[183],"that":[184,202],"fix-point":[186],"set":[189,223],"reachable":[192],"states":[193],"more":[195],"easily":[196],"obtained.":[197],"Finally,":[198],"discuss":[200],"heuristics":[201],"allow":[203],"us":[204],"derive":[206],"an":[207],"implementation":[208],"techniques":[211],"in":[212],"model":[214],"checker":[215],"MCMT,":[216],"showing":[217],"remarkable":[218],"speed-ups":[219],"significant":[222],"problems":[226],"extracted":[227],"from":[228],"variety":[230],"sources.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-20T07:46:08.049788","created_date":"2016-06-24T00:00:00"}