talt - Toward a Foundational Typed Assembly Language Karl...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Toward a Foundational Typed Assembly Language Karl Crary Carnegie Mellon University Abstract We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also im- plements the von Neumann model in which programs are stored in memory, and supports relative addressing. Type safety for execution and for garbage collection are shown by machine-checkable proofs. TALT is the first formalized typed assembly language to provide any of these features. Categories and Subject Descriptors D.3 [ Programming Languages ]: Language Constructs and Features; F.3.1 [ Logics and Meanings of Programs ]: Specifying and Verifying and Reasoning about Programs. General Terms Languages, Security, Verification Keywords Typed assembly language, proof-carrying code 1 Introduction The proliferation of low-cost computing hardware and the ubiquity of the Internet has created a situation where a huge amount of computing power is both idle andin principle accessible to developers. The goal of exploiting these idle computational resources has existed for years, and, begin- ning with SETI@Home [28] in 1997, a handful of projects have successfully made profitable use of idle computational resources on the Internet. More recently, this paradigm, now called grid computing, has elicited serious interest among academics [5, 16] and in industry as a general means of con- ducting low-cost supercomputing. This material is based on work supported in part by NSF grants CCR- 9984812 and CCR-0121633. Any opinions, findings, and conclusions or recommendations in this publication are those of the authors and do not reflect the views of this agency. 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. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. POPL03, January 1517, 2002, New Orleans, Louisiana, USA. Copyright 2002 ACM 1-58113-628-5/03/0001 ...$5.00 Despite the increasing interest in grid computing, a re- maining obstacle to its growth is the (understandable) reluc- tance of computer owners to download and execute software from developers they do not know or trust, and may not have even heard of. This has limited the practical use of grid computing to the small number of potential users that have been able to obtain the trust of thousands of computer owners they do not know. The ConCert project at CMU [9] is seeking to overcome this obstacle by developing a system for trustless dissemi- nation of software. In the ConCert framework, a machine owner installs a steward program that ensures the safety of any downloaded software. When a new grid application is obtained for execution (other parts of the ConCert frame-...
View Full Document

Page1 / 15

talt - Toward a Foundational Typed Assembly Language Karl...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online