What Are Polymorphically-Typed Ambients?

OpenBU

Show simple item record

dc.contributor.author Amtoft, Torben en_US
dc.contributor.author Kfoury, Assaf J. en_US
dc.contributor.author Pericas-Geertsen, Santiago M. en_US
dc.date.accessioned 2011-10-20T05:10:26Z
dc.date.available 2011-10-20T05:10:26Z
dc.date.issued 2000-10-19 en_US
dc.identifier.uri http://hdl.handle.net/2144/1814
dc.description.abstract Abstract: The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. We consider an Ambient Calculus where ambients transport and exchange programs rather that just inert data. We propose different senses in which such a calculus can be said to be polymorphically typed, and design accordingly a polymorphic type system for it. Our type system assigns types to embedded programs and what we call behaviors to processes; a denotational semantics of behaviors is then proposed, here called trace semantics, underlying much of the remaining analysis. We state and prove a Subject Reduction property for our polymorphically typed calculus. Based on techniques borrowed from finite automata theory, type-checking of fully type-annotated processes is shown to be decidable; the time complexity of our decision procedure is exponential (this is a worst-case in theory, arguably not encountered in practice). Our polymorphically-typed calculus is a conservative extension of the typed Ambient Calculus originally proposed by Cardelli and Gordon. en_US
dc.language.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-2000-021 en_US
dc.title What Are Polymorphically-Typed Ambients? en_US
dc.type Technical Report en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Advanced Search

Browse

Deposit Materials