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: Spec# static program verifier | Statement: [Spec#, hasComponent, Spec# static program verifier]

Target entity: Spec# static program verifier
Context triple: [Spec#, hasComponent, Spec# static program verifier]

• A. Program Verification: Approaches and Tools
  "Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
• B. 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.
• C. 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.
• 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. Satisfiability Modulo Theories (SMT)
  Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
• 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: Spec# static program verifier
Triple: [Spec#, hasComponent, Spec# static program verifier]

Spec# static program verifier is a formal verification tool that automatically checks Spec# programs for correctness properties such as type safety, null dereferences, and contract compliance using logical reasoning.

Target entity: Spec# static program verifier
Target entity description: Spec# static program verifier is a formal verification tool that automatically checks Spec# programs for correctness properties such as type safety, null dereferences, and contract compliance using logical reasoning.

• A. Program Verification: Approaches and Tools
  "Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
• B. 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.
• C. 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.
• 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. Satisfiability Modulo Theories (SMT)
  Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
• F. None of above. chosen