Rocco De Nicola

Vasco Thudichum Vasconcelos

Gianluigi Zavattaro

Proceedings of the Web Services and Formal Methods, Third International Workshop, 2006

SensoriaProcess Calculi for Service-Oriented Computing.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

2005

Towards a Logic for Performance and Mobility.

[BibT_eX]

[DOI]

Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages, 2005

From Process Calculi to Klaim and Back.

[BibT_eX]

[DOI]

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Types in concurrency.

[BibT_eX]

[DOI]

Davide Sangiorgi

Acta Informatica, 2005

Mobile Distributed Programming in X-Klaim.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Mobile Computing, 2005

Formal modeling and quantitative analysis of KLAIM-based mobile systems.

[BibT_eX]

[DOI]

Diego Latella

Mieke Massink

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

Semantic Subtyping for the p-Calculus.

[BibT_eX]

[DOI]

Giuseppe Castagna

Daniele Varacca

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Languages and Process Calculi for Network Aware Programming - Short Summary -.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2005

Pattern Matching over a Dynamic Network of Tuple Spaces.

[BibT_eX]

[DOI]

Daniele Gorla

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

A Flexible and Modular Framework for Implementing Infrastructures for Global Computing.

[BibT_eX]

[DOI]

Proceedings of the Distributed Applications and Interoperable Systems, 2005

A Process Calculus for QoS-Aware Applications.

[BibT_eX]

[DOI]

Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

2004

A modal logic for mobile agents.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2004

Formulae Meet Programs Over the Net: A Framework for Correct Network Aware Programming.

[BibT_eX]

[DOI]

Vasco Thudichum Vasconcelos

Autom. Softw. Eng., 2004

A Software Framework for Rapid Prototyping of Run-Time Systems for Mobile Calculi.

[BibT_eX]

[DOI]

Proceedings of the Global Computing, IST/FET International Workshop, 2004

MoMo: A Modal Logic for Reasoning About Mobility.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Components and Objects, 2004

2003

Nondeterministic regular expressions as solutions of equational systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The Klaim Project: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Global Computing. Programming Environments, 2003

A Formal Basis for Reasoning on Programmable QoS.

[BibT_eX]

[DOI]

Proceedings of the Verification: Theory and Practice, 2003

2002

Klava: a Java package for distributed and mobile applications.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2002

An Equational Axiomatization of Bisimulation over Regular Expressions.

[BibT_eX]

[DOI]

J. Log. Comput., 2002

Trace and Testing Equivalence on Asynchronous Processes.

[BibT_eX]

[DOI]

Inf. Comput., 2002

AGILE: Software Architecture for Mobility.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2002

Software update via mobile agent based programming.

[BibT_eX]

[DOI]

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

A Java Middleware for Guaranteeing Privacy of Distributed Tuple Spaces.

[BibT_eX]

[DOI]

Proceedings of the Scientific Engineering for Distributed Java Applications, 2002

Formalizing Properties of Mobile Agent Systems.

[BibT_eX]

[DOI]

Proceedings of the Coordination Models and Languages, 5th International Conference, 2002

2001

Algebraic characterizations of trace and decorated trace equivalences over tree-like structures.

[BibT_eX]

[DOI]

Xiao Jun Chen

Theor. Comput. Sci., 2001

Divergence in testing and readiness semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Proof Techniques for Cryptographic Processes.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

XKlaim and Klava: Programming Mobile Code.

[BibT_eX]

[DOI]

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Translating Strong Mobility into Weak Mobility.

[BibT_eX]

[DOI]

Proceedings of the Mobile Agents, 5th International Conference, 2001

2000

Linda-based applicative and imperative process algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Types for access control.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Mobile Applications in X-KLAIM.

[BibT_eX]

Proceedings of the WOA 2000: Dagli Oggetti agli Agenti. 1st AI*IA/TABOO Joint Workshop "From Objects to Agents": Evolutive Trends of Software Systems, 2000

Process Algebraic Analysis of Cryptographic Protocols.

[BibT_eX]

Proceedings of the Formal Techniques for Distributed System Development, 2000

Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces.

[BibT_eX]

[DOI]

Antony I. T. Rowstron

Proceedings of the Coordination Languages and Models, 4th International Conference, 2000

Programming Access Control: The KLAIM Experience.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2000, 2000

A Modal Logic for KLAIM.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

1999

Models of Nondeterministic Regular Expressions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

A finite axiomatization of nondeterministic regular expressions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1999

Basic Observables for Processes.

[BibT_eX]

[DOI]

Inf. Comput., 1999

Graded Modalities and Resource Bisimulation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

A Theory of "May" Testing for Asynchronous Languages.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1999

Types as Specifications of Access Policies.

[BibT_eX]

[DOI]

Proceedings of the Secure Internet Programming, 1999

Coordination and Access Control of Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Coordination Languages and Models, Third International Conference, 1999

1998

KLAIM: A Kernel Language for Agents Interaction and Mobility.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1998

Tree Morphisms and Bisimulations.

[BibT_eX]

[DOI]

Proceedings of the MFCS '98 Workshop on Concurrency, 1998

Interactive Mobile Agents in X-Klaim.

[BibT_eX]

[DOI]

Proceedings of the 7th Workshop on Enabling Technologies (WETICE '98), 1998

Asynchronous Observations of Processes.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1998

Possible Worlds for Process Algebras.

[BibT_eX]

[DOI]

Simone Veglioni

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997

Locality Based Semantics for Process Algebras.

[BibT_eX]

[DOI]

Acta Informatica, 1997

Locality Based Linda: Programming with Explicit Localities.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Coordinating Mobile Agents via Blackboards and Access Rights.

[BibT_eX]

[DOI]

Proceedings of the Coordination Languages and Models, Second International Conference, 1997

1996

A Symbolic Semantics for the pi-Calculus.

[BibT_eX]

[DOI]

Inf. Comput., 1996

On Four Partial Ordering Semantics for a Process Calculus.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Concurrency: Theory and Practice.

[BibT_eX]

[DOI]

Scott A. Smolka

ACM Comput. Surv., 1996

Testing Semantics of Asynchronous Distributed Programs.

[BibT_eX]

[DOI]

Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures.

[BibT_eX]

[DOI]

Xiao Jun Chen

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

A Process Algebra Based on LINDA.

[BibT_eX]

[DOI]

Proceedings of the Coordination Languages and Models, First International Conference, 1996

1995

Testing Equivalence for Mobile Processes

[BibT_eX]

[DOI]

Inf. Comput., August, 1995

A Process Algebraic View of Input/Output Automata.

[BibT_eX]

[DOI]

Roberto Segala

Theor. Comput. Sci., 1995

Three Logics for Branching Bisimulation.

[BibT_eX]

[DOI]

J. ACM, 1995

An Observational Semantics for Linda.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

Fully Abstract Models for Nondeterministic Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '95: Concurrency Theory, 1995

Verifying hardware components within JACK.

[BibT_eX]

[DOI]

Proceedings of the Correct Hardware Design and Verification Methods, 1995

1994

A Completeness Theorem fro Nondeterministic Kleene Algebras.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Distribution and Locality of Concurrent Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

A Symbolic Semantics for the pi-calculus (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the CONCUR '94, 1994

1993

Universal Axioms for Bisimulations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

An Action-Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems.

[BibT_eX]

[DOI]

Comput. Networks ISDN Syst., 1993

1992

Observation Trees.

[BibT_eX]

[DOI]

Proceedings of the NAPAW 92, 1992

Testing Equivalence for Mobile Processes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the CONCUR '92, 1992

1991

Equational reasoning about LOTOS specifications: a rewriting approach.

[BibT_eX]

[DOI]

Paola Inverardi

Monica Nesi

Proceedings of the 6th International Workshop on Software Specification and Design, 1991

Action and State-based Logics for Process Algebras.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '91, 1991

1990

A Partial Ordering Semantics for CCS.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Action versus State based Logics for Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Three Logics for Branching Bisimulation (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1990

Observational Logics and Concurrency Models.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

Back and Forth Bisimulations.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '90, 1990

1989

Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications.

[BibT_eX]

[DOI]

Paola Inverardi

Monica Nesi

Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988

A Distributed Operational Semantics for CCS Based on Condition/Event Systems.

[BibT_eX]

[DOI]

Acta Informatica, 1988

Partial orderings descriptions and observations of nondeterministic concurrent processes.

[BibT_eX]

[DOI]

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

On the Consistency of "Truly Concurrent" Operational and Denotational Semantics (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987

Extensional Equivalences for Transition Systems.

[BibT_eX]

[DOI]

Acta Informatica, 1987

CCS without tau's.

[BibT_eX]

[DOI]

Matthew Hennessy

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Observational equivalences for concurrency models.

[BibT_eX]

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

1986

Testing equivalences and fully abstract models for communicating systems.

[BibT_eX]

[DOI]

PhD thesis, 1986

Net Theory and Application - Response.

[BibT_eX]