“Separation Logic: A Logic for Shared Mutable Data Structures”
E1382864
UNEXPLORED
“Separation Logic: A Logic for Shared Mutable Data Structures” is a seminal paper that introduced separation logic, a formal system for reasoning locally and modularly about programs that manipulate shared, mutable memory.
All labels observed (2)
| Label | Occurrences |
|---|---|
| separation logic | 1 |
| “Separation Logic: A Logic for Shared Mutable Data Structures” canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19559149 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: “Separation Logic: A Logic for Shared Mutable Data Structures” Context triple: [John C. Reynolds, notableWork, “Separation Logic: A Logic for Shared Mutable Data Structures”]
-
A.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
B.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
-
C.
“Linear Types Can Change the World!”
“Linear Types Can Change the World!” is a seminal research paper in programming languages that advocates for the use of linear type systems to improve resource management, safety, and efficiency in software.
-
D.
The Temporal Logic of Programs
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
E.
TLA+ proof system
The TLA+ proof system is a formal verification framework that allows users to mechanically check the correctness of TLA+ specifications using machine-checked logical proofs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: “Separation Logic: A Logic for Shared Mutable Data Structures” Target entity description: “Separation Logic: A Logic for Shared Mutable Data Structures” is a seminal paper that introduced separation logic, a formal system for reasoning locally and modularly about programs that manipulate shared, mutable memory.
-
A.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
B.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
-
C.
“Linear Types Can Change the World!”
“Linear Types Can Change the World!” is a seminal research paper in programming languages that advocates for the use of linear type systems to improve resource management, safety, and efficiency in software.
-
D.
The Temporal Logic of Programs
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
E.
TLA+ proof system
The TLA+ proof system is a formal verification framework that allows users to mechanically check the correctness of TLA+ specifications using machine-checked logical proofs.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: “Separation Logic: A Logic for Shared Mutable Data Structures”