Show simple item record

dc.contributor.authorKlarlund, Nilsen_US
dc.contributor.authorSchneider, Fred B.en_US
dc.date.accessioned2007-04-23T17:38:23Z
dc.date.available2007-04-23T17:38:23Z
dc.date.issued1989-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1036en_US
dc.identifier.urihttps://hdl.handle.net/1813/6836
dc.description.abstractA new class of infinite-state automata, called safety automata, is introduced. Any safety property can be specified by using such an automaton. Sound and complete proof obligations for establishing that an implementation satisfies the property specified by a safety automaton are given.en_US
dc.format.extent2152946 bytes
dc.format.extent527030 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleVerifying Safety Properties Using Non-deterministic Infinite-state Automataen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics