{"id":"https://openalex.org/W3034123776","doi":"https://doi.org/10.1007/s11334-020-00363-6","title":"LTL Model Checking for Communicating Concurrent Programs","display_name":"LTL Model Checking for Communicating Concurrent Programs","publication_year":2018,"publication_date":"2018-09-26","ids":{"openalex":"https://openalex.org/W3034123776","doi":"https://doi.org/10.1007/s11334-020-00363-6","mag":"3034123776"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-03902460v1","doi":"https://doi.org/10.1007/s11334-020-00363-6","is_oa":true,"landing_page_url":"https://hal.science/hal-03902460","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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":"12th International Conference on Verification and Evaluation of Computer and Communication Systems (VECoS 2018), Sep 2018, Grenoble, France. ⟨10.1007/s11334-020-00363-6⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03902460","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pommelet, Adrien","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210138808","display_name":"\u00c9cole Pour l'Informatique et les Techniques Avanc\u00e9es","ror":"https://ror.org/04r5ddq29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210138808"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pommelet, Adrien","raw_affiliation_strings":["LRDE, EPITA, Le Kremlin-Bic\u00eatre, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRDE, EPITA, Le Kremlin-Bic\u00eatre, France","institution_ids":["https://openalex.org/I4210138808"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044579457","display_name":"Tayssir Touili","orcid":"https://orcid.org/0000-0002-1134-2220","observed_orcids":["https://orcid.org/0000-0002-1134-2220"]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Touili, Tayssir","raw_affiliation_strings":["LIPN, CNRS, and Universit\u00e9 Paris 13, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIPN, CNRS, and Universit\u00e9 Paris 13, Villetaneuse, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210138808"],"apc_list":null,"apc_paid":null,"fwci":0.2299,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.33230558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"16","issue":"2","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.9643999934196472,"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.9643999934196472,"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.0215000007301569,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.011300000362098217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/concurrent-programs","display_name":"concurrent programs","score":0.8119999766349792},{"id":"https://openalex.org/keywords/static-analysis","display_name":"static analysis","score":0.6520000100135803},{"id":"https://openalex.org/keywords/context-free-languages","display_name":"context-free languages","score":0.574999988079071},{"id":"https://openalex.org/keywords/over-approximation","display_name":"over-approximation","score":0.9290000200271606},{"id":"https://openalex.org/keywords/reachability","display_name":"reachability","score":0.5249999761581421},{"id":"https://openalex.org/keywords/multithreaded-applications","display_name":"multithreaded programs","score":0.8069999814033508}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7827750444412231},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7648149728775024},{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.7513328790664673},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.709524929523468},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6858764886856079},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.6812167167663574},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6575304269790649},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5419219136238098},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5372403264045715},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5274857878684998},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5090872645378113},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4956303834915161},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48533573746681213},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.46916088461875916},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4468124508857727},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.4275318682193756},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4261137843132019},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4141741693019867},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3826727867126465},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.20972785353660583},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.20902404189109802},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.11585861444473267},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.07961294054985046},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07777750492095947},{"id":"https://openalex.org/C29829512","wikidata":"https://www.wikidata.org/wiki/Q40218","display_name":"Spacecraft","level":2,"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/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:HAL:hal-03902460v1","doi":"https://doi.org/10.1007/s11334-020-00363-6","is_oa":true,"landing_page_url":"https://hal.science/hal-03902460","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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":"12th International Conference on Verification and Evaluation of Computer and Communication Systems (VECoS 2018), Sep 2018, Grenoble, France. ⟨10.1007/s11334-020-00363-6⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03902460v1","doi":"https://doi.org/10.1007/s11334-020-00363-6","is_oa":true,"landing_page_url":"https://hal.science/hal-03902460","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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":"12th International Conference on Verification and Evaluation of Computer and Communication Systems (VECoS 2018), Sep 2018, Grenoble, France. ⟨10.1007/s11334-020-00363-6⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323399","display_name":"Universit\u00e9 Paris Diderot","ror":"https://ror.org/02n7qrg46"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1491036809","https://openalex.org/W1493367105","https://openalex.org/W1550653935","https://openalex.org/W1589224558","https://openalex.org/W1602995535","https://openalex.org/W2020438328","https://openalex.org/W2023808162","https://openalex.org/W2041743477","https://openalex.org/W2048853598","https://openalex.org/W2060345611","https://openalex.org/W2092618327","https://openalex.org/W2107398710","https://openalex.org/W2117842469","https://openalex.org/W2128453996","https://openalex.org/W2132295002","https://openalex.org/W2147536493","https://openalex.org/W2160520283","https://openalex.org/W2551431684","https://openalex.org/W2770341857","https://openalex.org/W2889294907","https://openalex.org/W2902604500"],"related_works":["https://openalex.org/W4213400730","https://openalex.org/W2098410450","https://openalex.org/W7097766541","https://openalex.org/W2770341857","https://openalex.org/W7098042158","https://openalex.org/W177526596","https://openalex.org/W1539829525","https://openalex.org/W2147536493","https://openalex.org/W7099773140","https://openalex.org/W7097939131"],"abstract_inverted_index":{"We":[0,123],"present":[1,125],"in":[2,101],"this":[3,18,47,74,91,95,147],"paper":[4],"a":[5,130,144],"new":[6],"approach":[7,100],"to":[8,79,103,107,138],"the":[9,65,108,113,150],"static":[10],"analysis":[11],"of":[12,50,64,112,143],"concurrent":[13],"programs":[14,23],"with":[15,35,97],"procedures.":[16],"To":[17,73],"end,":[19,75],"we":[20,93],"model":[21,109],"multi-threaded":[22],"featuring":[24],"recursive":[25],"procedure":[26,151],"calls":[27],"and":[28],"synchronisation":[29],"by":[30,86],"rendezvous":[31],"between":[32],"parallel":[33],"threads":[34],"communicating":[36],"pushdown":[37],"systems":[38],"(from":[39,117],"now":[40,118],"on":[41,119,121],"CPDSs).":[42],"The":[43],"reachability":[44],"problem":[45,111],"for":[46],"particular":[48],"class":[49],"automata":[51],"is":[52],"unfortunately":[53],"undecidable.":[54],"However,":[55],"it":[56],"has":[57,83],"been":[58,84],"shown":[59],"that":[60,140],"an":[61,76,98,105,126],"efficient":[62],"abstraction":[63],"execution":[66],"traces":[67],"language":[68],"can":[69],"nonetheless":[70],"be":[71],"computed.":[72],"algebraic":[77],"framework":[78,96],"over-approximate":[80],"context-free":[81],"languages":[82],"introduced":[85],"Bouajjani":[87],"et":[88],"al.":[89],"In":[90],"paper,":[92],"combine":[94],"automata-theoretic":[99],"order":[102],"approximate":[104],"answer":[106],"checking":[110],"lineartime":[114],"temporal":[115],"logic":[116],"LTL)":[120],"CPDSs.":[122],"then":[124],"algorithm":[127],"that,":[128],"given":[129],"single-indexed":[131],"or":[132],"stutter-invariant":[133],"LTL":[134],"formula,":[135],"allows":[136],"us":[137],"prove":[139],"no":[141],"run":[142],"CPDS":[145],"verifies":[146],"formula":[148],"if":[149],"ends.":[152]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2020-06-12T00:00:00"}