Eintrag weiter verarbeiten
A tail-recursive machine with stack inspection
Gespeichert in:
| Zeitschriftentitel: | ACM Transactions on Programming Languages and Systems |
|---|---|
| Personen und Körperschaften: | , |
| In: | ACM Transactions on Programming Languages and Systems, 26, 2004, 6, S. 1029-1052 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Association for Computing Machinery (ACM)
|
| Schlagwörter: |
| author_facet |
Clements, John Felleisen, Matthias Clements, John Felleisen, Matthias |
|---|---|
| author |
Clements, John Felleisen, Matthias |
| spellingShingle |
Clements, John Felleisen, Matthias ACM Transactions on Programming Languages and Systems A tail-recursive machine with stack inspection Software |
| author_sort |
clements, john |
| spelling |
Clements, John Felleisen, Matthias 0164-0925 1558-4593 Association for Computing Machinery (ACM) Software http://dx.doi.org/10.1145/1034774.1034778 <jats:p>Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy; that an implementation of such a language must allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory-allocating construct) may nevertheless exhaust the available memory. In this article, we prove this widely held belief wrong. We exhibit an abstract machine for a language with security stack inspection whose space consumption function is equivalent to that of the canonical tail call optimizing abstract machine. Our machine is surprisingly simple and suggests that tail calls are as easy to implement in a security setting as they are in a conventional one.</jats:p> A tail-recursive machine with stack inspection ACM Transactions on Programming Languages and Systems |
| doi_str_mv |
10.1145/1034774.1034778 |
| facet_avail |
Online |
| finc_class_facet |
Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE0NS8xMDM0Nzc0LjEwMzQ3Nzg |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE0NS8xMDM0Nzc0LjEwMzQ3Nzg |
| institution |
DE-105 DE-14 DE-Ch1 DE-Zi4 DE-15 |
| imprint |
Association for Computing Machinery (ACM), 2004 |
| imprint_str_mv |
Association for Computing Machinery (ACM), 2004 |
| issn |
0164-0925 1558-4593 |
| issn_str_mv |
0164-0925 1558-4593 |
| language |
English |
| mega_collection |
Association for Computing Machinery (ACM) (CrossRef) |
| match_str |
clements2004atailrecursivemachinewithstackinspection |
| publishDateSort |
2004 |
| publisher |
Association for Computing Machinery (ACM) |
| recordtype |
ai |
| record_format |
ai |
| series |
ACM Transactions on Programming Languages and Systems |
| source_id |
49 |
| title |
A tail-recursive machine with stack inspection |
| title_unstemmed |
A tail-recursive machine with stack inspection |
| title_full |
A tail-recursive machine with stack inspection |
| title_fullStr |
A tail-recursive machine with stack inspection |
| title_full_unstemmed |
A tail-recursive machine with stack inspection |
| title_short |
A tail-recursive machine with stack inspection |
| title_sort |
a tail-recursive machine with stack inspection |
| topic |
Software |
| url |
http://dx.doi.org/10.1145/1034774.1034778 |
| publishDate |
2004 |
| physical |
1029-1052 |
| description |
<jats:p>Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy; that an implementation of such a language must allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory-allocating construct) may nevertheless exhaust the available memory. In this article, we prove this widely held belief wrong. We exhibit an abstract machine for a language with security stack inspection whose space consumption function is equivalent to that of the canonical tail call optimizing abstract machine. Our machine is surprisingly simple and suggests that tail calls are as easy to implement in a security setting as they are in a conventional one.</jats:p> |
| container_issue |
6 |
| container_start_page |
1029 |
| container_title |
ACM Transactions on Programming Languages and Systems |
| container_volume |
26 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792345547591385089 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T17:25:14.828Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=A+tail-recursive+machine+with+stack+inspection&rft.date=2004-11-01&genre=article&issn=1558-4593&volume=26&issue=6&spage=1029&epage=1052&pages=1029-1052&jtitle=ACM+Transactions+on+Programming+Languages+and+Systems&atitle=A+tail-recursive+machine+with+stack+inspection&aulast=Felleisen&aufirst=Matthias&rft_id=info%3Adoi%2F10.1145%2F1034774.1034778&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792345547591385089 |
| author | Clements, John, Felleisen, Matthias |
| author_facet | Clements, John, Felleisen, Matthias, Clements, John, Felleisen, Matthias |
| author_sort | clements, john |
| container_issue | 6 |
| container_start_page | 1029 |
| container_title | ACM Transactions on Programming Languages and Systems |
| container_volume | 26 |
| description | <jats:p>Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy; that an implementation of such a language must allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory-allocating construct) may nevertheless exhaust the available memory. In this article, we prove this widely held belief wrong. We exhibit an abstract machine for a language with security stack inspection whose space consumption function is equivalent to that of the canonical tail call optimizing abstract machine. Our machine is surprisingly simple and suggests that tail calls are as easy to implement in a security setting as they are in a conventional one.</jats:p> |
| doi_str_mv | 10.1145/1034774.1034778 |
| facet_avail | Online |
| finc_class_facet | Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE0NS8xMDM0Nzc0LjEwMzQ3Nzg |
| imprint | Association for Computing Machinery (ACM), 2004 |
| imprint_str_mv | Association for Computing Machinery (ACM), 2004 |
| institution | DE-105, DE-14, DE-Ch1, DE-Zi4, DE-15 |
| issn | 0164-0925, 1558-4593 |
| issn_str_mv | 0164-0925, 1558-4593 |
| language | English |
| last_indexed | 2024-03-01T17:25:14.828Z |
| match_str | clements2004atailrecursivemachinewithstackinspection |
| mega_collection | Association for Computing Machinery (ACM) (CrossRef) |
| physical | 1029-1052 |
| publishDate | 2004 |
| publishDateSort | 2004 |
| publisher | Association for Computing Machinery (ACM) |
| record_format | ai |
| recordtype | ai |
| series | ACM Transactions on Programming Languages and Systems |
| source_id | 49 |
| spelling | Clements, John Felleisen, Matthias 0164-0925 1558-4593 Association for Computing Machinery (ACM) Software http://dx.doi.org/10.1145/1034774.1034778 <jats:p>Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy; that an implementation of such a language must allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory-allocating construct) may nevertheless exhaust the available memory. In this article, we prove this widely held belief wrong. We exhibit an abstract machine for a language with security stack inspection whose space consumption function is equivalent to that of the canonical tail call optimizing abstract machine. Our machine is surprisingly simple and suggests that tail calls are as easy to implement in a security setting as they are in a conventional one.</jats:p> A tail-recursive machine with stack inspection ACM Transactions on Programming Languages and Systems |
| spellingShingle | Clements, John, Felleisen, Matthias, ACM Transactions on Programming Languages and Systems, A tail-recursive machine with stack inspection, Software |
| title | A tail-recursive machine with stack inspection |
| title_full | A tail-recursive machine with stack inspection |
| title_fullStr | A tail-recursive machine with stack inspection |
| title_full_unstemmed | A tail-recursive machine with stack inspection |
| title_short | A tail-recursive machine with stack inspection |
| title_sort | a tail-recursive machine with stack inspection |
| title_unstemmed | A tail-recursive machine with stack inspection |
| topic | Software |
| url | http://dx.doi.org/10.1145/1034774.1034778 |