Verification of Concurrent Programs: The Automata-Theoretic Framework (1987)
| Venue: | Annals of Pure and Applied Logic |
| Citations: | 44 - 3 self |
BibTeX
@INPROCEEDINGS{Vardi87verificationof,
author = {Moshe Y. Vardi},
title = {Verification of Concurrent Programs: The Automata-Theoretic Framework},
booktitle = {Annals of Pure and Applied Logic},
year = {1987},
pages = {167--176}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present an automata-theoretic framework to the verification of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P . Now P is correct if and only if a program PA , obtained by combining P and A, terminates. We formalize this idea in a framework of !-automata with a recursive set of states. This unifies previous works on verification of fair termination and verification of temporal properties. 1 Introduction In this paper we present an automata-theoretic framework that unifies several trends in the area of concurrent program verification. The trends are temporal logic, model checking, automata theory, and fair termination. Let us start with a survey of these trends. In 1977 Pnueli suggested the use of temporal logic in the verification of concurrent programs [Pn77]. The basic motivation is that in the verificat...
