spi-calculus
E807609
Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
All labels observed (2)
| Label | Occurrences |
|---|---|
| "A Calculus for Cryptographic Protocols: The Spi Calculus" | 1 |
| spi-calculus canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9566832 — 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: spi-calculus Context triple: [π-calculus, influenced, spi-calculus]
-
A.
π-calculus
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
-
B.
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.
-
C.
CSP (Communicating Sequential Processes)
CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
-
D.
Jones calculus
Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
-
E.
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.
- 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: spi-calculus Target entity description: Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
-
A.
π-calculus
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
-
B.
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.
-
C.
CSP (Communicating Sequential Processes)
CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
-
D.
Jones calculus
Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
-
E.
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.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
formal method
ⓘ
mathematical model of computation ⓘ process calculus ⓘ |
| assumes | Dolev–Yao attacker model ⓘ |
| basedOn | π-calculus ⓘ |
| canExpress |
authentication protocols
ⓘ
confidentiality protocols ⓘ encryption-based protocols ⓘ key-exchange protocols ⓘ |
| extends | π-calculus ⓘ |
| formalizes |
cryptographic protocol behavior
ⓘ
message-passing security protocols ⓘ |
| hasAbstractionLevel | symbolic (Dolev–Yao) cryptography ⓘ |
| hasDomain | security protocol analysis ⓘ |
| hasFeature |
concurrency
ⓘ
cryptographic primitives ⓘ decryption operators ⓘ encryption operators ⓘ message passing ⓘ name generation ⓘ pairing and projection ⓘ process composition ⓘ |
| hasNotation |
constructs for encryption and decryption of messages
ⓘ
process terms with input and output prefixes ⓘ |
| hasProperty |
compositionality
ⓘ
support for bisimulation reasoning ⓘ |
| hasSemanticStyle |
labelled transition system semantics
ⓘ
operational semantics ⓘ |
| influenced |
applied π-calculus
ⓘ
linked to:
π-calculus
subsequent protocol verification calculi ⓘ |
| introducedBy |
Andrew D. Gordon
ⓘ
Martin Abadi ⓘ |
| introducedIn | 1997 ⓘ |
| introducedInWork |
"A Calculus for Cryptographic Protocols: The Spi Calculus"
ⓘ
linked to:
spi-calculus
|
| relatedTo |
Dolev–Yao model
ⓘ
linked to:
Dolev–Yao attacker model
applied π-calculus ⓘ
linked to:
π-calculus
process algebra ⓘ π-calculus ⓘ |
| supports |
modeling of authentication properties
ⓘ
modeling of secrecy properties ⓘ reasoning about attackers ⓘ symbolic cryptography ⓘ |
| usedFor |
analysis of cryptographic protocols
ⓘ
formal modeling of security protocols ⓘ formal verification of security properties ⓘ |
| usedIn |
design of secure communication protocols
ⓘ
formal methods for security ⓘ research on protocol 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: spi-calculus Description of subject: Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: spi-calculus