Formalization of CTL* in Calculus of Inductive Constructions [chapter]

Ming-Hsien Tsai, Bow-Yaw Wang
2007 Lecture Notes in Computer Science  
A modular formalization of the branching time temporal logic CTL * is presented. Our formalization subsumes prior formalizations of propositional linear temporal logic (PTL) and computation tree logic (CTL). Moreover, the modularity allows to instantiate our formalization for different formal security models. Validity of axioms and soundness of inference rules in axiomatizations of PTL, UB, CTL, and CTL * are discussed as well.
doi:10.1007/978-3-540-77505-8_25 fatcat:gpybn4vc3na4lczjjcvkmfe2dy