Proving Boolean Combinations of Deterministic Properties (1987)
| Venue: | In Proceedings of the Second Symposium on Logic in Computer Science |
| Citations: | 15 - 0 self |
BibTeX
@INPROCEEDINGS{Alpern87provingboolean,
author = {Bowen Alpern and Fred B. Schneider},
title = {Proving Boolean Combinations of Deterministic Properties},
booktitle = {In Proceedings of the Second Symposium on Logic in Computer Science},
year = {1987},
pages = {131--137},
publisher = {IEEE}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper gives a method for proving that a program satisfies a temporal property that has been specified in terms of Buchi automata. The method permits extraction of proof obligations for a property formulated as the Boolean combination of properties, each of which is specified by a deterministic Buchi automaton, directly from the individual automata. The proof obligations can be formulated as Hoare triples. The method is proved sound and relatively complete. A simple example illustrates applica- tion of the method.
