Precise type analysis by abstract interpretation:
Abstract: "Type analysis is the key for improving the efficiency of untyped object-oriented programs with dynamic method binding by replacing costly 'late' by the more efficient 'early' binding. The precision of type analysis and hence the runtime gain achievable depends abo...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1996
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1996,19 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Type analysis is the key for improving the efficiency of untyped object-oriented programs with dynamic method binding by replacing costly 'late' by the more efficient 'early' binding. The precision of type analysis and hence the runtime gain achievable depends above all on the treatment of method calls, program branches, and assignments. A monomorphic, monovariant, and non-deterministic treatment of method calls and program branches, and a non-destructive treatment of assignments are major sources introducing imprecision. In this article we present a new type analysis based on abstract interpretation, which systematically addresses and overcomes these problems. The new type analysis is unique for treating method calls polymorphically and polyvariantly, program branches and method sends almost deterministically, and assignments destructively. Above all, it is the almost deterministic treatment of program branches and method sends which makes our approach exceptional, and lets it improve on all previous related approaches to type analysis." |
| Beschreibung: | 26, 5 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011190006 | ||
| 003 | DE-604 | ||
| 005 | 19970407 | ||
| 007 | t | ||
| 008 | 970206s1996 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)38179122 | ||
| 035 | |a (DE-599)BVBBV011190006 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-384 |a DE-634 | ||
| 084 | |a SS 5600 |0 (DE-625)143571: |2 rvk | ||
| 100 | 1 | |a Knoop, Jens |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Precise type analysis by abstract interpretation |c Jens Knoop ; Wolfgang Golubski |
| 264 | 1 | |a Passau |c 1996 | |
| 300 | |a 26, 5 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1996,19 | |
| 520 | 3 | |a Abstract: "Type analysis is the key for improving the efficiency of untyped object-oriented programs with dynamic method binding by replacing costly 'late' by the more efficient 'early' binding. The precision of type analysis and hence the runtime gain achievable depends above all on the treatment of method calls, program branches, and assignments. A monomorphic, monovariant, and non-deterministic treatment of method calls and program branches, and a non-destructive treatment of assignments are major sources introducing imprecision. In this article we present a new type analysis based on abstract interpretation, which systematically addresses and overcomes these problems. The new type analysis is unique for treating method calls polymorphically and polyvariantly, program branches and method sends almost deterministically, and assignments destructively. Above all, it is the almost deterministic treatment of program branches and method sends which makes our approach exceptional, and lets it improve on all previous related approaches to type analysis." | |
| 650 | 4 | |a Data flow computing | |
| 650 | 4 | |a Object-oriented programming (Computer science) | |
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Golubski, Wolfgang |e Verfasser |4 aut | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1996,19 |w (DE-604)BV000905393 |9 1996,19 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007504607 | ||
Datensatz im Suchindex
| _version_ | 1804125686071296000 |
|---|---|
| any_adam_object | |
| author | Knoop, Jens Golubski, Wolfgang |
| author_facet | Knoop, Jens Golubski, Wolfgang |
| author_role | aut aut |
| author_sort | Knoop, Jens |
| author_variant | j k jk w g wg |
| building | Verbundindex |
| bvnumber | BV011190006 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)38179122 (DE-599)BVBBV011190006 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02637nam a2200421 cb4500</leader><controlfield tag="001">BV011190006</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970407 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970206s1996 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38179122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011190006</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5600</subfield><subfield code="0">(DE-625)143571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Knoop, Jens</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Precise type analysis by abstract interpretation</subfield><subfield code="c">Jens Knoop ; Wolfgang Golubski</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26, 5 S.</subfield><subfield code="b">graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1996,19</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Type analysis is the key for improving the efficiency of untyped object-oriented programs with dynamic method binding by replacing costly 'late' by the more efficient 'early' binding. The precision of type analysis and hence the runtime gain achievable depends above all on the treatment of method calls, program branches, and assignments. A monomorphic, monovariant, and non-deterministic treatment of method calls and program branches, and a non-destructive treatment of assignments are major sources introducing imprecision. In this article we present a new type analysis based on abstract interpretation, which systematically addresses and overcomes these problems. The new type analysis is unique for treating method calls polymorphically and polyvariantly, program branches and method sends almost deterministically, and assignments destructively. Above all, it is the almost deterministic treatment of program branches and method sends which makes our approach exceptional, and lets it improve on all previous related approaches to type analysis."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data flow computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Object-oriented programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Golubski, Wolfgang</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1996,19</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1996,19</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007504607</subfield></datafield></record></collection> |
| id | DE-604.BV011190006 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:05:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007504607 |
| oclc_num | 38179122 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-384 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-384 DE-634 |
| physical | 26, 5 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Knoop, Jens Verfasser aut Precise type analysis by abstract interpretation Jens Knoop ; Wolfgang Golubski Passau 1996 26, 5 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1996,19 Abstract: "Type analysis is the key for improving the efficiency of untyped object-oriented programs with dynamic method binding by replacing costly 'late' by the more efficient 'early' binding. The precision of type analysis and hence the runtime gain achievable depends above all on the treatment of method calls, program branches, and assignments. A monomorphic, monovariant, and non-deterministic treatment of method calls and program branches, and a non-destructive treatment of assignments are major sources introducing imprecision. In this article we present a new type analysis based on abstract interpretation, which systematically addresses and overcomes these problems. The new type analysis is unique for treating method calls polymorphically and polyvariantly, program branches and method sends almost deterministically, and assignments destructively. Above all, it is the almost deterministic treatment of program branches and method sends which makes our approach exceptional, and lets it improve on all previous related approaches to type analysis." Data flow computing Object-oriented programming (Computer science) Programming languages (Electronic computers) Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Golubski, Wolfgang Verfasser aut Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1996,19 (DE-604)BV000905393 1996,19 |
| spellingShingle | Knoop, Jens Golubski, Wolfgang Precise type analysis by abstract interpretation Data flow computing Object-oriented programming (Computer science) Programming languages (Electronic computers) Theoretische Informatik (DE-588)4196735-5 gnd Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4037944-9 (DE-588)4026894-9 |
| title | Precise type analysis by abstract interpretation |
| title_auth | Precise type analysis by abstract interpretation |
| title_exact_search | Precise type analysis by abstract interpretation |
| title_full | Precise type analysis by abstract interpretation Jens Knoop ; Wolfgang Golubski |
| title_fullStr | Precise type analysis by abstract interpretation Jens Knoop ; Wolfgang Golubski |
| title_full_unstemmed | Precise type analysis by abstract interpretation Jens Knoop ; Wolfgang Golubski |
| title_short | Precise type analysis by abstract interpretation |
| title_sort | precise type analysis by abstract interpretation |
| topic | Data flow computing Object-oriented programming (Computer science) Programming languages (Electronic computers) Theoretische Informatik (DE-588)4196735-5 gnd Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Data flow computing Object-oriented programming (Computer science) Programming languages (Electronic computers) Theoretische Informatik Mathematik Informatik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT knoopjens precisetypeanalysisbyabstractinterpretation AT golubskiwolfgang precisetypeanalysisbyabstractinterpretation |