{"id":"https://openalex.org/W2493800215","doi":"https://doi.org/10.1109/iccomm.2016.7528292","title":"Generation of the path to counter-examples by backward state space traversal in symbolic model checking based on term rewriting","display_name":"Generation of the path to counter-examples by backward state space traversal in symbolic model checking based on term rewriting","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2493800215","doi":"https://doi.org/10.1109/iccomm.2016.7528292","mag":"2493800215"},"language":"en","primary_location":{"id":"doi:10.1109/iccomm.2016.7528292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccomm.2016.7528292","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Communications (COMM)","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/A5051098262","display_name":"Mihai Lica Pura","orcid":null},"institutions":[{"id":"https://openalex.org/I2802885015","display_name":"Military Technical Academy","ror":"https://ror.org/01tqmsq19","country_code":"RO","type":"education","lineage":["https://openalex.org/I2802885015"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Mihai Lica Pura","raw_affiliation_strings":["Department of Computer Science and Mathematics, Military Technical Academy, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Military Technical Academy, Bucharest, Romania","institution_ids":["https://openalex.org/I2802885015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078861537","display_name":"Luciana Morogan","orcid":"https://orcid.org/0000-0002-3119-152X"},"institutions":[{"id":"https://openalex.org/I2802885015","display_name":"Military Technical Academy","ror":"https://ror.org/01tqmsq19","country_code":"RO","type":"education","lineage":["https://openalex.org/I2802885015"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Luciana Morogan","raw_affiliation_strings":["Department of Computer Science and Mathematics, Military Technical Academy, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Military Technical Academy, Bucharest, Romania","institution_ids":["https://openalex.org/I2802885015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013795728","display_name":"Didier Buchs","orcid":null},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Didier Buchs","raw_affiliation_strings":["University of Geneva, Centre Universitaire d'Informatique, Carouge, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Geneva, Centre Universitaire d'Informatique, Carouge, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051098262"],"corresponding_institution_ids":["https://openalex.org/I2802885015"],"apc_list":null,"apc_paid":null,"fwci":0.3485,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66683092,"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":"85","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11424","display_name":"Security and Verification in Computing","score":0.9991000294685364,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9922000169754028,"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/model-checking","display_name":"Model checking","score":0.8195585012435913},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8158786296844482},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.7898877859115601},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7127770185470581},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.6985543966293335},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6889086365699768},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.6314478516578674},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6200574040412903},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.6164082884788513},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5644949674606323},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.5641863942146301},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4240683913230896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2987040877342224},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2617296874523163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20162314176559448},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10050022602081299}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8195585012435913},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8158786296844482},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.7898877859115601},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7127770185470581},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.6985543966293335},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6889086365699768},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.6314478516578674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6200574040412903},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.6164082884788513},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5644949674606323},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.5641863942146301},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4240683913230896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2987040877342224},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2617296874523163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20162314176559448},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10050022602081299},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccomm.2016.7528292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccomm.2016.7528292","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Communications (COMM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W54061235","https://openalex.org/W560778078","https://openalex.org/W562949087","https://openalex.org/W869084503","https://openalex.org/W1517948404","https://openalex.org/W1522846680","https://openalex.org/W1570992302","https://openalex.org/W1588089883","https://openalex.org/W1833403382","https://openalex.org/W1981663184","https://openalex.org/W2126018011","https://openalex.org/W2340735175","https://openalex.org/W2407280631","https://openalex.org/W4285719527","https://openalex.org/W6615530878","https://openalex.org/W6623834664","https://openalex.org/W6631006789","https://openalex.org/W6634262026","https://openalex.org/W6684644128","https://openalex.org/W6727660065","https://openalex.org/W7071626199"],"related_works":["https://openalex.org/W1983158716","https://openalex.org/W2122050999","https://openalex.org/W2143015677","https://openalex.org/W2172190585","https://openalex.org/W3141316173","https://openalex.org/W2104182224","https://openalex.org/W4312733571","https://openalex.org/W2149716943","https://openalex.org/W63955974","https://openalex.org/W127421840"],"abstract_inverted_index":{"Model":[0],"checking":[1,44],"has":[2,45,74],"proved":[3],"to":[4,24,54,67,89,109,113,136],"be":[5],"a":[6,126],"very":[7],"useful":[8],"formal":[9],"verification":[10],"technique":[11],"in":[12],"the":[13,26,30,41,51,59,81,85,92,95,99,105,111,114,119,123,130,139,150,155,160,167],"design":[14],"of":[15,32,34,50,79,84,94,107,125,129,149],"communication":[16],"and":[17,37,64,121,142,152,176],"security":[18,38],"protocols.":[19],"Researches":[20],"have":[21],"used":[22],"it":[23],"validate":[25],"communications":[27],"protocols":[28],"from":[29,47,138],"point":[31],"view":[33],"their":[35],"functional":[36],"specifications.":[39],"Over":[40],"years,":[42],"model":[43],"evolved":[46],"explicit":[48],"encoding":[49,83],"state":[52,60,71,86,131,141,162],"space":[53,61,87],"symbolic":[55,82],"encoding,":[56],"thus":[57,165],"overcoming":[58],"explosion":[62],"problem":[63,106],"being":[65],"able":[66],"handle":[68],"almost":[69],"infinite":[70],"spaces.":[72],"Research":[73],"indicated":[75],"that":[76],"another":[77],"means":[78],"improving":[80],"is":[88,135,163],"encode":[90],"only":[91],"states":[93],"system,":[96],"but":[97],"not":[98],"transition":[100],"relations.":[101],"But":[102],"this":[103],"raises":[104],"how":[108],"compute":[110,143],"path":[112],"counter-examples.":[115],"This":[116],"paper":[117],"address":[118],"issue":[120],"proposes":[122],"use":[124],"backward":[127],"traversal":[128],"space.":[132],"The":[133,170],"idea":[134],"start":[137],"counter-example":[140],"its":[144],"predecessor(s),":[145],"then":[146],"take":[147],"each":[148],"predecessors":[151],"apply":[153],"recursively":[154],"same":[156],"inversing":[157],"operation":[158],"until":[159],"initial":[161],"reached,":[164],"obtaining":[166],"sought":[168],"path.":[169],"new":[171],"approach":[172],"was":[173],"formally":[174],"defined":[175],"exemplified.":[177]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}