Computation of aliases and support sets:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
763 |
| Schlagwörter: | |
| Abstract: | When programs are intended for parallel execution it becomes critical to determine whether the evaluations of two expressions can be carried out independently. We provide a scheme for making such determinations in a language with higher order constructs and imperative features. The heart of our scheme is a mechanism for computing the support of an expression, i.e. the set of global variables involved in its evaluation. This computation requires knowledge of all the aliases of an expression. The inference schemes are presented as abstract semantic interpretations. We prove the soundness of our estimates by establishing a correspondence between the abstract semantics and the standard semantics of the programming language. |
| Umfang: | 38 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594832 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 960201s1986 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)15994354 | ||
| 035 | |a (DE-599)BVBBV010594832 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Neirynck, Anne |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computation of aliases and support sets |c Anne Neirynck ; Prakash Panagaden ; Alan J. Demers |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 38 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 763 | |
| 520 | 3 | |a When programs are intended for parallel execution it becomes critical to determine whether the evaluations of two expressions can be carried out independently. We provide a scheme for making such determinations in a language with higher order constructs and imperative features. The heart of our scheme is a mechanism for computing the support of an expression, i.e. the set of global variables involved in its evaluation. This computation requires knowledge of all the aliases of an expression. The inference schemes are presented as abstract semantic interpretations. We prove the soundness of our estimates by establishing a correspondence between the abstract semantics and the standard semantics of the programming language. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Programming languages (Electronic computers) |x Semantics | |
| 700 | 1 | |a Panagaden, Prakash |e Verfasser |4 aut | |
| 700 | 1 | |a Demers, Alan J. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 763 |w (DE-604)BV006185504 |9 763 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007065395 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6052-763 |
|---|---|
| DE-BY-TUM_katkey | 668440 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010108235 |
| _version_ | 1821931009593049090 |
| any_adam_object | |
| author | Neirynck, Anne Panagaden, Prakash Demers, Alan J. |
| author_facet | Neirynck, Anne Panagaden, Prakash Demers, Alan J. |
| author_role | aut aut aut |
| author_sort | Neirynck, Anne |
| author_variant | a n an p p pp a j d aj ajd |
| building | Verbundindex |
| bvnumber | BV010594832 |
| ctrlnum | (OCoLC)15994354 (DE-599)BVBBV010594832 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01912nam a2200337 cb4500</leader><controlfield tag="001">BV010594832</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960201s1986 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15994354</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594832</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Neirynck, Anne</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computation of aliases and support sets</subfield><subfield code="c">Anne Neirynck ; Prakash Panagaden ; Alan J. Demers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 S.</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">763</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">When programs are intended for parallel execution it becomes critical to determine whether the evaluations of two expressions can be carried out independently. We provide a scheme for making such determinations in a language with higher order constructs and imperative features. The heart of our scheme is a mechanism for computing the support of an expression, i.e. the set of global variables involved in its evaluation. This computation requires knowledge of all the aliases of an expression. The inference schemes are presented as abstract semantic interpretations. We prove the soundness of our estimates by establishing a correspondence between the abstract semantics and the standard semantics of the programming language.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="x">Semantics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Panagaden, Prakash</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Demers, Alan J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">763</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">763</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007065395</subfield></datafield></record></collection> |
| id | DE-604.BV010594832 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:57:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007065395 |
| oclc_num | 15994354 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 38 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spellingShingle | Neirynck, Anne Panagaden, Prakash Demers, Alan J. Computation of aliases and support sets Algorithms Parallel processing (Electronic computers) Programming languages (Electronic computers) Semantics |
| title | Computation of aliases and support sets |
| title_auth | Computation of aliases and support sets |
| title_exact_search | Computation of aliases and support sets |
| title_full | Computation of aliases and support sets Anne Neirynck ; Prakash Panagaden ; Alan J. Demers |
| title_fullStr | Computation of aliases and support sets Anne Neirynck ; Prakash Panagaden ; Alan J. Demers |
| title_full_unstemmed | Computation of aliases and support sets Anne Neirynck ; Prakash Panagaden ; Alan J. Demers |
| title_short | Computation of aliases and support sets |
| title_sort | computation of aliases and support sets |
| topic | Algorithms Parallel processing (Electronic computers) Programming languages (Electronic computers) Semantics |
| topic_facet | Algorithms Parallel processing (Electronic computers) Programming languages (Electronic computers) Semantics |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT neirynckanne computationofaliasesandsupportsets AT panagadenprakash computationofaliasesandsupportsets AT demersalanj computationofaliasesandsupportsets |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6052-763
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |