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: IC3 model checking algorithm | Statement: [Kenneth McMillan, knownFor, IC3 model checking algorithm]

Target entity: IC3 model checking algorithm
Context triple: [Kenneth McMillan, knownFor, IC3 model checking algorithm]

• A. 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.
• B. 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.
• C. SPIN model checker
  SPIN is a widely used open-source model checker designed for the formal verification of distributed software systems and communication protocols.
• D. 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.
• E. The Temporal Logic of Programs
  The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
• 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: IC3 model checking algorithm
Triple: [Kenneth McMillan, knownFor, IC3 model checking algorithm]

The IC3 model checking algorithm is a SAT-based formal verification technique that incrementally constructs inductive invariants to efficiently prove or refute safety properties of hardware and software systems.

Target entity: IC3 model checking algorithm
Target entity description: The IC3 model checking algorithm is a SAT-based formal verification technique that incrementally constructs inductive invariants to efficiently prove or refute safety properties of hardware and software systems.

• A. 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.
• B. 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.
• C. SPIN model checker
  SPIN is a widely used open-source model checker designed for the formal verification of distributed software systems and communication protocols.
• D. 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.
• E. The Temporal Logic of Programs
  The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
• F. None of above. chosen