{"id":"https://openalex.org/W4255898078","doi":"https://doi.org/10.1109/memcod.2003.1210110","title":"A verification methodology for infinite-state message passing systems","display_name":"A verification methodology for infinite-state message passing systems","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W4255898078","doi":"https://doi.org/10.1109/memcod.2003.1210110"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2003.1210110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","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/A5037740498","display_name":"Christoph Sprenger","orcid":"https://orcid.org/0000-0003-2941-5165"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210150884","display_name":"Fondation Sophia Antipolis","ror":"https://ror.org/05nkcfv27","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210150884"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH","FR"],"is_corresponding":true,"raw_author_name":"C. Sprenger","raw_affiliation_strings":["Computer Networking Laboratory, Swiss Federal Institute of Technology, Lausanne, Switzerland","Projet Lemme, I.N.R.I.A. Sophia Antipolis, Sophia-Antipolis, France"],"affiliations":[{"raw_affiliation_string":"Computer Networking Laboratory, Swiss Federal Institute of Technology, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"Projet Lemme, I.N.R.I.A. Sophia Antipolis, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I4210150884","https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081264001","display_name":"K. Worytkiewicz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. Worytkiewicz","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037740498"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210150884","https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.45223158,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1102","issue":null,"first_page":"255","last_page":"264"},"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.9983000159263611,"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.996999979019165,"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/computer-science","display_name":"Computer science","score":0.7731997966766357},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.721451997756958},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6801359057426453},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6260448694229126},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5604826807975769},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5267930626869202},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5155661106109619},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.5101020932197571},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5015909671783447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44782981276512146}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7731997966766357},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.721451997756958},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6801359057426453},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6260448694229126},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5604826807975769},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5267930626869202},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5155661106109619},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.5101020932197571},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5015909671783447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44782981276512146}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2003.1210110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W156248253","https://openalex.org/W1506815291","https://openalex.org/W1559397325","https://openalex.org/W1560050980","https://openalex.org/W1582665553","https://openalex.org/W1659048632","https://openalex.org/W1695437353","https://openalex.org/W2034768505","https://openalex.org/W2036455933","https://openalex.org/W2045112813","https://openalex.org/W2061786858","https://openalex.org/W2073580455","https://openalex.org/W2102548669","https://openalex.org/W2113486906","https://openalex.org/W2120713972","https://openalex.org/W6608832571","https://openalex.org/W6684644128"],"related_works":["https://openalex.org/W2462966030","https://openalex.org/W1604894272","https://openalex.org/W1568108328","https://openalex.org/W2129909535","https://openalex.org/W2398171686","https://openalex.org/W155581612","https://openalex.org/W2155852086","https://openalex.org/W22293391","https://openalex.org/W2019316858","https://openalex.org/W2037121848"],"abstract_inverted_index":{"The":[0],"verification":[1,74],"methodology":[2,64],"studied":[3],"in":[4,69,77],"this":[5],"paper":[6],"stems":[7],"from":[8,36],"investigations":[9],"on":[10],"respectively":[11],"deduction-based":[12,55],"model":[13,56],"checking":[14],"and":[15,27,79],"semantics":[16,31],"of":[17,58,71],"concurrency.":[18],"Specifically,":[19],"we":[20],"consider":[21],"imperative":[22],"programs":[23],"with":[24,65],"CSP-like":[25],"communication":[26],"use":[28],"a":[29,37,39,54,66],"categorical":[30],"as":[32,50,85],"foundation":[33],"to":[34],"extract":[35],"program":[38],"control":[40],"graph":[41],"labeled":[42],"by":[43],"transition":[44],"predicates.":[45],"This":[46],"logical":[47],"content":[48],"acts":[49],"system":[51],"description":[52],"for":[53],"checker":[57],"LTL":[59],"properties.":[60],"We":[61],"illustrate":[62],"the":[63,72,81],"concrete":[67],"realization":[68],"form":[70],"Mc5":[73],"tool":[75],"written":[76],"Ocaml":[78],"using":[80],"theorem":[82],"prover":[83],"PVS":[84],"back-end.":[86]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}