Verification of Concurrent Programs
E260373
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Verification of Concurrent Programs canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2384370 — 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: Verification of Concurrent Programs Context triple: [Zohar Manna, authorOf, Verification of Concurrent Programs]
-
A.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
B.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
C.
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.
-
D.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
-
E.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
- 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: Verification of Concurrent Programs Target entity description: "Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
A.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
B.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
C.
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.
-
D.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
-
E.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
academic textbook
ⓘ
computer science book ⓘ nonfiction book ⓘ |
| appliesTheory |
concurrency theory
ⓘ
mathematical logic ⓘ program semantics ⓘ proof theory ⓘ |
| describes |
formal specification of concurrent behavior
ⓘ
logical systems for concurrency ⓘ methods to avoid deadlocks ⓘ methods to avoid race conditions ⓘ proof systems for concurrent languages ⓘ reasoning about atomic operations ⓘ reasoning about critical sections ⓘ state-space reasoning for concurrent executions ⓘ techniques for proving program correctness ⓘ |
| field |
computer science
ⓘ
concurrent programming ⓘ formal methods ⓘ program verification ⓘ |
| focusesOn |
compositional verification
ⓘ
correctness proofs ⓘ formal methods for concurrency ⓘ interleaving semantics ⓘ invariants in concurrent programs ⓘ liveness properties of concurrent programs ⓘ modular verification of concurrent components ⓘ proof rules for concurrent constructs ⓘ proof techniques for concurrent programs ⓘ reasoning about interference ⓘ safety properties of concurrent programs ⓘ shared-memory concurrency ⓘ synchronization correctness ⓘ temporal reasoning about programs ⓘ |
| goal |
to formalize reasoning about concurrent execution
ⓘ
to present rigorous techniques for proving correctness of concurrent programs ⓘ |
| hasFormat | textbook ⓘ |
| hasGenre |
scientific literature
ⓘ
technical literature ⓘ |
| intendedAudience |
graduate students in computer science
ⓘ
researchers in formal methods ⓘ software verification practitioners ⓘ |
| mainSubject |
concurrency
ⓘ
program correctness ⓘ verification of concurrent programs ⓘ |
| use |
reference for research in concurrency verification
ⓘ
teaching advanced program verification ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Verification of Concurrent Programs Description of subject: "Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.