A formalization of the SMEPP model in Maude

Authors:
Francisco Durán;Francisco Gutiérrez;Pablo López;Ernesto Pimentel
Affiliations:
University of Málaga;University of Málaga;University of Málaga;University of Málaga
Venue:
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Year:
2008

Citing 9
Cited 0

Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Specification and proof in membership equational logic

Theoretical Computer Science - Trees in algebra and programming
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Rewriting logic: roadmap and bibliography

Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Two case studies of semantics execution in Maude: CCS and LOTOS

Formal Methods in System Design
Strategies and simulations in a semantic framework

Journal of Algorithms
A Service-Oriented Model for Embedded Peer-to-Peer Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a service-oriented model for the description of embedded Peer-to-Peer (EP2P) systems and formalizes the proposed model in Maude. The model is organized around the notions of groups of peers and services offered by these groups. We first summarize the main concepts of the model and then present αSMoL, an abstract language with a formal semantics that provides a solid ground to develop tools for the automated analysis and verification of EP2P specifications. We then describe a formalization of αSMoL in Maude, and introduce an example to illustrate both the expressive power of the model and the possibilities of Maude to support automated verification of properties of αSMoL programs.