The name discipline of uniform receptiveness
Theoretical Computer Science
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Well-structured transition systems everywhere!
Theoretical Computer Science
Structural inclusion in the pi-calculus with replication
Theoretical Computer Science
Types as models: model checking message-passing programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
A generic type system for the Pi-calculus
Theoretical Computer Science
Type-based information flow analysis for the π-calculus
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
A Type System for Client Progress in a Service-Oriented Calculus
Concurrency, Graphs and Models
A Hybrid Type System for Lock-Freedom of Mobile Processes
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Spatial and Behavioral Types in the Pi-Calculus
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Responsiveness in process calculi
Theoretical Computer Science
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Logical semantics of types for concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Type abstractions of name-passing processes
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Spatial-behavioral types, distributed services, and resources
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
An Algebra of Behavioural Types
Information and Computation
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
Hi-index | 0.00 |
We present a framework that combines ideas from spatial logics and behavioral type systems. Type systems for the pi-calculus are proposed where newly declared (restricted) names are annotated with spatial process properties, predicating on those names, that are expected to hold in the scope of the declaration. Types are akin to ccs terms and account for the process abstract behavior and ''shallow'' spatial structure. Type checking relies on spatial model checking, but properties are checked against types rather than against processes. Type soundness theorems ensure that, for a certain class of spatial properties, well-typed programs are also well annotated, in the sense that processes in the scope of any restriction do satisfy the corresponding annotation at run-time. The considered class of properties is rather general. Differently from previous proposals, it includes both safety and liveness ones, and is not limited to invariants. We also elaborate a distinction between locally and globally checkable properties.