Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: TLA+ | Statement: [Temporal Logic of Actions, influenced, TLA+]

Target entity: TLA+
Context triple: [Temporal Logic of Actions, influenced, TLA+]

• 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. 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.
• 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. branching-time temporal logic CTL*
  Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
• E. Verification of Concurrent Programs
  "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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: TLA+
Triple: [Temporal Logic of Actions, influenced, TLA+]

TLA+ is a formal specification language developed by Leslie Lamport for modeling and verifying concurrent and distributed systems using mathematical logic.

Target entity: TLA+
Target entity description: TLA+ is a formal specification language developed by Leslie Lamport for modeling and verifying concurrent and distributed systems using mathematical logic.

• 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. 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.
• 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. branching-time temporal logic CTL*
  Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
• E. Verification of Concurrent Programs
  "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.
• F. None of above. chosen