Foundations and experiments in software science
A number of papers have appeared on the subject of software science; claiming the existence of laws relating the size of a program and the number of operands and operators used. The pre-eminent theory was developed by Halstead in 1972. The thesis work focuses on the examination of Halstead's th...
Gespeichert in:
| Veröffentlicht in: | Performance evaluation review 1982-10, Vol.11 (3), p.48-72 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 72 |
|---|---|
| container_issue | 3 |
| container_start_page | 48 |
| container_title | Performance evaluation review |
| container_volume | 11 |
| creator | Beser, Nicholas |
| description | A number of papers have appeared on the subject of software science; claiming the existence of laws relating the size of a program and the number of operands and operators used. The pre-eminent theory was developed by Halstead in 1972. The thesis work focuses on the examination of Halstead's theory; with an emphasis on his fundamental assumptions. In particular, the length estimator was analyzed to determine why it yields such a high variance; the theoretical foundations of software science have been extended to improve the applicability of the critical length estimator. This elaboration of the basic theory will result in guidelines for the creation of counting rules applicable to specific classes of programs, so that it is possible to determine both when and how software science can be applied in practice. |
| doi_str_mv | 10.1145/1010675.807795 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1145_1010675_807795</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29390991</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1555-bd5d4f4d5122e75bd80e83df87bec3b9a09c32fd4c5384c7fcd117dbd66dce183</originalsourceid><addsrcrecordid>eNotkDFPwzAQRi0BEm1hZc7ElvQujmPfiCpKkSqxwGw59lkKap0SpwL-PUXt9C1Pn56eEA8IFWKjlggIrVaVAa1JXYk5GNKEYFq6FjPAVpaKiG7FPOdPANQ1mplYrodjCm7qh5QLl0LBPwce-z2nKRd9KvIQp283cpF9z8nznbiJbpf5_rIL8bF-fl9tyu3by-vqaVt6VEqVXVChiU1QWNesVRcMsJEhGt2xlx05IC_rGBqvpGm8jj4g6tCFtg2e0ciFeDz_Hsbh68h5svs-e97tXOLhmG1NkoAIT2B1Bv045DxytIeTvht_LYL9D2MvYew5jPwDj95VuQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29390991</pqid></control><display><type>article</type><title>Foundations and experiments in software science</title><source>ACM Digital Library</source><creator>Beser, Nicholas</creator><creatorcontrib>Beser, Nicholas</creatorcontrib><description>A number of papers have appeared on the subject of software science; claiming the existence of laws relating the size of a program and the number of operands and operators used. The pre-eminent theory was developed by Halstead in 1972. The thesis work focuses on the examination of Halstead's theory; with an emphasis on his fundamental assumptions. In particular, the length estimator was analyzed to determine why it yields such a high variance; the theoretical foundations of software science have been extended to improve the applicability of the critical length estimator. This elaboration of the basic theory will result in guidelines for the creation of counting rules applicable to specific classes of programs, so that it is possible to determine both when and how software science can be applied in practice.</description><identifier>ISSN: 0163-5999</identifier><identifier>ISBN: 0897910869</identifier><identifier>ISBN: 9780897910866</identifier><identifier>DOI: 10.1145/1010675.807795</identifier><language>eng</language><ispartof>Performance evaluation review, 1982-10, Vol.11 (3), p.48-72</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1555-bd5d4f4d5122e75bd80e83df87bec3b9a09c32fd4c5384c7fcd117dbd66dce183</citedby><cites>FETCH-LOGICAL-c1555-bd5d4f4d5122e75bd80e83df87bec3b9a09c32fd4c5384c7fcd117dbd66dce183</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Beser, Nicholas</creatorcontrib><title>Foundations and experiments in software science</title><title>Performance evaluation review</title><description>A number of papers have appeared on the subject of software science; claiming the existence of laws relating the size of a program and the number of operands and operators used. The pre-eminent theory was developed by Halstead in 1972. The thesis work focuses on the examination of Halstead's theory; with an emphasis on his fundamental assumptions. In particular, the length estimator was analyzed to determine why it yields such a high variance; the theoretical foundations of software science have been extended to improve the applicability of the critical length estimator. This elaboration of the basic theory will result in guidelines for the creation of counting rules applicable to specific classes of programs, so that it is possible to determine both when and how software science can be applied in practice.</description><issn>0163-5999</issn><isbn>0897910869</isbn><isbn>9780897910866</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1982</creationdate><recordtype>article</recordtype><recordid>eNotkDFPwzAQRi0BEm1hZc7ElvQujmPfiCpKkSqxwGw59lkKap0SpwL-PUXt9C1Pn56eEA8IFWKjlggIrVaVAa1JXYk5GNKEYFq6FjPAVpaKiG7FPOdPANQ1mplYrodjCm7qh5QLl0LBPwce-z2nKRd9KvIQp283cpF9z8nznbiJbpf5_rIL8bF-fl9tyu3by-vqaVt6VEqVXVChiU1QWNesVRcMsJEhGt2xlx05IC_rGBqvpGm8jj4g6tCFtg2e0ciFeDz_Hsbh68h5svs-e97tXOLhmG1NkoAIT2B1Bv045DxytIeTvht_LYL9D2MvYew5jPwDj95VuQ</recordid><startdate>19821001</startdate><enddate>19821001</enddate><creator>Beser, Nicholas</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19821001</creationdate><title>Foundations and experiments in software science</title><author>Beser, Nicholas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1555-bd5d4f4d5122e75bd80e83df87bec3b9a09c32fd4c5384c7fcd117dbd66dce183</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1982</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Beser, Nicholas</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Performance evaluation review</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Beser, Nicholas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Foundations and experiments in software science</atitle><jtitle>Performance evaluation review</jtitle><date>1982-10-01</date><risdate>1982</risdate><volume>11</volume><issue>3</issue><spage>48</spage><epage>72</epage><pages>48-72</pages><issn>0163-5999</issn><isbn>0897910869</isbn><isbn>9780897910866</isbn><abstract>A number of papers have appeared on the subject of software science; claiming the existence of laws relating the size of a program and the number of operands and operators used. The pre-eminent theory was developed by Halstead in 1972. The thesis work focuses on the examination of Halstead's theory; with an emphasis on his fundamental assumptions. In particular, the length estimator was analyzed to determine why it yields such a high variance; the theoretical foundations of software science have been extended to improve the applicability of the critical length estimator. This elaboration of the basic theory will result in guidelines for the creation of counting rules applicable to specific classes of programs, so that it is possible to determine both when and how software science can be applied in practice.</abstract><doi>10.1145/1010675.807795</doi><tpages>25</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0163-5999 |
| ispartof | Performance evaluation review, 1982-10, Vol.11 (3), p.48-72 |
| issn | 0163-5999 |
| language | eng |
| recordid | cdi_crossref_primary_10_1145_1010675_807795 |
| source | ACM Digital Library |
| title | Foundations and experiments in software science |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T17%3A42%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Foundations%20and%20experiments%20in%20software%20science&rft.jtitle=Performance%20evaluation%20review&rft.au=Beser,%20Nicholas&rft.date=1982-10-01&rft.volume=11&rft.issue=3&rft.spage=48&rft.epage=72&rft.pages=48-72&rft.issn=0163-5999&rft.isbn=0897910869&rft.isbn_list=9780897910866&rft_id=info:doi/10.1145/1010675.807795&rft_dat=%3Cproquest_cross%3E29390991%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=29390991&rft_id=info:pmid/&rfr_iscdi=true |