{"id":"https://openalex.org/W7170177069","doi":"https://doi.org/10.1007/978-3-032-32519-8_2","title":"On the\u00a0Complexity of\u00a0Checking Soundness of\u00a0Natural Reductions","display_name":"On the\u00a0Complexity of\u00a0Checking Soundness of\u00a0Natural Reductions","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170177069","doi":"https://doi.org/10.1007/978-3-032-32519-8_2"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-32519-8_2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-32519-8_2","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_2.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040528930","display_name":"Constantin Enea","orcid":"https://orcid.org/0000-0003-2727-8865"},"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/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Constantin Enea","raw_affiliation_strings":["LIX \u2013 CNRS \u2013 \u00c9cole Polytechnique, Palaiseau, France"],"raw_orcid":"https://orcid.org/0000-0003-2727-8865","affiliations":[{"raw_affiliation_string":"LIX \u2013 CNRS \u2013 \u00c9cole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210139461"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016276143","display_name":"Azadeh Farzan","orcid":"https://orcid.org/0000-0001-9005-2653"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Azadeh Farzan","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"raw_orcid":"https://orcid.org/0000-0001-9005-2653","affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089682457","display_name":"Dominik Klumpp","orcid":"https://orcid.org/0000-0003-4885-0728"},"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/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dominik Klumpp","raw_affiliation_strings":["LIX \u2013 CNRS \u2013 \u00c9cole Polytechnique, Palaiseau, France"],"raw_orcid":"https://orcid.org/0000-0003-4885-0728","affiliations":[{"raw_affiliation_string":"LIX \u2013 CNRS \u2013 \u00c9cole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210139461"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089682457"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210139461"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8842999935150146},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.8752999901771545},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7250999808311462},{"id":"https://openalex.org/keywords/rendezvous","display_name":"Rendezvous","score":0.6557999849319458},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6025999784469604},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5357000231742859},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.5228999853134155},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5097000002861023},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4975999891757965}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8842999935150146},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.8752999901771545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8202999830245972},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7250999808311462},{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.6557999849319458},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6025999784469604},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5357000231742859},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.5228999853134155},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5097000002861023},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4975999891757965},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.48570001125335693},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.46160000562667847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4569999873638153},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4424000084400177},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40139999985694885},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.2854999899864197},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-32519-8_2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-32519-8_2","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_2.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-032-32519-8_2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-32519-8_2","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_2.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7170177069.pdf","grobid_xml":"https://content.openalex.org/works/W7170177069.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W971186954","https://openalex.org/W1522958625","https://openalex.org/W2042981544","https://openalex.org/W2058696974","https://openalex.org/W2072062729","https://openalex.org/W2091776255","https://openalex.org/W2093709900","https://openalex.org/W2145919405","https://openalex.org/W2155487709","https://openalex.org/W2277581924","https://openalex.org/W2900035213","https://openalex.org/W2913498875","https://openalex.org/W2995623611","https://openalex.org/W3033402562","https://openalex.org/W3034158217","https://openalex.org/W3110271915","https://openalex.org/W4232306982","https://openalex.org/W4237376234","https://openalex.org/W4242282547","https://openalex.org/W4281968516","https://openalex.org/W4390604697","https://openalex.org/W7152468459","https://openalex.org/W7161113079"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1],"verification":[2],"of":[3,8,13,22,53],"reductions":[4,29,32],",":[5],"representative":[6],"subsets":[7],"interleavings,":[9],"simplifies":[10],"correctness":[11],"proofs":[12],"parameterized":[14,45],"concurrent":[15],"programs.":[16],"We":[17,49],"introduce":[18],"an":[19],"expressive":[20],"class":[21],"syntactic":[23],"reductions,":[24],"which":[25],"we":[26,77,92],"call":[27],"natural":[28,58],".":[30],"Natural":[31],"are":[33],"specified":[34],"by":[35],"introducing":[36],"atomic":[37],"blocks":[38],"and":[39,81,106],"global":[40],"rendezvous":[41],"points":[42],"in":[43,102],"the":[44,51,68,86,99,103,109],"program\u2019s":[46],"thread":[47],"template.":[48],"study":[50],"problem":[52,100,110],"deciding":[54],"whether":[55],"a":[56,63,79,94,116],"given":[57,64],"reduction":[59],"is":[60,72,90,111],"sound":[61,80],"wrt.":[62],"(semi-)commutativity":[65],"relation.":[66],"In":[67,85],"case":[69,87],"that":[70,108],"there":[71],"no":[73],"synchronization":[74,89,104],"between":[75],"threads,":[76],"present":[78],"complete":[82],"polynomial-time":[83],"algorithm.":[84],"where":[88],"considered,":[91],"provide":[93],"general":[95],"lower":[96],"bound":[97],"for":[98,115],"(parametric":[101],"mechanism),":[105],"show":[107],"coNP":[112],"-hard":[113],"already":[114],"simple":[117],"mechanism":[118],"like":[119],"locking.":[120]},"counts_by_year":[],"updated_date":"2026-07-25T05:54:39.514286","created_date":"2026-07-24T00:00:00"}