PlusCal algorithm language

E467808

algorithm description language formal specification-related language pseudocode-style language

PlusCal algorithm language is a high-level pseudocode-style language designed by Leslie Lamport for writing and reasoning about algorithms that can be automatically translated into TLA+ specifications.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (4)

Label	Occurrences
PlusCal	4
PlusCal algorithm language canonical	2
PlusCal translator	1
The PlusCal Algorithm Language (by Leslie Lamport)	1

How this entity was disambiguated

This entity first appeared as the object of triple T4765300 — 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: PlusCal algorithm language
Context triple: [Temporal Logic of Actions, hasComponent, PlusCal algorithm language]

A. Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
B. Alur language
The Alur language is a Western Nilotic language spoken primarily by the Alur people of northwestern Uganda and northeastern Democratic Republic of the Congo.
C. 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.
D. 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.
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: PlusCal algorithm language
Target entity description: PlusCal algorithm language is a high-level pseudocode-style language designed by Leslie Lamport for writing and reasoning about algorithms that can be automatically translated into TLA+ specifications.

A. Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
B. Alur language
The Alur language is a Western Nilotic language spoken primarily by the Alur people of northwestern Uganda and northeastern Democratic Republic of the Congo.
C. 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.
D. 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.
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	algorithm description language ⓘ formal specification-related language ⓘ pseudocode-style language ⓘ
canBeTranslatedTo	TLA+ ⓘ
createdByOrganization	Microsoft Research (through work of Leslie Lamport) ⓘ
designedBy	Leslie Lamport ⓘ
designGoal	bridge gap between informal pseudocode and formal specifications ⓘ make TLA+ accessible to programmers familiar with pseudocode ⓘ
documentation	The PlusCal Algorithm Language (by Leslie Lamport) ⓘ linked to: PlusCal algorithm language
domain	algorithm specification ⓘ concurrent system design ⓘ formal methods ⓘ
embeddedIn	TLA+ module comments ⓘ
executionModel	state-based ⓘ
hasControlConstruct	for loops ⓘ goto-like jumps via labels ⓘ if-then-else ⓘ while loops ⓘ
hasDistributionForm	process-based syntax for concurrent processes ⓘ
hasFeature	atomic blocks ⓘ fairness annotations ⓘ labels ⓘ macro definitions ⓘ nondeterministic choice ⓘ procedures ⓘ structured control flow ⓘ variables ⓘ
hasFullName	PlusCal algorithm language ⓘ
isHighLevel	true ⓘ
languageFamily	algorithmic specification languages ⓘ
purpose	reasoning about algorithms ⓘ writing algorithms in a high-level pseudocode style ⓘ
relatedTo	TLA+ specification language ⓘ linked to: TLA+ model checking ⓘ pseudocode ⓘ
semanticsDefinedBy	translation to TLA+ ⓘ
style	pseudocode-like ⓘ
supports	concurrent algorithms ⓘ distributed algorithms ⓘ sequential algorithms ⓘ
supportsReasoningAbout	liveness properties ⓘ safety properties ⓘ
toolSupport	PlusCal translator ⓘ linked to: PlusCal algorithm language TLA+ Toolbox ⓘ
translationTarget	TLA+ specification ⓘ
typicalUseCase	specifying concurrent algorithms for verification ⓘ teaching formal specification of algorithms ⓘ
verificationVia	TLC model checker ⓘ

How these facts were elicited