Affiliation:
1. Google Inc., 1600 Amphitheatre Pkwy, 94043, Mountain View, CA, USA
2. Computer Science Department, Stanford University, 353 Serra Mall, 94305-9045, Stanford, CA, USA
Abstract
Abstract
Alternating systems are models of computer programs whose behavior is governed by the actions of multiple agents with, potentially, different goals. Examples include control systems, resource schedulers, security protocols, auctions and election mechanisms. Proving properties about such systems has emerged as an important new area of study in formal verification, with the development of logical frameworks such as the alternating temporal logic
ATL
*.
Techniques for model checking
ATL
* over finite-state systems have been well studied, but many important systems are infinite-state and thus their verification requires, either explicitly or implicitly, some form of deductive reasoning.
This paper presents a theoretical framework for the analysis of alternating infinite-state systems. It describes models of computation, of various degrees of generality, and alternating-time logics such as
ATL
* and its variations. It then develops a proof system that allows to prove arbitrary
ATL
* properties over these infinite-state models. The proof system is shown to be complete relative to validities in the weakest possible assertion language.
The paper then derives auxiliary proof rules and verification diagrams techniques and applies them to security protocols, deriving a new formal proof of fairness of a multi-party contract signing protocol where the model of the protocol and of the properties contains both game-theoretic and infinite-state (parameterized) aspects.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Unified Model Checking Approach of APTL;Structured Object-Oriented Formal Language and Method;2021
2. Zohar Manna (1939–2018);Formal Aspects of Computing;2019-12
3. Probabilistic CTL $$^{*}$$ : The Deductive Way;Tools and Algorithms for the Construction and Analysis of Systems;2016
4. Deductive control synthesis for alternating-time logics;Proceedings of the 14th International Conference on Embedded Software - EMSOFT '14;2014