Ilaria Castellani

Orcid: 0000-0001-9820-0892

According to our database1, Ilaria Castellani authored at least 55 papers between 1982 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Branching pomsets: Design, expressiveness and applications to choreographies.
J. Log. Algebraic Methods Program., January, 2024

Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions.
Fundam. Informaticae, 2024

Towards a Semantic Characterisation of Global Type Well-formedness.
Proceedings of the Proceedings 15th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2024

A simple view of multiparty session types.
Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming, 2024

2023
Event structure semantics for multiparty sessions.
J. Log. Algebraic Methods Program., February, 2023

Preface to the special issue on Open Problems in Concurrency Theory.
J. Log. Algebraic Methods Program., 2023

EXPRESSing Session Types.
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

2022
Asynchronous Sessions with Input Races.
Proceedings of the 13th International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2022

CONCUR Test-Of-Time Award 2022 (Invited Paper).
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2020
Global types with internal delegation.
Theor. Comput. Sci., 2020

2019
Special Issue on Trends in Concurrency Theory (selected invited contributions from the workshops TRENDS 2015 and 2016).
J. Log. Algebraic Methods Program., 2019

Reversible sessions with flexible choices.
Acta Informatica, 2019

2017
Preface: Special issue on Trends in Concurrency Theory (selected invited contributions from the workshops TRENDS 2014 and 2015).
J. Log. Algebraic Methods Program., 2017

Concurrent Reversible Sessions.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Self-adaptation and secure information flow in multiparty communications.
Formal Aspects Comput., 2016

A quarter of a century of CONCUR - Report on the 2014 and 2015 editions of the Conference on Concurrency Theory.
Bull. EATCS, 2016

Secure Multiparty Sessions with Topics.
Proceedings of the Ninth workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2016

2015
Combining behavioural types with security analysis.
J. Log. Algebraic Methods Program., 2015

2014
Typing access control and secure information flow in sessions.
Inf. Comput., 2014

Report on WS25CCC.
Bull. EATCS, 2014

Self-Adaptation and Secure Information Flow in Multiparty Structured Communications: A Unified Perspective.
Proceedings of the Proceedings Third Workshop on Behavioural Types, 2014

2013
Fine-Grained and Coarse-Grained Reactive Noninterference.
Proceedings of the Trustworthy Global Computing - 8th International Symposium, 2013

2011
Information Flow Safety in Multiparty Sessions
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

A Reputation System for Multirole Sessions.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

2010
Session Types for Access and Information Flow Control.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2008
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Proceedings of the Concurrency, 2008

2007
Typing noninterference for reactive programs.
J. Log. Algebraic Methods Program., 2007

State-oriented Noninterference for CCS.
Proceedings of the Fifth Workshop on Security Issues in Concurrency, 2007

2005
Reactive Concurrent Programming Revisited.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

2002
Noninterference for concurrent programs and thread systems.
Theor. Comput. Sci., 2002

2001
Noninterference for Concurrent Programs.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Process Algebras with Localities.
Proceedings of the Handbook of Process Algebra, 2001

1999
Preface.
Proceedings of the 6th International Workshop on Expressiveness in Concurrency, 1999

Synthesizing Distributed Transition Systems from Global Specification.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998
On Bisimulations for the Asynchronous pi-Calculus.
Theor. Comput. Sci., 1998

Preface.
Proceedings of the Fifth International Workshop on Expressiveness in Concurrency, 1998

Testing Theories for Asynchronous Languages.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
Parallel Product of Event Structures.
Theor. Comput. Sci., 1997

1996
An Algebraic Characterization of Observational Equivalence.
Theor. Comput. Sci., 1996

1995
Observing Distribution in Processes: Static and Dynamic Localities.
Int. J. Found. Comput. Sci., 1995

1994
Flow Models of Distributed Computations: Three Equivalent Semantics for CCS
Inf. Comput., November, 1994

A Theory of Processes with Localities.
Formal Aspects Comput., 1994

1993
Observing Localities.
Theor. Comput. Sci., 1993

Causal and Distributed Semantics for Concurrent Processes (Abstract).
Proceedings of the STACS 93, 1993

Observing Distribution in Processes.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
A Theory of Process with Localities (Extended Abstract).
Proceedings of the CONCUR '92, 1992

1991
Observing Localities (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990
Three Equivalent Semantics for CCS.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

1989
Distributed bisimulations.
J. ACM, 1989

1988
Concurrency and Atomicity.
Theor. Comput. Sci., 1988

Permutation of transitions: An event structure semantics for CCS and SCCS.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1987
Bisimulations and Abstraction Homomorphisms.
J. Comput. Syst. Sci., 1987

On the Semantics of Concurrency: Partial Orders and Transition Systems.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1982
Labeled Event Structures: A Model for Observable Concurrency.
Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

Graph Grammars for distributed systems.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982


  Loading...