Verification Conditions for $\omega$-Automata and Applications to Fairness
| dc.contributor.author | Klarlund, Nils | en_US |
| dc.date.accessioned | 2007-04-23T17:44:12Z | |
| dc.date.available | 2007-04-23T17:44:12Z | |
| dc.date.issued | 1990-02 | en_US |
| dc.description.abstract | We present sound and complete verification conditions for proving that a program satisfies a specification definied by a deterministic Rabin automaton. Our verification conditions yield a simple method for proving that a program terminates under general fairness constraints. As opposed to previous approaches, our method is syntax-independent and does not require recursive applications of proof rules. Moreover using a result by Safra, we obtain the first direct method for proving that a program satisfies a Buchi automaton specification. Finally, we show that our method generalized two earlier methods. | en_US |
| dc.format.extent | 2890101 bytes | |
| dc.format.extent | 610955 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-1080 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6920 | |
| 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 | Verification Conditions for $\omega$-Automata and Applications to Fairness | en_US |
| dc.type | technical report | en_US |