Alternating-Time temporal logic in the calculus of (co)inductive constructions

Authors:
Dante Zanarini;Carlos Luna;Luis Sierra
Affiliations:
CIFASIS, Rosario, Argentina;InCo, Facultad de Ingeniería, Universidad de la República, Uruguay;InCo, Facultad de Ingeniería, Universidad de la República, Uruguay
Venue:
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Year:
2012

Citing 14
Cited 0

The calculus of constructions

Information and Computation - Semantics of Data Types
Handbook of theoretical computer science (vol. B): formal models and semantics

Handbook of theoretical computer science (vol. B): formal models and semantics
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Alternating-time temporal logic

Journal of the ACM (JACM)
Inductive Definitions in the system Coq - Rules and Properties

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A HOL Conversion for Translating Linear Time Temporal Logic to omega-Automata

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Alternating-Time Temporal Logic

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
MOCHA: Modularity in Model Checking

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A game-based verification of non-repudiation and fair exchange protocols

Journal of Computer Security - IFIP 2000
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Complete axiomatization and decidability of alternating-time temporal logic

Theoretical Computer Science
Formal Analysis of Multiparty Contract Signing

Journal of Automated Reasoning
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Formal verification of a realistic compiler

Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a complete formalization of Alternating-time Temporal Logic (ATL) and its semantic model, Concurrent Game Structures (CGS), in the Calculus of (Co)Inductive Constructions, using the logical framework Coq. Unlike standard ATL semantics, temporal operators are formalized in terms of inductive and coinductive types, employing a fixpoint characterization of these operators. The formalization is used to model a concurrent system with an unbounded number of players and states, and to verify some properties expressed as ATL formulas. Unlike automatic techniques, our formal model has no restrictions in the size of the CGS, and arbitrary state predicates can be used as atomic propositions of ATL.