Matelas: A Predicate Calculus Common Formal Definition for Social Networking

Abstract

This paper presents Matelas, a B predicate calculus definition for social networking, modelling social-network content, privacy policies, social-networks friendship relations, and how these relations effect users’ policies. The work presented in this paper is part of an ongoing work that aims at using several formal methods tools and techniques to develop a full-fledged social-network service implementing stipulated policies. Although we employed Atelier B to write Matelas, plans are to port it to Event B and to use Rodin to implement the social-network application.

Document

If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.

Reference

% BibTex
@inproceedings{CatanoR10,
  author       = {N{\'{e}}stor Cata{\~{n}}o and
                  Camilo Rueda},
  editor       = {Marc Frappier and
                  Uwe Gl{\"{a}}sser and
                  Sarfraz Khurshid and
                  R{\'{e}}gine Laleau and
                  Steve Reeves},
  title        = {Matelas: {A} Predicate Calculus Common Formal Definition for Social
                  Networking},
  booktitle    = {Abstract State Machines, Alloy, {B} and Z, Second International Conference,
                  {ABZ} 2010, Orford, QC, Canada, February 22-25, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5977},
  pages        = {259--272},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-11811-1\_20},
  doi          = {10.1007/978-3-642-11811-1\_20},
  timestamp    = {Sat, 19 Oct 2019 20:28:13 +0200},
  biburl       = {https://dblp.org/rec/conf/asm/CatanoR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}