Path-oriented program analysis:
This book presents a unique method for decomposing a computer program along its execution paths, for simplifying the subprograms so produced, and for recomposing a program from its subprograms. This method enables us to divide and conquer the complexity involved in understanding the computation perf...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2008
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | This book presents a unique method for decomposing a computer program along its execution paths, for simplifying the subprograms so produced, and for recomposing a program from its subprograms. This method enables us to divide and conquer the complexity involved in understanding the computation performed by a program by decomposing it into a set of subprograms and then simplifying them to the furthest extent possible. The resulting simplified subprograms are generally more understandable than the original program as a whole. The method may also be used to simplify a piece of source code by following the path-oriented method of decomposition, simplification, and recomposition. The analysis may be carried out in such a way that the derivation of the analysis result constitutes a correctness proof. The method can be applied to any source code (or portion thereof) that prescribes the computation to be performed in terms of assignment statements, conditional statements, and loop constructs, regardless of the language or paradigm used |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xii, 196 pages) |
| ISBN: | 9780511546990 |
| DOI: | 10.1017/CBO9780511546990 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043945409 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2008 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511546990 |c Online |9 978-0-511-54699-0 | ||
| 024 | 7 | |a 10.1017/CBO9780511546990 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511546990 | ||
| 035 | |a (OCoLC)967780403 | ||
| 035 | |a (DE-599)BVBBV043945409 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a ST 233 |0 (DE-625)143620: |2 rvk | ||
| 100 | 1 | |a Huang, J. C. |d 1935- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Path-oriented program analysis |c J.C. Huang |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2008 | |
| 300 | |a 1 online resource (xii, 196 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a State constraints -- Subprogram simplification -- Program set -- Pathwise decomposition -- Tautological constraints -- Program recomposition -- Discussion -- Automatic generation of symbolic traces | |
| 520 | |a This book presents a unique method for decomposing a computer program along its execution paths, for simplifying the subprograms so produced, and for recomposing a program from its subprograms. This method enables us to divide and conquer the complexity involved in understanding the computation performed by a program by decomposing it into a set of subprograms and then simplifying them to the furthest extent possible. The resulting simplified subprograms are generally more understandable than the original program as a whole. The method may also be used to simplify a piece of source code by following the path-oriented method of decomposition, simplification, and recomposition. The analysis may be carried out in such a way that the derivation of the analysis result constitutes a correctness proof. The method can be applied to any source code (or portion thereof) that prescribes the computation to be performed in terms of assignment statements, conditional statements, and loop constructs, regardless of the language or paradigm used | ||
| 650 | 4 | |a Computer software / Development | |
| 650 | 4 | |a Computer software / Development / Computer programs | |
| 650 | 0 | 7 | |a Programmanalyse |0 (DE-588)4175841-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Programmanalyse |0 (DE-588)4175841-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-88286-6 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511546990 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029354380 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511546990 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511546990 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176891585757184 |
|---|---|
| any_adam_object | |
| author | Huang, J. C. 1935- |
| author_facet | Huang, J. C. 1935- |
| author_role | aut |
| author_sort | Huang, J. C. 1935- |
| author_variant | j c h jc jch |
| building | Verbundindex |
| bvnumber | BV043945409 |
| classification_rvk | ST 233 |
| collection | ZDB-20-CBO |
| contents | State constraints -- Subprogram simplification -- Program set -- Pathwise decomposition -- Tautological constraints -- Program recomposition -- Discussion -- Automatic generation of symbolic traces |
| ctrlnum | (ZDB-20-CBO)CR9780511546990 (OCoLC)967780403 (DE-599)BVBBV043945409 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9780511546990 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03040nmm a2200469zc 4500</leader><controlfield tag="001">BV043945409</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2008 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511546990</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-54699-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511546990</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511546990</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967780403</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043945409</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 233</subfield><subfield code="0">(DE-625)143620:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Huang, J. C.</subfield><subfield code="d">1935-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Path-oriented program analysis</subfield><subfield code="c">J.C. Huang</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 196 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">State constraints -- Subprogram simplification -- Program set -- Pathwise decomposition -- Tautological constraints -- Program recomposition -- Discussion -- Automatic generation of symbolic traces</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents a unique method for decomposing a computer program along its execution paths, for simplifying the subprograms so produced, and for recomposing a program from its subprograms. This method enables us to divide and conquer the complexity involved in understanding the computation performed by a program by decomposing it into a set of subprograms and then simplifying them to the furthest extent possible. The resulting simplified subprograms are generally more understandable than the original program as a whole. The method may also be used to simplify a piece of source code by following the path-oriented method of decomposition, simplification, and recomposition. The analysis may be carried out in such a way that the derivation of the analysis result constitutes a correctness proof. The method can be applied to any source code (or portion thereof) that prescribes the computation to be performed in terms of assignment statements, conditional statements, and loop constructs, regardless of the language or paradigm used</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software / Development</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software / Development / Computer programs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-88286-6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511546990</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029354380</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511546990</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511546990</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043945409 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:23Z |
| institution | BVB |
| isbn | 9780511546990 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029354380 |
| oclc_num | 967780403 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xii, 196 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Huang, J. C. 1935- Verfasser aut Path-oriented program analysis J.C. Huang Cambridge Cambridge University Press 2008 1 online resource (xii, 196 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) State constraints -- Subprogram simplification -- Program set -- Pathwise decomposition -- Tautological constraints -- Program recomposition -- Discussion -- Automatic generation of symbolic traces This book presents a unique method for decomposing a computer program along its execution paths, for simplifying the subprograms so produced, and for recomposing a program from its subprograms. This method enables us to divide and conquer the complexity involved in understanding the computation performed by a program by decomposing it into a set of subprograms and then simplifying them to the furthest extent possible. The resulting simplified subprograms are generally more understandable than the original program as a whole. The method may also be used to simplify a piece of source code by following the path-oriented method of decomposition, simplification, and recomposition. The analysis may be carried out in such a way that the derivation of the analysis result constitutes a correctness proof. The method can be applied to any source code (or portion thereof) that prescribes the computation to be performed in terms of assignment statements, conditional statements, and loop constructs, regardless of the language or paradigm used Computer software / Development Computer software / Development / Computer programs Programmanalyse (DE-588)4175841-9 gnd rswk-swf Programmanalyse (DE-588)4175841-9 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-88286-6 https://doi.org/10.1017/CBO9780511546990 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Huang, J. C. 1935- Path-oriented program analysis State constraints -- Subprogram simplification -- Program set -- Pathwise decomposition -- Tautological constraints -- Program recomposition -- Discussion -- Automatic generation of symbolic traces Computer software / Development Computer software / Development / Computer programs Programmanalyse (DE-588)4175841-9 gnd |
| subject_GND | (DE-588)4175841-9 |
| title | Path-oriented program analysis |
| title_auth | Path-oriented program analysis |
| title_exact_search | Path-oriented program analysis |
| title_full | Path-oriented program analysis J.C. Huang |
| title_fullStr | Path-oriented program analysis J.C. Huang |
| title_full_unstemmed | Path-oriented program analysis J.C. Huang |
| title_short | Path-oriented program analysis |
| title_sort | path oriented program analysis |
| topic | Computer software / Development Computer software / Development / Computer programs Programmanalyse (DE-588)4175841-9 gnd |
| topic_facet | Computer software / Development Computer software / Development / Computer programs Programmanalyse |
| url | https://doi.org/10.1017/CBO9780511546990 |
| work_keys_str_mv | AT huangjc pathorientedprogramanalysis |