Computation Tree Logic (CTL) is a branching-time logic used in formal verification to specify and verify properties of systems that can be modeled as state transition systems. It allows for the expression of temporal properties over all possible future paths from a given state, making it particularly useful for verifying the correctness of concurrent and distributed systems.