%0 Journal Article %1 Clements:2004:TMS %A Clements, John %A Felleisen, Matthias %C New York, NY, USA %D 2004 %I ACM %J ACM Trans. Program. Lang. Syst. %K CLR JVM Security Stack TailCalls inspection %N 6 %P 1029--1052 %R 10.1145/1034774.1034778 %T A Tail-Recursive Machine with Stack Inspection %V 26 %X 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.

@article{Clements:2004:TMS, abstract = {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.}, acmid = {1034778}, added-at = {2012-09-28T12:51:15.000+0200}, address = {New York, NY, USA}, author = {Clements, John and Felleisen, Matthias}, biburl = {https://www.bibsonomy.org/bibtex/2d40ca80f49fff43ea003a73691526739/gron}, description = {A tail-recursive machine with stack inspection}, doi = {10.1145/1034774.1034778}, interhash = {f36c272783546136403f8d9c129dd865}, intrahash = {d40ca80f49fff43ea003a73691526739}, issn = {0164-0925}, issue_date = {November 2004}, journal = {ACM Trans. Program. Lang. Syst.}, keywords = {CLR JVM Security Stack TailCalls inspection}, month = {November}, number = 6, numpages = {24}, pages = {1029--1052}, publisher = {ACM}, timestamp = {2013-07-27T10:44:26.000+0200}, title = {A Tail-Recursive Machine with Stack Inspection}, volume = 26, year = 2004 }