Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6659
Title: Proving Boolean Combinations of Deterministic Properties
Authors: Alpern, Bowen
Schneider, Fred B.
Keywords: computer science
technical report
Issue Date: Mar-1987
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-819
Abstract: This paper gives a method for providing 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 indiviudal 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.
URI: http://hdl.handle.net/1813/6659
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
87-819.pdf1.13 MBAdobe PDFView/Open
87-819.ps343.6 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us