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: PRISM probabilistic model checker | Statement: [Marta Kwiatkowska, notableWork, PRISM probabilistic model checker]

Target entity: PRISM probabilistic model checker
Context triple: [Marta Kwiatkowska, notableWork, PRISM probabilistic model checker]

• 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. FDR model checker
  FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
• D. Temporal Verification of Reactive Systems
  "Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
• E. 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.
• 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: PRISM probabilistic model checker
Triple: [Marta Kwiatkowska, notableWork, PRISM probabilistic model checker]

PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.

Target entity: PRISM probabilistic model checker
Target entity description: PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.

• 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. FDR model checker
  FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
• D. Temporal Verification of Reactive Systems
  "Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
• E. 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.
• F. None of above. chosen