Verifying Safety Properties Using Non-deterministic Infinite-state Automata

Authors:
Nils Klarlund;Fred B. Schneider
Affiliations:
-;-
Venue:
Verifying Safety Properties Using Non-deterministic Infinite-state Automata
Year:
1989

Citing 0
Cited 2

A theory of normed simulations

ACM Transactions on Computational Logic (TOCL)
Generic forward and backward simulations

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A 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.