article

SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form

Authors:

Wolfram Amme,

Niall Dalton,

Jeffery von Ronne,

Michael FranzAuthors Info & Claims

ACM SIGPLAN Notices, Volume 36, Issue 5

Pages 137 - 147

https://doi.org/10.1145/381694.378825

Published: 01 May 2001 Publication History

Get Access

References

[1]

B. Alpern, C. R. Attanasio, et al. The Jalapeno virtual machine. IBM System Journal, 39(1), February 2000.

Digital Library

Google Scholar

[2]

B. Alpern, A. Cocchi, D. Lieber, M. Mergen, and V. Sarkar. Jalapeno - a compiler-supported java virtual machine for servers. Workshop on Compiler Support for Software System (WCSSS 99), May 1999.

Google Scholar

[3]

W. Amme and E. Zehendner. Data dependence analysis in programs with pointers. Parallel Computing, 24(3-4):505-525, May 1998.

Digital Library

Google Scholar

[4]

Architecture Neutral Distribution Format (XANDF) Specification. Open Group Specification P527, January 1996.

Google Scholar

[5]

M. Arnold, S. Fink, et al. Adaptive optimization in the Jalapeno JVM. ACM OOPLSA 2000, 2000.

Digital Library

Google Scholar

[6]

M. M. Brandis and H. MSssenbSck. Single-pass generation of static single-assignment form for structured languages. ACM Trans. Prog. Lang. and Sys., 16(6):1684-1698, Nov. 1994.

Digital Library

Google Scholar

[7]

P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson. Practical improvements to the construction and destruction of static single assignment form. Software Practice and Experience, 28(8):859-881, July 1998.

Digital Library

Google Scholar

[8]

C. Click. Combining Analyses, Combining Optimizations. PhD thesis, Rice University, Houston, Texas.

Digital Library

Google Scholar

[9]

R. Crelier. OP2: A Portable Oberon Compiler. Technical Report 1990TR-125, Swiss Federal Institute of Technology, Zurich, Feb., 1990.

Google Scholar

[10]

R. Cytron, J. Ferrante, B. K. Rosen, M. K. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In POPL '89, 1989.

Digital Library

Google Scholar

[11]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Prog. Lang. and Sys., 13(4):451-490, Oct. 1990.

Digital Library

Google Scholar

[12]

A. Diwan, K. S. McKinley, and J. E. B. Moss. Type-based alias analysis. ACM SIGPLAN Notices, 33(5):106-117, May 1998.

Digital Library

Google Scholar

[13]

R. Fitzgerald, T. B. Knoblock, et al. Marmot: An optimizing compiler for Java. Microsoft Technical Report 3, Microsoft Research, March 2000.

Google Scholar

[14]

M. Franz and T. Kistler. Slim Binaries. Communications of the A CM, 40(12):87-94, Dec. 1997.

Digital Library

Google Scholar

[15]

S. Ghemawat, K. H. Randall, and D. J. Scales. Field analysis: Getting useful and low-cost interprocedural information. In PLDI '00, 2000.

Digital Library

Google Scholar

[16]

Sun Hotspot compiler for Java. http://java.sun.com/pro ducts/hotspot/.

Google Scholar

[17]

D. A. Huffman. A method for the construction of minimum redundancy codes. In Proceedings of the IRE, 40, pages 1098-1101, 1951.

Google Scholar

[18]

J. Hummel, A. Azevedo, D. Kolson, and A. Nicolau. Annotating the Java bytecodes in support of optimization. Concurrency: Practice and Experience, 9(11):1003-1016, Nov. 1997. Special Issue: Java for computational science and engineering -- simulation and modeling II.

Crossref

Google Scholar

[19]

T. Kistler. Continuous Program Optimization. Phd Dissertation, University of California, Irvine, 1999.

Digital Library

Google Scholar

[20]

T. Kistler and M. Franz. A Tree-Based alternative to Java byte-codes. International Journal of Parallel Programming, 27(1):21-34, Feb. 1999.

Digital Library

Google Scholar

[21]

T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a fiowgraph. ACM Trans. Prog. Lang. and Sys., 1(1):121-141, July 1979.

Digital Library

Google Scholar

[22]

G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to Typed Assembly Language. ACM Trans. Prog. Lang. and Sys., 23(3):528-569, May 1999.

Digital Library

Google Scholar

[23]

G. C. Necula. Proof-Carrying Code. In POPL '97, Paris, France, Jan. 1997.

Digital Library

Google Scholar

[24]

K. V. Nori, U. Ammann, et al. Pascal-P implementation notes. In D. W. Barton, editor, Pascal - The Language and its Implementation, pages 125-170. John Wiley and Sons, Ltd., 1981.

Google Scholar

[25]

M. Odersky and P. Wadler. Pizza into Java: Translating theory into practice. In Conference Record of POPL '97, pages 146-159, Paris, France, 15-17 Jan. 1997.

Digital Library

Google Scholar

[26]

M. Poletto and V. Sarkar. Linear scan register allocation. ACM Trans. Prog. Lang. and Sys., 21(5):895-913, September 1999.

Digital Library

Google Scholar

[27]

D. J. Scales, K. H. Randall, S. Ghemawat, and J. Dean. The Swift Java Compiler: Design and Implementation. WRL Research Report 2000/2, Compaq Research, April 2000.

Google Scholar

[28]

V. C. Sreedhar and G. R. Gao. A linear time algorithm for placing {phi}-nodes. In ACM, editor, Conference record of POPL '95, pages 62-73, New York, NY 10036, USA, 1995. ACM Press.

Digital Library

Google Scholar

[29]

R. F. Stark and J. Schmid. Java bytecode verification is not possible. Technical report, ETH Zurich, Nov. 2000.

Google Scholar

[30]

J. Wang, C. Eisenbeis, M. Jourdan, and B. Su. Decomposed software pipelining: A new perspective and a new approach. International Journal of Parallel Programming, 22(3):351-373, June 1994.

Digital Library

Google Scholar

Cited By

View all

Lewis MZuliani PSoudjani S(2024)Automated Verification of Silq Quantum Programs using SMT Solvers2024 IEEE International Conference on Quantum Software (QSW)10.1109/QSW62656.2024.00027(125-134)Online publication date: 7-Jul-2024
https://doi.org/10.1109/QSW62656.2024.00027
Hussain MSkillicorn D(2010)Securing Mobile-Agent Systems through CollaborationCollaborative Computer Security and Trust Management10.4018/978-1-60566-414-9.ch008(154-180)Online publication date: 2010
https://doi.org/10.4018/978-1-60566-414-9.ch008
Palsberg J(2010)Programming LanguagesThe Engineering Handbook, Second Edition10.1201/9781420039870.ch145Online publication date: 11-Jan-2010
https://doi.org/10.1201/9781420039870.ch145
Show More Cited By

Index Terms

SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Source code generation
    2. General programming languages
      1. Language types

Recommendations

Efficient online optimization by utilizing offline analysis and the safeTSA representation
PPPJ '02/IRE '02: Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002

Conventional mobile-code representations, e.g. Java bytecode, provide machine-independence and type-safety, but do so at the expense of performance. This performance hit can be taken in the form of decreased throughput or in increased latency. SafeTSA ...
SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form
PLDI '01: Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 36, Issue 5

May 2001

330 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/381694

Issue’s Table of Contents

PLDI '01: Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
June 2001
331 pages
ISBN:1581134142
DOI:10.1145/378795
Chairmen:
Michael Burke
IBM T.J. Watson Research Center
,
Mary Lou Soffa
Univ. of Pittsburgh

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2001

Published in SIGPLAN Volume 36, Issue 5

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
849
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)4

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lewis MZuliani PSoudjani S(2024)Automated Verification of Silq Quantum Programs using SMT Solvers2024 IEEE International Conference on Quantum Software (QSW)10.1109/QSW62656.2024.00027(125-134)Online publication date: 7-Jul-2024
https://doi.org/10.1109/QSW62656.2024.00027
Hussain MSkillicorn D(2010)Securing Mobile-Agent Systems through CollaborationCollaborative Computer Security and Trust Management10.4018/978-1-60566-414-9.ch008(154-180)Online publication date: 2010
https://doi.org/10.4018/978-1-60566-414-9.ch008
Palsberg J(2010)Programming LanguagesThe Engineering Handbook, Second Edition10.1201/9781420039870.ch145Online publication date: 11-Jan-2010
https://doi.org/10.1201/9781420039870.ch145
Zendra OJul EDucournau RGagnon EJones RKrintz CMulet PVitek J(2008)Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and SystemsObject-Oriented Technology. ECOOP 2007 Workshop Reader10.1007/978-3-540-78195-0_6(50-64)Online publication date: 2008
https://doi.org/10.1007/978-3-540-78195-0_6
Amme WMöller MAdler P(2007)Data Flow Analysis as a General Concept for the Transport of Verifiable Program AnnotationsElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2006.06.019176:3(97-108)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1016/j.entcs.2006.06.019
Ducournau RGagnon EKrintz CMulet PVitek JZendra O(2007)Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and SystemsObject-Oriented Technology. ECOOP 2006 Workshop Reader10.1007/978-3-540-71774-4_1(1-14)Online publication date: 2007
https://doi.org/10.1007/978-3-540-71774-4_1
Franz MChandra DGal AHaldar VProbst CReig FWang N(2005)A portable virtual machine target for proof-carrying codeScience of Computer Programming10.1016/j.scico.2004.09.00157:3(275-294)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1016/j.scico.2004.09.001
Gal AProbst CFranz M(2005)Structural Encoding of Static Single Assignment FormElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.02.045141:2(85-102)Online publication date: 1-Dec-2005
https://dl.acm.org/doi/10.1016/j.entcs.2005.02.045
Gal AProbst CFranz M(2005)Integrated Java Bytecode VerificationElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.01.020131(27-38)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1016/j.entcs.2005.01.020
(2005)BibliographyMobile Agents10.1016/B978-155860817-7/50012-X(401-418)Online publication date: 2005
https://doi.org/10.1016/B978-155860817-7/50012-X
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient online optimization by utilizing offline analysis and the safeTSA representation

SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form

Interprocedural pointer alias analysis