Skip to main content

On a Mereological System for Relational Software Specifications

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 2002 (MFCS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2420))

Abstract

The concept of being a part of is defined and analysed in an algebraic framework and then apply to the algebra of relations. A motivation that comes from Software Engineering is discussed.

Partially supported by NSERC of Canada and CITO of Ontario Grants.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. R. Abraham, Evaluating Generalized Tabular Expressions in Software Documentation, CRL Report 346, McMaster University, Hamilton, Ontario, Canada, 1997. Available at http://www.crl.mcmaster.ca/SERG/serg.publications.html

    Google Scholar 

  2. T. A. Alspaugh, S. R. Faulk, K. Heninger-Britton, R. A. Parker, D. L. Parnas, J. E. Shore, Software Requirements for the A-7E Aircraft, NRL Memoramdum Report 3876, Naval Research Lab., Washington, DC, 1992.

    Google Scholar 

  3. C. Brink, W. Kahl, G. Schmidt (eds.), Relational Methods in Computer Science, Springer 1997.

    Google Scholar 

  4. E. F. Codd, A relational model of data for large shared data banks, Comm. of the ACM, 13 (1970) 377–388.

    Article  MATH  Google Scholar 

  5. I. Düntsh, S. Mikulás, Cylindric structures and dependencies in data bases, Theoretical Computer Science, 269,1,2 (2001), 451–468.

    Article  MathSciNet  Google Scholar 

  6. J. Desharnais, R. Khédri, A. Mili, Towards a Uniform Relational Semantics for Tabular Expressions, Proc. RELMICS 98, Warsaw 1998.

    Google Scholar 

  7. N. Goodman, The Structure of Appearance, 3rd edition, D. Reidel, 1977 (first edition in 1951).

    Google Scholar 

  8. L. Henkin, J. D. Monk, A. Tarski, Cylindric Algebras, Part I, North Holland 1971.

    Google Scholar 

  9. T. Imielinski, W. Lipski, The relational model of data and cylindric algebras, Journal of Computer and System Sciences, 28 (1984), 80–102.

    Article  MATH  MathSciNet  Google Scholar 

  10. R. Janicki, Towards a Formal Semantics of Parnas Tables, 17th International sConference on Software Engineering (ICSE’95), IEEE Computer Society, Seattle, WA, 1995, 231–240.

    Google Scholar 

  11. R. Janicki, On Formal Semantics of Tabular Expressions, CRL Report 355, McMaster University, Hamilton, Ontario, Canada 1997. Available at http://www.crl.mcmaster.ca/SERG/serg.publications.html

  12. R. Janicki, Remarks on Mereology of Direct Products and Relations, in J. Desharnais (ed.), Relational Methods in Computer Science, Methodos Publ. 2002, to appear, early version avalable at http://www.crl.mcmaster.ca/SERG/serg.publications.html

  13. R. Janicki, R. Khédri, On a Formal Semantics of Tabular Expressions, Science of Computer Programming, 39 (2001) 189–214.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Janicki, D. L. Parnas, J. Zucker, Tabular Representations in Relational Documents, in W. Kahl, G. Schmidt(eds.), Relational Methods in Computer Science, Springer 1997 [3].

    Google Scholar 

  15. R. Khédri, Requirements Scenarios Formalization Technique: n Versions Towards One Good Version, Proc. of RELMICS’01, Genova 2001.

    Google Scholar 

  16. K. Kuratowski, A. Mostowski, Set Theory, North Holland, 1976.

    Google Scholar 

  17. H. Leonard, N. Goodman, The calculus of individuals and its uses, Journal of Symbolic Logic, 5 (1940), 45–55.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. L. Parnas, Tabular representations of relations, CRL Report 260, McMaster University, Hamilton, Ontario, Canada 1992.

    Google Scholar 

  19. D. L. Parnas, J. Madey, Functional Documentation for Computer System Egineering, Science of Computer Programming, 24,1 (1995), 41–61.

    Article  Google Scholar 

  20. L. Polkowski, On Connection Synthesis via Rough Mereology, Fundamenta Informaticae, 46 (2001) 83–96.

    MATH  MathSciNet  Google Scholar 

  21. L. Polkowski, A. Skowron, Rough Mereology; A New Paradigm for Approximate Reasoning, Journal of Approximate Reasoning, 15,4 (1997), 316–333.

    Google Scholar 

  22. J. T. J. Strzednicki, V. F. Rickey (eds.), Leśniewski’s Systems, Kluwer Academic, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janicki, R. (2002). On a Mereological System for Relational Software Specifications. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

  • Online ISBN: 978-3-540-45687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics