Computational Tree Logic (CTL) is a branching-time temporal logic used to express properties about the states and paths of a computational model, allowing for the specification and verification of system behaviors over time. It enables reasoning about possible execution paths in a system, making it a powerful tool for model checking in computer science and formal verification domains.