Paper: Proving Boolean Combinations of Deterministic Properties (at LICS 1987)

Authors: Bowen Alpern Fred B. Schneider

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 application of the method.

BibTeX

  @InProceedings{AlpernSchneider-ProvingBooleanCombi,
    author = 	 {Bowen Alpern and Fred B. Schneider},
    title = 	 {Proving Boolean Combinations of Deterministic Properties},
    booktitle =  {Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science (LICS 1987)},
    year =	 {1987},
    month =	 {June}, 
    pages =      {131--137},
    location =   {Ithaca, NY, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }