Modular formalization of reactive modules in COQ

Authors:
Ming-Hsien Tsai;Bow-Yaw Wang
Affiliations:
Institute of Information Science, Academia Sinica, Taiwan and Department of Information Management, National Taiwan University;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 10
Cited 0

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
Distributed Algorithms

Distributed Algorithms
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
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
I/Q Automata in Isabelle/HOL

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
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
Reactive Modules

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present modular formalizations of the model specification language Reactive Modules and the temporal logic CTL* in the proof assistant Coq. In our formalizations, both shallow and deep embeddings of each language are given. The modularity of our formalizations allows proofs and theorems to be reused across different embeddings. We illustrate the advantages of our modular formalizations by proving the mutual exclusion property of the Bakery algorithm in different embeddings.