Mutual Exclusion Verification of Parameterized Reader-Writer Algorithm: a Case Study

This paper presents the verification of mutual-exclusion properties of parameterized reader-writer algorithm. A class of diagram called Predicate diagrams [1] is used for representing the abstractions of parameterized systems described by specifications written in TLA. The verification is done by integrating deductive verification and algorithmic techniques. The correspondence between the original specification and the diagram is established by non-temporal proof obligations. Whereas model checker SPIN [3] is used to verify properties over finite-state abstractions

Predicate diagrams for the verification of reactive systems

Colloque avec actes et comité de lecture. internationale.International audienceWe define a class of diagrams that represent abstractions of---possibly infinite-state---reactive systems described by specifications written in temporal logic. Our diagrams are intended as the basis for the verification of both safety and liveness properties of such systems. Non-temporal proof obligations establish the correspondence between the original specification and the diagram, whereas model checking can be used to verify properties over finite-state abstractions. We describe the use of abstract interpretation techniques to generate proof diagrams from a given specification and user-defined predicates that represent sets of states