Alexander Godlevsky

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The main goal of the paper is finding of pre-and post-invariants for transitions between symbolic states in the system that must be verified and use them for verification purposes. Systems are specified by basic protocols [1]. This specification defines a transition system with transitions s → s where s and s are symbolic states, b is a basic protocol. The(More)
The paper presents the usage of invariants technique for symbolic modeling verification of requirements for reactive systems. It includes checking of the safety, incompleteness, liveness, consistency properties, and livelock detection. The paper describes the iterative method of double approximation for invariants generation and illustrated by examples of(More)
  • 1