Published September 2011
| public
Journal Article
Verification of distributed systems with local–global predicates
Abstract
This paper describes a methodology for developing and verifying a class of distributed systems inwhich the state space may be discrete or continuous. Our focus is 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 outlined.
Additional Information
© 2010 BCS. Received 28 February 2009. Revised 1 October 2009. Accepted 8 March 2010 by T. Margaria, D. Kröning, and J. Woodcock. Published online 9 April 2010. The authors would like to thank the referees for their very helpful and constructive comments. This work was supported in part by the Multidisciplinary Research Initiative (MURI) from the Air Force Office of Scientific Research.Additional details
- Eprint ID
- 25497
- Resolver ID
- CaltechAUTHORS:20110929-135751977
- Air Force Office of Scientific Research (AFOSR)/Multidisciplinary University Research Initiative (MURI)
- Created
-
2011-09-30Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field