Protocol validation in complex systems
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Design and validation of computer protocols
Design and validation of computer protocols
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Set-Based Analysis of Reactive Infinite-State Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
General technique for communications protocol validation
IBM Journal of Research and Development
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
Brand and Zafiropulo [1] introduced the model of communicating finite-state machines to represent a distributed system connected with FIFO channels. Several different communication protocols can be specified with this simple model. In this paper we address the problem of automatically validating protocols by verifying properties such as well-formedness and absence of deadlock. Our method is based on a representation of communicating finite-state machines in terms of logic programs. This leads to efficient verification algorithms based on the ground and non-ground semantics of logic programming.