Abstract
The problem of complexity measurement is as old as programming, when programming became a major problem for the software industry in the sixties. The fact is clearly attested in the two NATO reports on software engineering [A14]. Von Neumann himself give a lot of attention to complexity in the last decade of his shortened lifetime.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Printz, J.: Productivité des programmeurs, Hermès (2001)
Park, R.: Software size measurement: a framework for counting source statements, Technical report, CMU/SEI-92-TR-20
Mc Cabe, T.J.: A complexity measure. IEEE TSE SE-2(4) (December 1976)
Berge, C.: Théorie des graphes et ses applications, Dunod (1963)
Popper, K.: The logic of scientific discovery (En français chez Payot) (1968)
Boehm, B.: Software engineering economics, 1981, and Software cost estimation with COCOMO II (2000)
Parnas, D.L.: On the criteria to be used in decomposing systems into modules. Communications of the ACM 15(12) (1972)
Printz, J.: Architecture logicielle, Dunod (2009)
Zipf, G.K.: The principle of least effort. Hafter Publishing Co., – B. Mantelbrot, Les objets fractals, Flammarion (1965)
Schooman, M.: Software engineering. McGraw Hill, New York (1988)
Arndt, C.: Information measures – Information and its description in science and engineering. Springer, Heidelberg (2004)
Chaitin: Information randomness and incompleteness. World Scientific, Singapore (1987); See also Delahaye, J.-P.: Information, complexité et hazard, Hermès, 1994 – Handbook of theoretical computer science, ch. 4, vol. A. MIT Press, Cambridge
Beck, K.: eXtreme programming explained, 2000; and also: Test driven development (2003)
NATO Science committee, Software engineering, Garmisch, 1968 et Rome (1969)
Horrocks, I.: Constructing the user interface with statecharts. Addison-Wesley, Reading (1999)
Larus, J., Kozyrakis, C.: Transactional memory. Communications of the ACM 51(7), 07/08; Shavit, N.: Transactions are tomorrow’s loads and stores. Communications of the ACM 51(8), 08/08; Harris, T.: Composable memory transaction. Communications of the ACM 51(8), 08/08; Cascaval, C.: Software transaction memory: why is it only a research toy? Communications of the ACM 51(11), 11/08
Pradat-Peyre, J.-F., Printz, J.: Pratique des tests logiciel, Dunod (2009)
Printz, J.: Ecosystème des projets informatiques, Hermès (2006)
Caseau, Y., Krob, D., Peyronnet, S.: Complexité des systèmes d’information: une famille de mesure de la complexité scalaire d’un schéma d’architecture, pôle System@tic
Brooks, F.: Mythical man-month. Addison-Wesley, Reading (1975) (new edition in 2000)
INCOSE System Engineering Handbook, version 3.2 (January 2010)
Clarke, E., et al.: Model checking. MIT Press, Cambridge (1999)
Utting, M., Legeard, B.: Practical model-based testing. Morgan Kaufmann, San Francisco (2007)
Legeard, B., et al.: Industrialiser le test fonctionnel, Dunod (2009)
Caseau, Y.: Urbanisation, SOA et BPM, Dunod (2008)
Kelly, S., Tolvanen, J.: Domain-specific modeling. Wiley, Chichester (2008)
Gray, J., Reuter, A.: Transaction processing: concepts and techniques. Morgan Kaufmann, San Francisco (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Printz, J. (2010). A Natural Measure for Denoting Software System Complexity. In: Aiguier, M., Bretaudeau, F., Krob, D. (eds) Complex Systems Design & Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15654-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-15654-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15653-3
Online ISBN: 978-3-642-15654-0
eBook Packages: EngineeringEngineering (R0)