From Flow Logic to static type systems for coordination languages

Authors:
Rocco De Nicola;Daniele Gorla;René Rydhof Hansen;Flemming Nielson;Hanne Riis Nielson;Christian W. Probst;Rosario Pugliese
Affiliations:
Dipartimento di Sistemi e Informatica, Università di Firenze, Italy;Dipartimento di Informatica, Università di Roma La Sapienza, Italy;Department of Computer Science, Aalborg University, Denmark;Informatics and Mathematical Modelling, Technical University of Denmark, Denmark;Informatics and Mathematical Modelling, Technical University of Denmark, Denmark;Informatics and Mathematical Modelling, Technical University of Denmark, Denmark;Dipartimento di Sistemi e Informatica, Università di Firenze, Italy
Venue:
Science of Computer Programming
Year:
2010

Citing 27
Cited 3

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system equivalent to flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
KLAIM: A Kernel Language for Agents Interaction and Mobility

IEEE Transactions on Software Engineering
Equality-based flow analysis versus recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Types for access control

Theoretical Computer Science
Resource access control in systems of mobile agents

Information and Computation
Validating firewalls using flow logics

Theoretical Computer Science
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Types for the ambient calculus

Information and Computation - IFIP TCS2000
A Language-Based Approach to Security

Informatics - 10 Years Back. 10 Years Ahead.
Control-Flow Analysis and Type Systems

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Abstract interpretation of mobile ambients

Science of Computer Programming - Special issue on static analysis (SAS'99)
A succinct solver for ALFP

Nordic Journal of Computing
Flow logic: a multi-paradigmatic approach to static analysis

The essence of computation
Access control for mobile agents: The calculus of boxed ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
A calculus for control flow analysis of security protocols

International Journal of Information Security - Special issue on security in global computing
The Seal Calculus

Information and Computation
Sandboxing in myKlaim

ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
Static validation of security protocols

Journal of Computer Security
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Coordination with multicapabilities

Science of Computer Programming
Type systems equivalent to data-flow analyses for imperative languages

Theoretical Computer Science - Applied semantics
A framework for security analysis of mobile wireless networks

Theoretical Computer Science - Automated reasoning for security protocol analysis
Resource access and mobility control with dynamic privileges acquisition

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Types from control flow analysis

Program analysis and compilation, theory and practice
Security boundaries in mobile ambients

Computer Languages, Systems and Structures

Flow sensitive-insensitive pointer analysis based memory safety for multithreaded programs

ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Flow Logic for Process Calculi

ACM Computing Surveys (CSUR)
From explicit to symbolic types for communication protocols in CCS

Formal modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coordination languages are often used to describe open-ended systems. This makes it challenging to develop tools for guaranteeing the security of the coordinated systems and the correctness of their interaction. Successful approaches to this problem have been based on type systems with dynamic checks; therefore, the correctness properties cannot be statically enforced. By contrast, static analysis approaches based on Flow Logic usually guarantee properties statically. In this paper, we show how the insights from the Flow Logic approach can be used to construct a type system for statically ensuring secure access to tuple spaces and safe process migration for an extension of the language Klaim.