{"id":"https://openalex.org/W2025113826","doi":"https://doi.org/10.1137/0210016","title":"The Total Correctness of Parallel Programs","display_name":"The Total Correctness of Parallel Programs","publication_year":1981,"publication_date":"1981-05-01","ids":{"openalex":"https://openalex.org/W2025113826","doi":"https://doi.org/10.1137/0210016","mag":"2025113826"},"language":"en","primary_location":{"id":"doi:10.1137/0210016","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210016","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5043108557","display_name":"Lawrence Flon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lawrence Flon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077995736","display_name":"Norihisa Suzuki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Norihisa Suzuki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.7457,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.97659446,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"10","issue":"2","first_page":"227","last_page":"246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8864789009094238},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8164070844650269},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7786205410957336},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5979194641113281},{"id":"https://openalex.org/keywords/complete-lattice","display_name":"Complete lattice","score":0.5879181623458862},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5488258004188538},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4964755177497864},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.47085967659950256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43175357580184937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37582236528396606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33982229232788086},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15617725253105164}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8864789009094238},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8164070844650269},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7786205410957336},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5979194641113281},{"id":"https://openalex.org/C201640847","wikidata":"https://www.wikidata.org/wiki/Q2362924","display_name":"Complete lattice","level":3,"score":0.5879181623458862},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5488258004188538},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4964755177497864},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.47085967659950256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43175357580184937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37582236528396606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33982229232788086},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15617725253105164},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0210016","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210016","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5899999737739563,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1557473230","https://openalex.org/W1965662337","https://openalex.org/W1994350081","https://openalex.org/W2065705928","https://openalex.org/W2075350371","https://openalex.org/W2094874241","https://openalex.org/W2100021838","https://openalex.org/W2103953153","https://openalex.org/W2131791649","https://openalex.org/W2132334337","https://openalex.org/W2134330476","https://openalex.org/W2168149256","https://openalex.org/W2340595401"],"related_works":["https://openalex.org/W13634261","https://openalex.org/W4250462479","https://openalex.org/W2804643406","https://openalex.org/W56937029","https://openalex.org/W3163509751","https://openalex.org/W958050847","https://openalex.org/W2396405675","https://openalex.org/W175051304","https://openalex.org/W1549730417","https://openalex.org/W1548499332"],"abstract_inverted_index":{"We":[0,26,83],"describe":[1],"a":[2,28,103,109],"formal":[3],"theory":[4],"of":[5,9,33,40,49,73,80,99,105],"the":[6,37,60,64,77],"total":[7,38,81],"correctness":[8,39,65],"parallel":[10,41],"programs,":[11],"including":[12],"such":[13],"heretofore":[14],"theoretically":[15],"incomplete":[16],"properties":[17],"as":[18],"safety":[19],"from":[20],"deadlock":[21],"and":[22,30,51,112,130],"starvation":[23],"under":[24],"fair-scheduling.":[25],"present":[27],"sound":[29,111],"complete":[31,78,113],"set":[32],"proof":[34,48,86,106],"rules":[35,107],"for":[36,63],"programs":[42],"expressed":[43],"in":[44,55],"nondeterministic":[45],"form.":[46],"The":[47,125],"soundness":[50],"completeness":[52],"is":[53,108,116,132],"novel":[54],"that":[56,59,118],"we":[57],"show":[58],"weakest":[61,120],"pre-conditions":[62,121],"criteria":[66],"are":[67,122],"actually":[68],"fixed-points":[69,98],"(least":[70],"or":[71,96],"greatest)":[72],"continuous":[74,100],"functions":[75],"over":[76],"lattice":[79],"predicates.":[82],"have":[84],"obtained":[85],"rule":[87],"schemata":[88],"which":[89],"can":[90],"universally":[91],"be":[92],"applied":[93],"to":[94],"least":[95],"greatest":[97],"functions.":[101],"Therefore,":[102],"system":[104],"priori":[110],"once":[114],"it":[115],"shown":[117],"certain":[119],"extremum":[123],"fixed-points.":[124],"relationship":[126],"between":[127],"true":[128],"parallelism":[129],"nondeterminism":[131],"also":[133],"discussed.":[134]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}