College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||Progress Measures for Verification Involving Nondeterminism|
|Authors: ||Klarlund, Nils|
Schneider, Fred B.
|Keywords: ||computer science|
|Issue Date: ||Nov-1990|
|Publisher: ||Cornell University|
|Abstract: ||Using the notion of progress measures, we give a complete verification method for proving that a program satisfies a property specified by an automaton having bounded nondeterminism. Such automata can express any safety property. Previous methods, which can be derived from the method presented here, either rely on transforming the program or are not complete.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.