An elementary and unified approach to program correctness
We present through the algorithmic language DHL (Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra’s iterative style of programming with Hehner’s recursive predicative programming theory, getting the “best of the...
Gespeichert in:
| Veröffentlicht in: | Formal aspects of computing 2010-09, Vol.22 (5), p.611-627 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 627 |
|---|---|
| container_issue | 5 |
| container_start_page | 611 |
| container_title | Formal aspects of computing |
| container_volume | 22 |
| creator | Bohorquez V, Jaime A |
| description | We present through the algorithmic language
DHL
(Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra’s iterative style of programming with Hehner’s recursive
predicative programming
theory, getting the “best of the two worlds” and without having to recur in any way to higher-order approaches such as predicate transformers, Hoare logic, fixed-point or relational theory. |
| doi_str_mv | 10.1007/s00165-009-0137-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_818836121</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2134902791</sourcerecordid><originalsourceid>FETCH-LOGICAL-c342t-4eb9445e544f3822a331948073c557aea0e6c0777d0fef55d6b4f81f133f85f3</originalsourceid><addsrcrecordid>eNp1kE9LxDAUxIMouK5-AG_Fi6fqS5M0yXFZ_AcLXvbgLWTTl7VLm65Je_DbG6kgCJ7eO_xmmBlCrincUQB5nwBoLUoAXQJlsuQnZEE5Y2Wl9dspWYBmvBTA2Tm5SOmQaaEpXRC9CgV22GMYbfwsbGiKKbS-xaawx2McrHsvxqHI3z7avnBDjOjGgCldkjNvu4RXP3dJto8P2_VzuXl9elmvNqVjvBpLjjvNuUDBuWeqqixjVHMFkjkhpEULWDuQUjbg0QvR1DvuFfWUMa-EZ0tyO9vmCB8TptH0bXLYdTbgMCWjqFKsphXN5M0f8jBMMeRsRorcF7jSGaIz5OKQUkRvjrHtc3VDwXwvaeYlTV7SfC9peNZUsyZlNuwx_hr_L_oC94B0lg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>750150489</pqid></control><display><type>article</type><title>An elementary and unified approach to program correctness</title><source>SpringerNature Complete Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Bohorquez V, Jaime A</creator><creatorcontrib>Bohorquez V, Jaime A</creatorcontrib><description>We present through the algorithmic language
DHL
(Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra’s iterative style of programming with Hehner’s recursive
predicative programming
theory, getting the “best of the two worlds” and without having to recur in any way to higher-order approaches such as predicate transformers, Hoare logic, fixed-point or relational theory.</description><identifier>ISSN: 0934-5043</identifier><identifier>EISSN: 1433-299X</identifier><identifier>DOI: 10.1007/s00165-009-0137-4</identifier><identifier>CODEN: FACME5</identifier><language>eng</language><publisher>London: Springer-Verlag</publisher><subject>Algorithms ; Computation ; Computer Science ; Iterative methods ; Logic ; Math Applications in Computer Science ; Mathematical analysis ; Original Article ; Programming ; Recursive ; Theory of Computation ; Transformers</subject><ispartof>Formal aspects of computing, 2010-09, Vol.22 (5), p.611-627</ispartof><rights>British Computer Society 2009</rights><rights>British Computer Society 2010</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c342t-4eb9445e544f3822a331948073c557aea0e6c0777d0fef55d6b4f81f133f85f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00165-009-0137-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00165-009-0137-4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Bohorquez V, Jaime A</creatorcontrib><title>An elementary and unified approach to program correctness</title><title>Formal aspects of computing</title><addtitle>Form Asp Comp</addtitle><description>We present through the algorithmic language
DHL
(Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra’s iterative style of programming with Hehner’s recursive
predicative programming
theory, getting the “best of the two worlds” and without having to recur in any way to higher-order approaches such as predicate transformers, Hoare logic, fixed-point or relational theory.</description><subject>Algorithms</subject><subject>Computation</subject><subject>Computer Science</subject><subject>Iterative methods</subject><subject>Logic</subject><subject>Math Applications in Computer Science</subject><subject>Mathematical analysis</subject><subject>Original Article</subject><subject>Programming</subject><subject>Recursive</subject><subject>Theory of Computation</subject><subject>Transformers</subject><issn>0934-5043</issn><issn>1433-299X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE9LxDAUxIMouK5-AG_Fi6fqS5M0yXFZ_AcLXvbgLWTTl7VLm65Je_DbG6kgCJ7eO_xmmBlCrincUQB5nwBoLUoAXQJlsuQnZEE5Y2Wl9dspWYBmvBTA2Tm5SOmQaaEpXRC9CgV22GMYbfwsbGiKKbS-xaawx2McrHsvxqHI3z7avnBDjOjGgCldkjNvu4RXP3dJto8P2_VzuXl9elmvNqVjvBpLjjvNuUDBuWeqqixjVHMFkjkhpEULWDuQUjbg0QvR1DvuFfWUMa-EZ0tyO9vmCB8TptH0bXLYdTbgMCWjqFKsphXN5M0f8jBMMeRsRorcF7jSGaIz5OKQUkRvjrHtc3VDwXwvaeYlTV7SfC9peNZUsyZlNuwx_hr_L_oC94B0lg</recordid><startdate>20100901</startdate><enddate>20100901</enddate><creator>Bohorquez V, Jaime A</creator><general>Springer-Verlag</general><general>Association for Computing Machinery</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20100901</creationdate><title>An elementary and unified approach to program correctness</title><author>Bohorquez V, Jaime A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c342t-4eb9445e544f3822a331948073c557aea0e6c0777d0fef55d6b4f81f133f85f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Computation</topic><topic>Computer Science</topic><topic>Iterative methods</topic><topic>Logic</topic><topic>Math Applications in Computer Science</topic><topic>Mathematical analysis</topic><topic>Original Article</topic><topic>Programming</topic><topic>Recursive</topic><topic>Theory of Computation</topic><topic>Transformers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bohorquez V, Jaime A</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Formal aspects of computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bohorquez V, Jaime A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An elementary and unified approach to program correctness</atitle><jtitle>Formal aspects of computing</jtitle><stitle>Form Asp Comp</stitle><date>2010-09-01</date><risdate>2010</risdate><volume>22</volume><issue>5</issue><spage>611</spage><epage>627</epage><pages>611-627</pages><issn>0934-5043</issn><eissn>1433-299X</eissn><coden>FACME5</coden><abstract>We present through the algorithmic language
DHL
(Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra’s iterative style of programming with Hehner’s recursive
predicative programming
theory, getting the “best of the two worlds” and without having to recur in any way to higher-order approaches such as predicate transformers, Hoare logic, fixed-point or relational theory.</abstract><cop>London</cop><pub>Springer-Verlag</pub><doi>10.1007/s00165-009-0137-4</doi><tpages>17</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0934-5043 |
| ispartof | Formal aspects of computing, 2010-09, Vol.22 (5), p.611-627 |
| issn | 0934-5043 1433-299X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_818836121 |
| source | SpringerNature Complete Journals; EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithms Computation Computer Science Iterative methods Logic Math Applications in Computer Science Mathematical analysis Original Article Programming Recursive Theory of Computation Transformers |
| title | An elementary and unified approach to program correctness |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T13%3A20%3A56IST&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=An%20elementary%20and%20unified%20approach%20to%20program%20correctness&rft.jtitle=Formal%20aspects%20of%20computing&rft.au=Bohorquez%20V,%20Jaime%20A&rft.date=2010-09-01&rft.volume=22&rft.issue=5&rft.spage=611&rft.epage=627&rft.pages=611-627&rft.issn=0934-5043&rft.eissn=1433-299X&rft.coden=FACME5&rft_id=info:doi/10.1007/s00165-009-0137-4&rft_dat=%3Cproquest_cross%3E2134902791%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=750150489&rft_id=info:pmid/&rfr_iscdi=true |