Progress Measures for Verification Involving Nondeterminism
| dc.contributor.author | Klarlund, Nils | en_US |
| dc.contributor.author | Schneider, Fred B. | en_US |
| dc.date.accessioned | 2007-04-23T17:50:34Z | |
| dc.date.available | 2007-04-23T17:50:34Z | |
| dc.date.issued | 1990-11 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 1646104 bytes | |
| dc.format.extent | 350810 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1167 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7007 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Progress Measures for Verification Involving Nondeterminism | en_US |
| dc.type | technical report | en_US |