Skip to main content
SpringerLink
Log in

Matelas: A Predicate Calculus Common Formal Definition for Social Networking

  • Conference paper
Abstract State Machines, Alloy, B and Z (ABZ 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5977))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrial, J.R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    MATH  Google Scholar 

  2. Abrial, J.-R., Mussat, L.: Introducing dynamic constraints in B. In: Bert, D. (ed.) B 1998. LNCS, vol. 1393, pp. 83–128. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Abrial, J.R., Hallerstede, S.: Refinement, decomposition and instantiation of discrete models: Application to Event-B. Fundamentae Informatica 77(1,2), 1–24 (2007)

    MATH  MathSciNet  Google Scholar 

  4. Allen, A.L.: Uneasy Access: Privacy for Women in a Free Society. Rowman and Littlefield (1988)

    Google Scholar 

  5. Atelier b, http://www.atelierb.eu/index_en.html

  6. Baudin, P., Filliâtre, J.-C., Marché, C., Monate, B., Moy, Y., Prevosto, V.: ACSL: ANSI/ISO C specification language, http://frama-c.cea.fr/download/-plug-indevelopmentguide.pdf

  7. Benisch, M., Sadeh, N., Sandholm, T.: A theory of expressiveness in mechanisms. In: Proceeding of the 23rd Conference on Artificial Intelligence (July 2008)

    Google Scholar 

  8. Bouquet, F., Dadeau, F., Julien, J.: JML2B: Checking JML specifications with B machines. In: The 7th International B Conference, pp. 285–288 (2007)

    Google Scholar 

  9. Breunesse, C., Catano, N., Huisman, M., Jacobs, B.: Formal methods for smart cards: An experience report. Science of Computer Programming 55(1-3), 53–80 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. B Tools, http://www.b-core.com/btool.html

  11. Burdy, L., Cheon, Y., Cok, D., Ernst, M., Kiniry, J., Leavens, G.T., Leino, K.R.M., Poll, E.: An overview of JML tools and applications. International Journal on Software Tools for Technology Transfer (STTT) 7(3), 212–232 (2005)

    Google Scholar 

  12. Catano, N., Kostakos, V., Oakley, I.: Poporo: A formal framework for social networking. In: 3rd International Workshop on Formal Methods for Interactive Systems (FMIS), Eindhoven, The Netherlands (November 2009) (to appear)

    Google Scholar 

  13. Cranor, L., Lessig, L.: Web Privacy with P3p. O’Reilly & Associates, Inc., Sebastopol (2002)

    Google Scholar 

  14. Facebook’s statistics, http://www.facebook.com/press/info.php?statistics

  15. Groslambert, J.: Verification of LTL on B event systems. In: Julliand, J., Kouchnarenko, O. (eds.) B 2007. LNCS, vol. 4355, pp. 109–124. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Gross, R., Acquisti, A.: Information revelation and privacy in online social networks. In: Workshop on Privacy in the Electronic Society (WPES), pp. 71–80 (2005)

    Google Scholar 

  17. He, J., Hoare, C.A.R., Sanders, J.W.: Data refinement refined. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 187–196. Springer, Heidelberg (1986)

    Google Scholar 

  18. Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica 1, 271–281 (1972)

    Article  MATH  Google Scholar 

  19. Jagadeesan, R., Marrero, W., Pitcher, C., Saraswat, V.A.: Timed constraint programming: a declarative approach to usage control. In: Proceeding of Principles and Practice of Declarative Programming (PPDP), pp. 164–175 (2005)

    Google Scholar 

  20. Necula, G.C.: Proof-carrying code. In: Symposium on Principles of Programming Languages (POPL), Paris, January 1997, p. 106119 (1997)

    Google Scholar 

  21. Necula, G., Lee, P.: Research on proof-carrying code for untrusted-code security. In: Proceedings of the 1997 IEEE Symposium on Security and Privacy, p. 204 (1997)

    Google Scholar 

  22. ProB, http://users.ecs.soton.ac.uk/mal/systems/prob.html

  23. Robinson, A., Voronkov, A.: Handbook of Automated Reasoning. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  24. Rodin, http://www.event-b.org/platform.html

  25. Schneider, S.: The B-Method: An Introduction. Palgrave (2001)

    Google Scholar 

  26. Schoeman, F.D.: Philosophical Dimensions of Privacy: An Anthology. Cambridge University Press, Cambridge (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Madeira ITI, Funchal, Portugal

    Nestor Catano

  2. Pontificia Universidad Javeriana, Cali, Colombia

    Camilo Rueda

Authors
  1. Nestor Catano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Camilo Rueda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département d’informatique, Sherbrooke, Université de Sherbrooke, J1K 2R1, Québec, Canada

    Marc Frappier

  2. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, BC, Canada

    Uwe Glässer

  3. Department of Electrical and computer Engineering, University of Texas at Austin, 1 University Station C5000, 78712-0240, Austin, TX, USA

    Sarfraz Khurshid

  4. Département informatique, Route forestiére Hurtault, Université Paris-Est Créteil, IUT Sénart/Fontainebleau, 77300, Fontainebelau, France

    RĂ©gine Laleau

  5. Department of Computer Science, The University of Waikato, 3240, Hamilton, New Zealand

    Steve Reeves

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Catano, N., Rueda, C. (2010). Matelas: A Predicate Calculus Common Formal Definition for Social Networking. In: Frappier, M., Glässer, U., Khurshid, S., Laleau, R., Reeves, S. (eds) Abstract State Machines, Alloy, B and Z. ABZ 2010. Lecture Notes in Computer Science, vol 5977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11811-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11811-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11810-4

  • Online ISBN: 978-3-642-11811-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation