{
  "personId": "edsger-w-dijkstra",
  "uid": "SL-0171",
  "name": "艾兹赫尔·迪杰斯特拉",
  "version": "V2研究贡献账",
  "updatedAt": "2026-09-15",
  "formula": {
    "q": "Q = 10^(M/2) − 1",
    "light": "Lᵢ = aᵢ × Qᵢ",
    "total": "L = Σ Lᵢ",
    "score": "S = 2 × log₁₀(1 + L)"
  },
  "scopeNote": "本轮当前已列5项有限研究账；M与归功份额为可修订判断。未覆盖内容和未核清的负面作用不按零处理，具体缺口见逐项说明。",
  "exclusions": [
    {
      "id": "DIJKSTRA-SHORTEST-PATH-ORIGINAL-PUBLICATION-GAP",
      "title": "最短路径原始发表件的细节归因",
      "reason": "现有证据包的 UT 档案将迪杰斯特拉定位为算法设计奠基者，但本轮未取得最短路径原始发表件；因此不在此扩写具体实现、首次发表过程或未被档案直接支持的性能细节。",
      "sources": [
        {
          "label": "UT Austin：E. W. Dijkstra 档案",
          "url": "https://www.cs.utexas.edu/~EWD/"
        }
      ]
    },
    {
      "id": "DIJKSTRA-REMAINING-WORK",
      "title": "其他算法、编译器与教学服务",
      "reason": "THE有界实现已列；ALGOL编译器、其他算法和独立长期教学服务未逐项梳理，手稿数量不自动转成贡献。"
    }
  ],
  "items": [
    {
      "id": "OUT-SL0171-1960S-CONCURRENCY-PRIMITIVES-REASONING",
      "title": "并发互斥、信号量与死锁推理方法",
      "year": "1960",
      "summary": "发展信号量、互斥与死锁问题的形式化表达和推理工具。EWD 554 以 ghost variables、共享变量和临界区展示互斥证明，并比较 Dekker 方案；操作系统实现、并行形式方法与教学传播由其他团队和研究者共同推进。",
      "mReason": "并发控制是计算系统的基础协调问题；把互斥、信号量和死锁组织为可设计、可证明的通用原语与问题框架，具有系统级广泛复用性，取M6.2。",
      "aReason": "Dijkstra 0.45；Dekker及前史0.15；操作系统实现团队0.15；并行形式方法0.15；采用教育与未知各0.05。 原列并行与后继研究者的混合池暂不具名分配，保留未知输入。",
      "sources": [
        {
          "label": "UT Austin：E. W. Dijkstra 档案",
          "url": "https://www.cs.utexas.edu/~EWD/"
        },
        {
          "label": "EWD 554：互斥证明手稿",
          "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD05xx/EWD554.html"
        }
      ],
      "missing": "最初P/V定义、1965论文及首个运行系统实施仍需校准，影响a与范围置信度。",
      "status": "缺证暂估",
      "overlapNote": "1960年代信号量、互斥与死锁问题的程序原语和形式化推理方法。EWD554中的互斥证明属于同一并发方法家族；Dekker、Gries–Owicki、Hoare及后续分布式/自稳定理论保留。",
      "M": "6.2",
      "budget": [
        {
          "actor": "艾兹赫尔·迪杰斯特拉",
          "actorId": "SL-0171",
          "type": "PERSON",
          "share": "0.45"
        },
        {
          "actor": "Dekker 与早期并发研究前史",
          "actorId": "DIJKSTRA::DEKKER-AND-EARLY-CONCURRENCY-PREHISTORY",
          "type": "PREDECESSOR_POOL",
          "share": "0.15"
        },
        {
          "actor": "操作系统实现团队",
          "actorId": "DIJKSTRA::OPERATING-SYSTEM-IMPLEMENTATION-TEAMS",
          "type": "TEAM",
          "share": "0.15"
        },
        {
          "actor": "形式方法具体输入待核（未自动分给后继研究者）",
          "actorId": "DIJKSTRA::DIJKSTRA-CONCURRENCY-MUTUAL-EXCLUSION-SEMAPHORES-UNRESOLVED-METHOD-INPUT",
          "type": "UNALLOCATED",
          "share": "0.15"
        },
        {
          "actor": "早期采用者与教育者",
          "actorId": "DIJKSTRA::EARLY-ADOPTERS-AND-EDUCATORS",
          "type": "ADOPTER_POOL",
          "share": "0.05"
        },
        {
          "actor": "未分配的背景贡献",
          "actorId": "DIJKSTRA::UNKNOWN-CONTRIBUTORS",
          "type": "UNALLOCATED",
          "share": "0.05"
        }
      ],
      "share": "0.45",
      "exactLight": "566.0664353073752446907793478781102727421278342601189810985653587869914271021259108544729348241757765",
      "light": "566.066435",
      "standaloneScore": "5.51",
      "lightSharePercent": "35.0628"
    },
    {
      "id": "OUT-SL0171-1968-2002-STRUCTURED-PROGRAM-DESIGN-PROOF",
      "title": "结构化程序设计与正确性导向的形式推理",
      "year": "1968",
      "summary": "倡导以程序结构和可证明正确性处理复杂性。EWD 249 将程序理解与正确性证明视为核心问题，其他手稿讨论并行程序及合法证明的形式条件；Dahl、Hoare、Gries、Owicki 等人的工作属于并行或后续的方法发展。",
      "mReason": "该方法把可理解性与可证明正确性置于程序构造过程，形成跨语言和系统可迁移的设计纪律，取M6.0。M反映方法覆盖与奠基作用；未逐读所有原作只进入细项归属缺口。",
      "aReason": "Dijkstra 0.42；Dahl/Hoare 0.18；逻辑和语言前史0.15；Gries/Owicki等并行后继0.12；程序员、教育者与工具实现0.08；未知0.05。 原列并行与后继研究者的混合池暂不具名分配，保留未知输入。",
      "sources": [
        {
          "label": "EWD 249：结构化程序设计笔记",
          "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD02xx/EWD249/EWD249.html"
        },
        {
          "label": "EWD 123：并行程序与证明条件",
          "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123-2.html"
        },
        {
          "label": "UT Austin：E. W. Dijkstra 档案",
          "url": "https://www.cs.utexas.edu/~EWD/"
        }
      ],
      "missing": "guarded commands、weakest precondition等细项优先权及产业采用范围需校准。",
      "status": "缺证暂估",
      "overlapNote": "从EWD249结构化程序设计到以不变量、规格与证明组织程序设计的长期方法家族。结构化编程和程序正确性共享同一目标与工具链，合并估值；不按手稿数、goto文章、guarded commands或weakest precondition术语逐项累加，也不领取全部软件工程。",
      "M": "6.0",
      "budget": [
        {
          "actor": "艾兹赫尔·迪杰斯特拉",
          "actorId": "SL-0171",
          "type": "PERSON",
          "share": "0.42"
        },
        {
          "actor": "Ole-Johan Dahl 与 C. A. R. Hoare（并行方法研究者）",
          "actorId": "DIJKSTRA::OLE-JOHAN-DAHL-AND-C-A-R-HOARE",
          "type": "COLLABORATOR_AND_PARALLEL_POOL",
          "share": "0.18"
        },
        {
          "actor": "形式逻辑与编程语言前史",
          "actorId": "DIJKSTRA::FORMAL-LOGIC-AND-PROGRAMMING-LANGUAGE-PREHISTORY",
          "type": "PREDECESSOR_POOL",
          "share": "0.15"
        },
        {
          "actor": "形式方法具体输入待核（未自动分给后继研究者）",
          "actorId": "DIJKSTRA::DIJKSTRA-STRUCTURED-PROGRAMMING-AND-FORMAL-REASONING-UNRESOLVED-METHOD-INPUT",
          "type": "UNALLOCATED",
          "share": "0.12"
        },
        {
          "actor": "程序员、教育者与工具开发者",
          "actorId": "DIJKSTRA::PROGRAMMERS-EDUCATORS-AND-TOOL-BUILDERS",
          "type": "ADOPTER_POOL",
          "share": "0.08"
        },
        {
          "actor": "未分配的背景贡献",
          "actorId": "DIJKSTRA::UNKNOWN-CONTRIBUTORS",
          "type": "UNALLOCATED",
          "share": "0.05"
        }
      ],
      "share": "0.42",
      "exactLight": "419.58",
      "light": "419.580000",
      "standaloneScore": "5.25",
      "lightSharePercent": "25.9893"
    },
    {
      "id": "OUT-SL0171-1956-1959-NONNEGATIVE-SHORTEST-PATH",
      "title": "非负加权图的最短路径算法",
      "year": "1956",
      "summary": "提出通常称为 Dijkstra 最短路径算法的非负加权图算法。现有档案将其置于算法设计的奠基工作中；图论与优化前史、早期计算机实现和后续教材与系统采用分别构成不同贡献。",
      "mReason": "该算法把一类广泛网络优化问题化为清晰、可重复执行的通用步骤，跨领域复用，按一般基础算法方法取M5.5。当前原始发表件缺失只影响置信度和精确条件，不直接压低M。",
      "aReason": "Dijkstra 0.55；图论优化前史0.20；早期实现同事0.10；教材与系统采用0.10；未知0.05。",
      "sources": [
        {
          "label": "UT Austin：E. W. Dijkstra 档案",
          "url": "https://www.cs.utexas.edu/~EWD/"
        }
      ],
      "missing": "需补1959论文以确认条件、表达和早期实现分工；该缺口不作为M折扣。",
      "status": "缺证暂估",
      "overlapNote": "1956至1959年前后针对非负加权图的最短路径选择方法。只计抽象算法及其一般可复用性；后续优先队列实现、路由系统、地图服务和所有路径规划应用排除。",
      "M": "5.5",
      "budget": [
        {
          "actor": "艾兹赫尔·迪杰斯特拉",
          "actorId": "SL-0171",
          "type": "PERSON",
          "share": "0.55"
        },
        {
          "actor": "图论与优化前史",
          "actorId": "DIJKSTRA::GRAPH-THEORY-AND-OPTIMIZATION-PREHISTORY",
          "type": "PREDECESSOR_POOL",
          "share": "0.2"
        },
        {
          "actor": "早期计算机实现人员与同事",
          "actorId": "DIJKSTRA::EARLY-COMPUTER-IMPLEMENTATION-AND-COLLEAGUES",
          "type": "TEAM",
          "share": "0.1"
        },
        {
          "actor": "算法教材作者与系统采用者",
          "actorId": "DIJKSTRA::ALGORITHM-TEXTBOOK-AND-SYSTEM-ADOPTERS",
          "type": "ADOPTER_POOL",
          "share": "0.1"
        },
        {
          "actor": "未分配的背景贡献",
          "actorId": "DIJKSTRA::UNKNOWN-CONTRIBUTORS",
          "type": "UNALLOCATED",
          "share": "0.05"
        }
      ],
      "share": "0.55",
      "exactLight": "308.7377288546919942172230718770646773075380737042804152449291830547359627536845668982218914894211682",
      "light": "308.737729",
      "standaloneScore": "4.98",
      "lightSharePercent": "19.1236"
    },
    {
      "id": "OUT-SL0171-1973-SELF-STABILIZING-DISTRIBUTED-CONTROL",
      "title": "分布控制下的自稳定方法",
      "year": "1973",
      "summary": "在既定环形系统和调度条件下，局部决策可使系统从任意初态恢复并保持合法同步。",
      "mReason": "将任意初态恢复变成可构造和论证的分布式问题，采用M5.2。范围是新的条件性方法，实际工业部署另有主体。",
      "aReason": "个人及共同输入为可修订的研究预算，按原作署名、团队叙述及具体系统依赖分配；不从引用次数或后世市场规模倒推份额。",
      "sources": [
        {
          "label": "迪杰斯特拉原作：分布控制下的自稳定方法",
          "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD03xx/EWD391.html"
        }
      ],
      "missing": "原作条件与结论已核读，未用程序穷举复核全部证明。；原文未主张已交付工业容错服务。",
      "status": "缺证暂估",
      "overlapNote": "从任意初始状态收敛到合法同步状态的构造与论证；只计环形有限状态系统及所述公平调度等条件下的方法存在性。它新增故障后恢复问题，与维持初始合法状态的互斥原语区分；不领取后世全部容错系统。",
      "M": "5.2",
      "budget": [
        {
          "actor": "艾兹赫尔·迪杰斯特拉",
          "actorId": "SL-0171",
          "type": "PERSON",
          "share": ".70"
        },
        {
          "actor": "既有并发控制与状态机方法",
          "actorId": "DIJKSTRA::SELF-STAB-CONTROL-PREHISTORY",
          "type": "PREDECESSOR_POOL",
          "share": ".15"
        },
        {
          "actor": "Burroughs研究支持",
          "actorId": "INSTITUTION:BURROUGHS",
          "type": "INSTITUTION",
          "share": ".05"
        },
        {
          "actor": "尚未识别的具体输入",
          "actorId": "DIJKSTRA::SELF-STAB-UNKNOWN",
          "type": "UNALLOCATED",
          "share": ".10"
        }
      ],
      "share": "0.70",
      "exactLight": "277.9750193874480755391766135614264304413739261081663128056989036421573977086206273518128181251641522",
      "light": "277.975019",
      "standaloneScore": "4.89",
      "lightSharePercent": "17.2181"
    },
    {
      "id": "OUT-SL0171-1968-THE-LAYERED-SYSTEM-IMPLEMENTATION",
      "title": "THE多道程序系统的分层构造与测试",
      "year": "1968",
      "summary": "将存储、处理器和输入输出分层实现与测试，明确层级接口；报告时仍有测试尚未完成。",
      "mReason": "在具体EL X8上把层级抽象落实到系统构造和测试，采用M4.3。六人团队的有界系统整合不同于一般方法，也不等于完整商业操作系统或长期服务。",
      "aReason": "个人及共同输入为可修订的研究预算，按原作署名、团队叙述及具体系统依赖分配；不从引用次数或后世市场规模倒推份额。",
      "sources": [
        {
          "label": "迪杰斯特拉原作：THE多道程序系统的分层构造与测试",
          "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD196.html"
        }
      ],
      "missing": "原报告确认写作时测试尚未完成，未预支长期运行成效。；六位成员的内部工项尚未分解，保留团队预算。",
      "status": "缺证暂估",
      "overlapNote": "只计1968年报告所述分层软件已编程并分层测试的工程交付；报告时测试尚未完成。原语与一般正确性方法由已有两族消费，本项只领内存、处理器、输入输出等接口整合及实际测试残余，不把拟交付大学服务视为已长期运行。",
      "M": "4.3",
      "budget": [
        {
          "actor": "艾兹赫尔·迪杰斯特拉",
          "actorId": "SL-0171",
          "type": "PERSON",
          "share": ".30"
        },
        {
          "actor": "THE六人设计、编程与测试团队",
          "actorId": "DIJKSTRA::THE-SIX-PERSON-TEAM",
          "type": "TEAM",
          "share": ".40"
        },
        {
          "actor": "埃因霍温理工大学",
          "actorId": "INSTITUTION:EINDHOVEN-UNIVERSITY-OF-TECHNOLOGY",
          "type": "INSTITUTION",
          "share": ".10"
        },
        {
          "actor": "Electrologica X8硬件及支持团队",
          "actorId": "DIJKSTRA::EL-X8-HARDWARE-SUPPORT",
          "type": "TEAM",
          "share": ".10"
        },
        {
          "actor": "GIER及既有系统方法",
          "actorId": "DIJKSTRA::GIER-AND-SYSTEMS-PREHISTORY",
          "type": "PREDECESSOR_POOL",
          "share": ".05"
        },
        {
          "actor": "尚未识别的具体输入",
          "actorId": "DIJKSTRA::THE-UNKNOWN",
          "type": "UNALLOCATED",
          "share": ".05"
        }
      ],
      "share": "0.30",
      "exactLight": "42.07612633868262906466823591790722789369148450303805532735905678949598933360010752474454751894803899",
      "light": "42.076126",
      "standaloneScore": "3.27",
      "lightSharePercent": "2.6062"
    }
  ],
  "exactTotalLight": "1614.435309888197943511847269234508608384731318575603764476552502273380776898031212629252191957709136",
  "totalLight": "1614.435310",
  "exactScore": "6.416579142756096721910576497149060779943771439916430483034946631850406148817676242679776903779383052",
  "displayScore": "6.42",
  "provisionalCount": 5,
  "provenance": {
    "releaseId": "research-200-20260914",
    "baselineLedgerSha256": "8bdd406b3e20ae22357644499e622922c670ff11010df0478c70c23b38902108",
    "c24DeltaSha256": "b0b96144d1d3397e54a61c3d706ff2da5920fe7617e3bef50407149cb97d9d62",
    "generatorSha256": "25de659e9852503508e7c27d8a31773b8da5d6310531b1e3699d18cc94319929"
  },
  "priorScopeNote": "5项已列贡献的研究估分，含5项暂估。账本覆盖有限的主要成果，尚未穷尽生涯。M与归功份额是可修订的评估判断；未覆盖经历和负面影响不按零处理。",
  "rank": 40
}
