Space-aware ambients and processes

Authors:
Franco Barbanera;Michele Bugliesi;Mariangiola Dezani-Ciancaglini;Vladimiro Sassone
Affiliations:
Dipartimento di Matematica e Informatica, Università di Catania, Viale A. Doria, 6 I-95125 Catania, Italy;Dipartimento di Informatica, Università Ca Foscari, Via Torino 155, 30172 Venezia Mestre, Italy;Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10131 Torino, Italy;ECS, University of Southampton, UK
Venue:
Theoretical Computer Science
Year:
2007

Citing 25
Cited 3

Integer and combinatorial optimization

Integer and combinatorial optimization
The Omega test: a fast and practical integer programming algorithm for dependence analysis

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
On reduction-based process semantics

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Bisimulation for higher-order process calculi

Information and Computation
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource bound certification

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mobile ambients

Theoretical Computer Science
Types for access control

Theoretical Computer Science
Secure safe ambients

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The strength of non-size increasing computation

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource usage analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents

Information and Computation
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Static prediction of heap space usage for first-order functional programs

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite-Control Mobile Ambients

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
The Essence of Principal Typings

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Calculus of Mobile Resources

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Using Ambients to Control Resources

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Equational properties of mobile ambients

Mathematical Structures in Computer Science
Towards a behavioural theory of access and mobility control in distributed systems

Theoretical Computer Science - Special issue: Foundations of wide area network computing
Communication and mobility control in boxed ambients

Information and Computation

Calculi, types and applications

Theoretical Computer Science
Formalising security in ubiquitous and cloud scenarios

CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Formal modeling of resource management for cloud architectures: an industrial case study

ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing

Quantified Score

Hi-index	5.24

Visualization

Abstract

Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space usage in the context of an ambient calculus with bounded capacities and weighed processes, where migration and activation require space. A type system controls the dynamics of the calculus by providing static guarantees that the intended capacity bounds are preserved throughout the computation. We investigate various term-level mechanisms to complement the typed control on the dynamics of space allocation and acquisition, and study their consequences on the semantic theory of the calculus.