Does Not Compute
Most of us who work with software know all too well how easy it is to make small mistakes that escape detection in tests and come back to haunt us later. Unfortunately, when you study formal software verification techniques, one of the first things you learn is that a foolproof method for analyzing...
Gespeichert in:
| Veröffentlicht in: | IEEE software 2019-05, Vol.36 (3), p.14-16 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 16 |
|---|---|
| container_issue | 3 |
| container_start_page | 14 |
| container_title | IEEE software |
| container_volume | 36 |
| creator | Holzmann, Gerard J. |
| description | Most of us who work with software know all too well how easy it is to make small mistakes that escape detection in tests and come back to haunt us later. Unfortunately, when you study formal software verification techniques, one of the first things you learn is that a foolproof method for analyzing your code to reliably prevent these types of unpleasantries does not exist. Worse, you learn that it cannot exist. Although you may not remember a proof, you?ve certainly heard of the halting problem. Alan Turing already showed in 1936 that there cannot be an algorithm that can decisively show whether an arbitrary program will terminate on a given input or not. |
| doi_str_mv | 10.1109/MS.2019.2896053 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_8693086</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8693086</ieee_id><sourcerecordid>2211107825</sourcerecordid><originalsourceid>FETCH-LOGICAL-c243t-11e7dd5edf6facdbfc2e3ff88457dd78d3c63cea2c10e17c4b0b2ed68dc720463</originalsourceid><addsrcrecordid>eNo9j0tLw0AUhQdRMFbBnQs3BddJ752ZzGMp8QmtLqrrIZm5Ay3WxEyy8N-b0uLqwuE75_IxdoNQIIJdrNYFB7QFN1ZBKU5YhlboXKKVpywDLSHXsrTn7CKlLQCUKCBj1w8tpflbO8yrdteNA12ys1h_Jbo63hn7fHr8qF7y5fvza3W_zD2XYsgRSYdQUogq1j400XMSMRojyynXJgivhKeaewRC7WUDDaegTPCag1Rixu4Ou13f_oyUBrdtx_57euk4x8lIG15O1OJA-b5Nqafoun6zq_tfh-D22m61dnttd9SeGreHxoaI_mmjrACjxB_4xVGG</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2211107825</pqid></control><display><type>article</type><title>Does Not Compute</title><source>IEEE Electronic Library (IEL)</source><creator>Holzmann, Gerard J.</creator><creatorcontrib>Holzmann, Gerard J.</creatorcontrib><description>Most of us who work with software know all too well how easy it is to make small mistakes that escape detection in tests and come back to haunt us later. Unfortunately, when you study formal software verification techniques, one of the first things you learn is that a foolproof method for analyzing your code to reliably prevent these types of unpleasantries does not exist. Worse, you learn that it cannot exist. Although you may not remember a proof, you?ve certainly heard of the halting problem. Alan Turing already showed in 1936 that there cannot be an algorithm that can decisively show whether an arbitrary program will terminate on a given input or not.</description><identifier>ISSN: 0740-7459</identifier><identifier>EISSN: 1937-4194</identifier><identifier>DOI: 10.1109/MS.2019.2896053</identifier><identifier>CODEN: IESOEG</identifier><language>eng</language><publisher>Los Alamitos: IEEE</publisher><subject>Algorithms ; Computational modeling ; Encoding ; Memory management ; Program verification (computers) ; Software development management ; Software engineering ; Software reliability ; System verification</subject><ispartof>IEEE software, 2019-05, Vol.36 (3), p.14-16</ispartof><rights>Copyright IEEE Computer Society 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c243t-11e7dd5edf6facdbfc2e3ff88457dd78d3c63cea2c10e17c4b0b2ed68dc720463</cites><orcidid>0000-0001-9207-4370</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8693086$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8693086$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Holzmann, Gerard J.</creatorcontrib><title>Does Not Compute</title><title>IEEE software</title><addtitle>S-M</addtitle><description>Most of us who work with software know all too well how easy it is to make small mistakes that escape detection in tests and come back to haunt us later. Unfortunately, when you study formal software verification techniques, one of the first things you learn is that a foolproof method for analyzing your code to reliably prevent these types of unpleasantries does not exist. Worse, you learn that it cannot exist. Although you may not remember a proof, you?ve certainly heard of the halting problem. Alan Turing already showed in 1936 that there cannot be an algorithm that can decisively show whether an arbitrary program will terminate on a given input or not.</description><subject>Algorithms</subject><subject>Computational modeling</subject><subject>Encoding</subject><subject>Memory management</subject><subject>Program verification (computers)</subject><subject>Software development management</subject><subject>Software engineering</subject><subject>Software reliability</subject><subject>System verification</subject><issn>0740-7459</issn><issn>1937-4194</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9j0tLw0AUhQdRMFbBnQs3BddJ752ZzGMp8QmtLqrrIZm5Ay3WxEyy8N-b0uLqwuE75_IxdoNQIIJdrNYFB7QFN1ZBKU5YhlboXKKVpywDLSHXsrTn7CKlLQCUKCBj1w8tpflbO8yrdteNA12ys1h_Jbo63hn7fHr8qF7y5fvza3W_zD2XYsgRSYdQUogq1j400XMSMRojyynXJgivhKeaewRC7WUDDaegTPCag1Rixu4Ou13f_oyUBrdtx_57euk4x8lIG15O1OJA-b5Nqafoun6zq_tfh-D22m61dnttd9SeGreHxoaI_mmjrACjxB_4xVGG</recordid><startdate>20190501</startdate><enddate>20190501</enddate><creator>Holzmann, Gerard J.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><orcidid>https://orcid.org/0000-0001-9207-4370</orcidid></search><sort><creationdate>20190501</creationdate><title>Does Not Compute</title><author>Holzmann, Gerard J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c243t-11e7dd5edf6facdbfc2e3ff88457dd78d3c63cea2c10e17c4b0b2ed68dc720463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Computational modeling</topic><topic>Encoding</topic><topic>Memory management</topic><topic>Program verification (computers)</topic><topic>Software development management</topic><topic>Software engineering</topic><topic>Software reliability</topic><topic>System verification</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Holzmann, Gerard J.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>IEEE software</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Holzmann, Gerard J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Does Not Compute</atitle><jtitle>IEEE software</jtitle><stitle>S-M</stitle><date>2019-05-01</date><risdate>2019</risdate><volume>36</volume><issue>3</issue><spage>14</spage><epage>16</epage><pages>14-16</pages><issn>0740-7459</issn><eissn>1937-4194</eissn><coden>IESOEG</coden><abstract>Most of us who work with software know all too well how easy it is to make small mistakes that escape detection in tests and come back to haunt us later. Unfortunately, when you study formal software verification techniques, one of the first things you learn is that a foolproof method for analyzing your code to reliably prevent these types of unpleasantries does not exist. Worse, you learn that it cannot exist. Although you may not remember a proof, you?ve certainly heard of the halting problem. Alan Turing already showed in 1936 that there cannot be an algorithm that can decisively show whether an arbitrary program will terminate on a given input or not.</abstract><cop>Los Alamitos</cop><pub>IEEE</pub><doi>10.1109/MS.2019.2896053</doi><tpages>3</tpages><orcidid>https://orcid.org/0000-0001-9207-4370</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0740-7459 |
| ispartof | IEEE software, 2019-05, Vol.36 (3), p.14-16 |
| issn | 0740-7459 1937-4194 |
| language | eng |
| recordid | cdi_ieee_primary_8693086 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Computational modeling Encoding Memory management Program verification (computers) Software development management Software engineering Software reliability System verification |
| title | Does Not Compute |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T00%3A45%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Does%20Not%20Compute&rft.jtitle=IEEE%20software&rft.au=Holzmann,%20Gerard%20J.&rft.date=2019-05-01&rft.volume=36&rft.issue=3&rft.spage=14&rft.epage=16&rft.pages=14-16&rft.issn=0740-7459&rft.eissn=1937-4194&rft.coden=IESOEG&rft_id=info:doi/10.1109/MS.2019.2896053&rft_dat=%3Cproquest_RIE%3E2211107825%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2211107825&rft_id=info:pmid/&rft_ieee_id=8693086&rfr_iscdi=true |