Verification of Distributed Systems with Local-Global Predicates

To appear: Formal Aspects of Computing

This paper describes a methodology for developing and verifying a class of distributed systems in which states and state transitions may be continuous or discrete. We focus on systems where changes are local in that a small number of components change state while the remainder of the system is unchanged. A proof methodology is developed that ensures global properties, such as invariants and convergence, by guaranteeing local properties within subsystems. This methodology is used to prove the correctness of concrete examples. We present a PVS library of theorems and proofs that can be used to reduce the work required to develop and verify programs in this class. A
transformation of these libraries to Java is also made.

AttachmentSize
fac.20100109.pdf403.29 KB
FAC-java.zip18.74 KB
FAC-PVS.zip28.73 KB