Daniele Gorla

Algorithmica, 2019

Depletable channels: dynamics, behaviour, and efficiency in network design.

[BibT_eX]

[DOI]

Acta Informatica, 2019

Modal Epistemic Logic on Contracts: A Doctrinal Approach.

[BibT_eX]

[DOI]

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance.

[BibT_eX]

[DOI]

Michele Boreale

Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018

A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

Inefficiencies in network models: A graph-theoretic perspective.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Graph Theoretic Detection of Inefficiencies in Network Models.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017

Preface.

[BibT_eX]

[DOI]

Paolo Baldan

Inf. Comput., 2017

Semantic Subtyping for Objects and Classes.

[BibT_eX]

[DOI]

Ornela Dardha

Daniele Varacca

Comput. J., 2017

2016

Full abstraction for expressiveness: history, myths and facts.

[BibT_eX]

[DOI]

Uwe Nestmann

Math. Struct. Comput. Sci., 2016

Graph Theoretic Investigations on Inefficiencies in Network Models.

[BibT_eX]

[DOI]

CoRR, 2016

2015

A semiring-based trace semantics for processes with applications to information leakage analysis.

[BibT_eX]

[DOI]

Michele Boreale

David Clark

Math. Struct. Comput. Sci., 2015

2014

A Concurrent Pattern Calculus.

[BibT_eX]

[DOI]

Thomas Given-Wilson

Barry Jay

Log. Methods Comput. Sci., 2014

2013

Pattern Matching and Bisimulation.

[BibT_eX]

[DOI]

Thomas Given-Wilson

Proceedings of the Coordination Models and Languages, 15th International Conference, 2013

2012

Preface to special issue: EXPRESS, ICE and SOS 2009.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2012

2010

From Flow Logic to static type systems for coordination languages.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2010

Tree-functors, determinacy and bisimulations.

[BibT_eX]

[DOI]

Anna Labella

Math. Struct. Comput. Sci., 2010

Preface to special issue: Expressiveness in Concurrency 2008.

[BibT_eX]

[DOI]

Thomas T. Hildebrandt

Math. Struct. Comput. Sci., 2010

Preface.

[BibT_eX]

[DOI]

Catuscia Palamidessi

J. Comput. Secur., 2010

Towards a unified approach to encodability and separation results for process calculi.

[BibT_eX]

[DOI]

Inf. Comput., 2010

A taxonomy of process calculi for distribution and mobility.

[BibT_eX]

[DOI]

Distributed Comput., 2010

2009

Dynamic management of capabilities in a network aware coordination language.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2009

On the Relative Expressive Power of Calculi for Mobility.

[BibT_eX]

[DOI]

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Depletable Channels: Dynamics and Behaviour.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008

Comparing communication primitives via their relative expressive power.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Preface.

[BibT_eX]

[DOI]

Thomas T. Hildebrandt

Proceedings of the 15th Workshop on Expressiveness in Concurrency, 2008

On the Relative Expressive Power of Ambient-Based Calculi.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

Network Applications of Graph Bisimulation.

[BibT_eX]

[DOI]

Emilio Tuosto

Proceedings of the Graph Transformations, 4th International Conference, 2008

2007

Global computing in a dynamic network of tuple spaces.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2007

Basic observables for a calculus for global computing.

[BibT_eX]

[DOI]

Inf. Comput., 2007

2006

On the expressive power of KLAIM-based calculi.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Confining data and processes in global computing applications.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2006

Role-based access control for a distributed calculus.

[BibT_eX]

[DOI]

Chiara Braghin

J. Comput. Secur., 2006

Synchrony vs Asynchrony in Communication Primitives.

[BibT_eX]

[DOI]

Proceedings of the 13th International Workshop on Expressiveness in Concurrency, 2006

Inferring dynamic credentials for rôle-based trust management.

[BibT_eX]

[DOI]

Matthew Hennessy

Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

On the Relative Expressive Power of Asynchronous Communication Primitives.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005

Pattern Matching over a Dynamic Network of Tuple Spaces.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2005

2004

Security Policies as Membranes in Systems for Global Computing.

[BibT_eX]

[DOI]

Matthew Hennessy

Proceedings of the Workshop 3rd on the Foundations of Global Ubiquitous Computing, 2004

Controlling data movement in global computing applications.

[BibT_eX]

[DOI]

Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

A Distributed Calculus for Ro^le-Based Access Control.

[BibT_eX]

[DOI]

Chiara Braghin

Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003

Enforcing Security Policies via Types.

[BibT_eX]

[DOI]

Proceedings of the Security in Pervasive Computing, 2003

Resource Access and Mobility Control with Dynamic Privileges Acquisition.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

The Klaim Project: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Global Computing. Programming Environments, 2003

2002

On Compositional Reasoning in the Spi-calculus.

[BibT_eX]

[DOI]

Michele Boreale