Abstract
We present a library of PVS meta-theories that can be used to verify a class of distributed systems in which agent communication is via message-passing. The theoretical work, as outlined in Chandy et al. (Form Aspect Comput 2011, to appear) consists of iterative schemes for solving systems of linear equations, such as message-passing extensions of the Gauss and Gauss-Seidel methods. We briefly review that work and discuss the challenges in formally verifying it.
Original language | English (US) |
---|---|
Pages (from-to) | 109-118 |
Number of pages | 10 |
Journal | Innovations in Systems and Software Engineering |
Volume | 7 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2011 |
Keywords
- Message passing systems
- Methods for solving systems of linear equations
- PVS theorem-prover
ASJC Scopus subject areas
- Software