{"id":"https://openalex.org/W2607993147","doi":"https://doi.org/10.23638/lmcs-13(2:8)2017","title":"A Reduced Semantics for Deciding Trace Equivalence","display_name":"A Reduced Semantics for Deciding Trace Equivalence","publication_year":2017,"publication_date":"2017-06-08","ids":{"openalex":"https://openalex.org/W2607993147","doi":"https://doi.org/10.23638/lmcs-13(2:8)2017","mag":"2607993147"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(2:8)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(2:8)2017","pdf_url":"https://lmcs.episciences.org/3703/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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3703/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111431300","display_name":"David Baelde","orcid":null},"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/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN","FR"],"is_corresponding":true,"raw_author_name":"David Baelde","raw_affiliation_strings":["EMbedded SEcurity and Cryptography","SYST\u00c8MES LARGE \u00c9CHELLE","Centre National de la Recherche Scientifique"],"affiliations":[{"raw_affiliation_string":"EMbedded SEcurity and Cryptography","institution_ids":["https://openalex.org/I4210132990"]},{"raw_affiliation_string":"SYST\u00c8MES LARGE \u00c9CHELLE","institution_ids":[]},{"raw_affiliation_string":"Centre National de la Recherche Scientifique","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112272628","display_name":"St\u00e9phanie Delaune","orcid":null},"institutions":[{"id":"https://openalex.org/I4210104198","display_name":"Laboratoire Sp\u00e9cification et V\u00e9rification","ror":"https://ror.org/01kz1bj67","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210104198","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN","FR"],"is_corresponding":false,"raw_author_name":"St\u00e9phanie Delaune","raw_affiliation_strings":["Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan]","Programming securely with cryptography"],"affiliations":[{"raw_affiliation_string":"Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan]","institution_ids":["https://openalex.org/I4210104198"]},{"raw_affiliation_string":"Programming securely with cryptography","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052556643","display_name":"Lucca Hirschi","orcid":"https://orcid.org/0000-0003-4572-0581"},"institutions":[{"id":"https://openalex.org/I4210104198","display_name":"Laboratoire Sp\u00e9cification et V\u00e9rification","ror":"https://ror.org/01kz1bj67","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210104198","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lucca Hirschi","raw_affiliation_strings":["Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan]"],"affiliations":[{"raw_affiliation_string":"Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan]","institution_ids":["https://openalex.org/I4210104198"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111431300"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210132990"],"apc_list":null,"apc_paid":null,"fwci":0.2193,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56045783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 13, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10927","display_name":"Access Control and Trust","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9812999963760376,"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/partial-order-reduction","display_name":"Partial order reduction","score":0.9128267765045166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7545967102050781},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6712285280227661},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.6469914317131042},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6448980569839478},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6380271315574646},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5756756067276001},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5510632395744324},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5114237666130066},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.46585044264793396},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.45463886857032776},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.4476722776889801},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4235439598560333},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.397341787815094},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3335244357585907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19614022970199585},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.18536770343780518},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06956139206886292}],"concepts":[{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.9128267765045166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7545967102050781},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6712285280227661},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.6469914317131042},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6448980569839478},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6380271315574646},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5756756067276001},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5510632395744324},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5114237666130066},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.46585044264793396},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.45463886857032776},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.4476722776889801},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4235439598560333},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.397341787815094},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3335244357585907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19614022970199585},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.18536770343780518},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06956139206886292},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(2:8)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(2:8)2017","pdf_url":"https://lmcs.episciences.org/3703/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:1704.08540","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.08540","pdf_url":"https://arxiv.org/pdf/1704.08540","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":"doi:10.48550/arxiv.1704.08540","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1704.08540","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(2:8)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(2:8)2017","pdf_url":"https://lmcs.episciences.org/3703/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":[{"id":"https://metadata.un.org/sdg/16","score":0.699999988079071,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G5721853554","display_name":null,"funder_award_id":"714955","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6625498459","display_name":null,"funder_award_id":"ANR-11-JS02-006","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6860377923","display_name":null,"funder_award_id":"ANR-14-CE28-0030","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","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/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2607993147.pdf","grobid_xml":"https://content.openalex.org/works/W2607993147.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W35034951","https://openalex.org/W125598877","https://openalex.org/W146244851","https://openalex.org/W147489498","https://openalex.org/W598363404","https://openalex.org/W646737329","https://openalex.org/W1540501475","https://openalex.org/W1566086941","https://openalex.org/W1569472116","https://openalex.org/W1588028307","https://openalex.org/W1603878273","https://openalex.org/W1607289982","https://openalex.org/W1873081628","https://openalex.org/W1973054120","https://openalex.org/W1996497395","https://openalex.org/W2005880313","https://openalex.org/W2008078972","https://openalex.org/W2042609207","https://openalex.org/W2055259417","https://openalex.org/W2059140315","https://openalex.org/W2066904164","https://openalex.org/W2070324762","https://openalex.org/W2112189440","https://openalex.org/W2114189125","https://openalex.org/W2117064875","https://openalex.org/W2120992963","https://openalex.org/W2121845793","https://openalex.org/W2126338744","https://openalex.org/W2150187928","https://openalex.org/W2153921791","https://openalex.org/W2167816957","https://openalex.org/W2169870841","https://openalex.org/W2172018206","https://openalex.org/W2527288790","https://openalex.org/W2609153124","https://openalex.org/W2914971001","https://openalex.org/W2951996797","https://openalex.org/W2963407533"],"related_works":["https://openalex.org/W3098882403","https://openalex.org/W2534962781","https://openalex.org/W2165379892","https://openalex.org/W2068223072","https://openalex.org/W2349662779","https://openalex.org/W2030972894","https://openalex.org/W2607993147","https://openalex.org/W3098557859","https://openalex.org/W3096875860","https://openalex.org/W1490475243"],"abstract_inverted_index":{"Many":[0],"privacy-type":[1],"properties":[2,12,23,83],"of":[3,30,38,66,72,108],"security":[4],"protocols":[5],"can":[6,24],"be":[7,25],"modelled":[8],"using":[9,84],"trace":[10],"equivalence":[11,99],"in":[13,69,105,129,145],"suitable":[14],"process":[15],"algebras.":[16],"It":[17],"has":[18,126],"been":[19,127],"shown":[20],"that":[21,113],"such":[22],"decided":[26],"for":[27,81,98,143],"interesting":[28],"classes":[29],"finite":[31],"processes":[32],"(i.e.,":[33],"without":[34],"replication)":[35],"by":[36,63],"means":[37],"symbolic":[39,111],"execution":[40],"and":[41,95],"constraint":[42],"solving.":[43],"However,":[44],"this":[45,79],"does":[46],"not":[47],"suffice":[48],"to":[49],"obtain":[50,102],"practical":[51],"tools.":[52],"Current":[53],"prototypes":[54],"suffer":[55],"from":[56],"a":[57,109,130],"classical":[58],"combinatorial":[59],"explosion":[60],"problem":[61,80],"caused":[62],"the":[64,70,106,118],"exploration":[65],"many":[67],"interleavings":[68,116],"behaviour":[71],"processes.":[73],"M\\"odersheim":[74],"et":[75],"al.":[76],"have":[77],"tackled":[78],"reachability":[82],"partial":[85,122],"order":[86,123],"reduction":[87,124],"techniques.":[88],"We":[89,101,134],"revisit":[90],"their":[91],"work,":[92],"generalize":[93],"it":[94,97],"adapt":[96],"checking.":[100],"an":[103],"optimisation":[104],"form":[107],"reduced":[110],"semantics":[112],"eliminates":[114],"redundant":[115],"on":[117],"fly.":[119],"The":[120],"obtained":[121],"technique":[125],"integrated":[128],"tool":[131],"called":[132],"APTE.":[133],"conducted":[135],"complete":[136],"benchmarks":[137],"showing":[138],"dramatic":[139],"improvements.":[140],"Comment:":[141],"Accepted":[142],"publication":[144],"LMCS":[146]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2017-05-05T00:00:00"}