Towards Linear Algebras of Components

  • Hugo Daniel Macedo
  • José Nuno Oliveira
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6921)

Introduction

In a recent article [1], David Parnas questions the traditional use of formal methods in software development, which he considers an underdeveloped body of knowledge and therefore of little hope for the software industry. He confronts the reader with the following statement, at some stage:

“We must learn to use mathematics in software development, but we need to question, and be prepared to discard, most of the methods that we have been discussing and promoting for all these years.”

At the core of Parnas objections we find the contrast between the current ad-hoc (re)invention of mathematical concepts which are cumbersome and a burden to use and elegant (and therefore useful) concepts which are neglected, often for cultural or (lack of) background reasons.

Keywords

Linear Algebra Label Transition System Probabilistic Program Algebraic Logic Galois Connection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Parnas, D.L.: Really rethinking ’formal methods’. IEEE Computer 43(1), 28–34 (2010)CrossRefGoogle Scholar
  2. 2.
    Distefano, S., Longo, F., Scarpa, M.: Availability assessment of ha standby redundant clusters. In: 29th IEEE Int. Symp. on Reliable Distributed Systems (2010)Google Scholar
  3. 3.
    Sernadas, A., Ramos, J., Mateus, P.: Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources. Technical report, TU Lisbon, Short paper, LPAR, Doha, Qatar (November 22-27, 2008)Google Scholar
  4. 4.
    Macedo, H., Oliveira, J.: Can we teach computers to generate fast OLAP code? Technical note (May 2010), http://wiki.di.uminho.pt
  5. 5.
    Trcka, N.: Strong, weak and branching bisimulation for transition systems and Markov reward chains: A unifying matrix approach. In: Andova, S.E. (ed.) Proc. 1st Workshop on Quantitative Formal Methods: Theory and Applications (December 2009)Google Scholar
  6. 6.
    Conway, J.: Regular Algebra and Finite Machines. Chap.& Hall, London (1971)MATHGoogle Scholar
  7. 7.
    Backhouse, R.: Mathematics of Program Construction, 608 pages. Univ. of Nottingham (2004) Draft of book in preparationGoogle Scholar
  8. 8.
    Maddux, R.: The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica 50, 421–455 (1991)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Freyd, P., Scedrov, A.: Categories, Allegories. Mathematical Library, vol. 39. North-Holland, Amsterdam (1990)MATHGoogle Scholar
  10. 10.
    Bloom, S.L., Sabadini, N., Walters, R.F.C.: Matrices, machines and behaviors. Applied Categorical Structures 4, 343–360 (1996), doi:10.1007/BF00122683CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Macedo, H., Oliveira, J.: Matrices As Arrows! A Biproduct Approach to Typed Linear Algebra. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol. 6120, pp. 271–287. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    MacLane, S.: Categories for the Working Mathematician (Graduate Texts in Mathematics). Springer, Heidelberg (September 1998)Google Scholar
  13. 13.
    Bonchi, F., Silva, A., Bonsangue, M., Rutten, J.: Quantitative Kleene coalgebras. In: Information and Computation. Academic Press, London (November 2010) ISSN: 0890-5401Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Hugo Daniel Macedo
    • 1
  • José Nuno Oliveira
    • 2
  1. 1.MAPi Doctoral ProgrammePortugal
  2. 2.Minho UniversityPortugal

Personalised recommendations