A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Deductive verification of invariants of state-transition systems
[chapter]
1998
Lecture Notes in Computer Science
We present a modular technique to prove invariants of statetransition systems in a deductive framework. We show how the semantic knowledge of the given problem can be generically used to decompose the problem into modular tasks which can be successfully tackled with the help of techniques developed in the eld of inductive theorem proving. As an example we present the mechanical veri cation of the invariant of a case study specifying a generic elevator.
doi:10.1007/bfb0095436
fatcat:koyxzhqnojdwjn5u73p5jbaruy