Formalization of CTL* in calculus of inductive constructions

Authors:
Ming-Hsien Tsai;Bow-Yaw Wang
Affiliations:
Institute of Information Science, Academia Sinica, Taiwan and Department of Information Management, National Taiwan University, Taiwan;Institute of Information Science, Academia Sinica, Taiwan
Venue:
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Year:
2006

Citing 13
Cited 1

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
Temporal logic of programs

Temporal logic of programs
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the formalization of the modal &mgr;-calculus in the calculus of inductive constructions

Information and Computation
Mu-calculus model-checking

Computer-Aided reasoning
A Verified Model Checker for the Modal µ-calculus in Coq

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Combining Model Checking and Deduction for I/O-Automata

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Traces of I/O-Automata in Isabelle/HOLCF

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Implementing a Model Checker for LEGO

FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Formal model and policy specification of usage control

ACM Transactions on Information and System Security (TISSEC)
Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions

Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions

A proof pearl with the fan theorem and bar induction: walking through infinite trees with mixed induction and coinduction

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.