Progress Measures for Verification Involving Nondeterminism
Klarlund, Nils; Schneider, Fred B.
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.
computer science; technical report
Previously Published As