Rocco De Nicola

According to our database1, Rocco De Nicola
  • authored at least 183 papers between 1981 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Initial Algebra for a System of Right-Linear Functors.
Acta Cybern., 2017

AErlang at Work.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

AErlang: Empowering Erlang with Attribute-Based Communication.
Proceedings of the Coordination Models and Languages, 2017

Verifying Properties of Systems Relying on Attribute-Based Communication.
Proceedings of the ModelEd, TestEd, TrustEd, 2017

Smart Contract Negotiation in Cloud Computing.
Proceedings of the 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), 2017

2016
Multiparty testing preorders.
CoRR, 2016

Tuple spaces implementations and their efficiency.
CoRR, 2016

On the Power of Attribute-based Communication.
CoRR, 2016

Programming of CAS Systems by Relying on Attribute-Based Communication.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 2016

On the Power of Attribute-Based Communication.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2016

Online User Behavioural Modeling with Applications to Price Steering.
Proceedings of the 2nd International Workshop on Personalization & Recommender Systems in Financial Services, 2016

Dynamic SLAs for Clouds.
Proceedings of the Service-Oriented and Cloud Computing, 2016

Tuple Spaces Implementations and Their Efficiency.
Proceedings of the Coordination Models and Languages, 2016

Replicating Data for Better Performances in X10.
Proceedings of the Semantics, Logics, and Calculi, 2016

2015
The SCEL Language: Design, Implementation, Verification.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

CaSPiS: a calculus of sessions, pipelines and services.
Mathematical Structures in Computer Science, 2015

EATCS Fellows 2016 - Call for Nominations.
Bulletin of the EATCS, 2015

Domain-specific queries and Web search personalization: some investigations.
Proceedings of the Proceedings 11th International Workshop on Automated Specification and Verification of Web Systems, 2015

CARMA: Collective Adaptive Resource-sharing Markovian Agents.
Proceedings of the Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, 2015

Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes.
Acta Inf., 2015

Multiparty Testing Preorders.
Proceedings of the Trustworthy Global Computing - 10th International Symposium, 2015

On Integrating Social and Sensor Networks for Emergency Management.
Proceedings of the Software Engineering and Formal Methods, 2015

Twitlang(er): Interactions Modeling Language (and Interpreter) for Twitter.
Proceedings of the Software Engineering and Formal Methods - 13th International Conference, 2015

A calculus for attribute-based communication.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Replica-Based High-Performance Tuple Space Computing.
Proceedings of the Coordination Models and Languages, 2015

Global Protocol Implementations via Attribute-Based Communication.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

A Homage to Martin Wirsing.
Proceedings of the Software, 2015

2014
Relating strong behavioral equivalences for processes with nondeterminism and probabilities.
Theor. Comput. Sci., 2014

A Formal Approach to Autonomic Systems Programming: The SCEL Language.
TAAS, 2014

Editor's Note.
J. Log. Algebr. Meth. Program., 2014

Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes.
Logical Methods in Computer Science, 2014

SLAC: A Formal Service-Level-Agreement Language for Cloud Computing.
Proceedings of the 7th IEEE/ACM International Conference on Utility and Cloud Computing, 2014

Trust-Based Enforcement of Security Policies.
Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

Introduction to "Rigorous Engineering of Autonomic Ensembles"- Track Introduction.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014

Self-expression and Dynamic Attribute-Based Ensembles in SCEL.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014

A formal approach to autonomic systems programming: the SCEL language.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

Dimming Relations for the Efficient Analysis of Concurrent Systems via Action Abstraction.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2014

A Formal Approach to Autonomic Systems Programming: The SCEL Language - (Long Abstract).
Proceedings of the Formal Aspects of Component Software - 11th International Symposium, 2014

Programming and Verifying Component Ensembles.
Proceedings of the From Programs to Systems. The Systems perspective in Computing, 2014

Reasoning (on) Service Component Ensembles in Rewriting Logic.
Proceedings of the Specification, Algebra, and Software, 2014

Reputation-Based Composition of Social Web Services.
Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, 2014

2013
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences.
Inf. Comput., 2013

A uniform definition of stochastic process calculi.
ACM Comput. Surv., 2013

A Companion of "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities"
CoRR, 2013

The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes.
Proceedings of the Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, 2013

Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations.
Proceedings of the Trustworthy Global Computing - 8th International Symposium, 2013

A Life Cycle for the Development of Autonomic Systems: The E-mobility Showcase.
Proceedings of the 7th IEEE International Conference on Self-Adaptation and Self-Organizing Systems Workshops, 2013

Specifying and analysing reputation systems with a coordination language.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Network-Aware Evaluation Environment for Reputation Systems.
Proceedings of the Trust Management VII - 7th IFIP WG 11.11 International Conference, 2013

Formalising Adaptation Patterns for Autonomic Ensembles.
Proceedings of the Formal Aspects of Component Software - 10th International Symposium, 2013

2012
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Process Algebras.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Behavioral Equivalences.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Process Calculi
Proceedings of the Proceedings First International Workshop on Process Algebra and Coordination, 2011

Orchestrating Tuple-Based Languages.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Linear-Time and May-Testing in a Probabilistic Reactive Setting.
Proceedings of the Formal Techniques for Distributed Systems, 2011

A Language-Based Approach to Autonomic Computing.
Proceedings of the Formal Methods for Components and Objects, 10th International Symposium, 2011

SoSL: A Service-Oriented Stochastic Logic.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

Core Calculi for Service-Oriented Computing.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

2010
From Flow Logic to static type systems for coordination languages.
Sci. Comput. Program., 2010

Tree-functors, determinacy and bisimulations.
Mathematical Structures in Computer Science, 2010

Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

2009
MarCaSPiS: a Markovian Extension of a Calculus for Services.
Electr. Notes Theor. Comput. Sci., 2009

Rate-Based Transition Systems for Stochastic Process Calculi.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

On a Uniform Framework for the Definition of Stochastic Process Languages.
Proceedings of the Formal Methods for Industrial Critical Systems, 2009

2008
TAPAs: A Tool for the Analysis of Process Algebras.
Trans. Petri Nets and Other Models of Concurrency, 2008

Semantic subtyping for the pi-calculus.
Theor. Comput. Sci., 2008

Multiple-Labelled Transition Systems for nominal calculi and their logics.
Mathematical Structures in Computer Science, 2008

Provably Correct Implementations of Services.
Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

Sessions and Pipelines for Structured Service Programming.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2008

From Flow Logic to Static Type Systems for Coordination Languages.
Proceedings of the Coordination Models and Languages, 10th International Conference, 2008

Implementing Session Centered Calculi.
Proceedings of the Coordination Models and Languages, 10th International Conference, 2008

Ugo Montanari in a Nutshell.
Proceedings of the Concurrency, 2008

2007
Model checking mobile stochastic logic.
Theor. Comput. Sci., 2007

Global computing in a dynamic network of tuple spaces.
Sci. Comput. Program., 2007

Basic observables for a calculus for global computing.
Inf. Comput., 2007

Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi.
Electr. Notes Theor. Comput. Sci., 2007

Implementing a Distributed Mobile Calculus Using the IMC Framework.
Electr. Notes Theor. Comput. Sci., 2007

Basic Observables for Probabilistic May Testing.
Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

Session Centered Calculi for Service Oriented Computing.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006
On the expressive power of KLAIM-based calculi.
Theor. Comput. Sci., 2006

Implementing Mobile and Distributed Applications in X-Klaim.
Scalable Computing: Practice and Experience, 2006

Confining data and processes in global computing applications.
Sci. Comput. Program., 2006

Towards a Logic for Performance and Mobility.
Electr. Notes Theor. Comput. Sci., 2006

From Process Calculi to Klaim and Back.
Electr. Notes Theor. Comput. Sci., 2006

SCC: A Service Centered Calculus.
Proceedings of the Web Services and Formal Methods, Third International Workshop, 2006

SensoriaProcess Calculi for Service-Oriented Computing.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

2005
On the Expressive Power of Klaim-based Calculi.
Electr. Notes Theor. Comput. Sci., 2005

Types in concurrency.
Acta Inf., 2005

Mobile Distributed Programming in X-Klaim.
Proceedings of the Formal Methods for Mobile Computing, 2005

Formal modeling and quantitative analysis of KLAIM-based mobile systems.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Semantic Subtyping for the p-Calculus.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Languages and Process Calculi for Network Aware Programming - Short Summary -.
Proceedings of the Theoretical Aspects of Computing, 2005

Basic Observables for a Calculus for Global Computing.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Pattern Matching over a Dynamic Network of Tuple Spaces.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2005

A Flexible and Modular Framework for Implementing Infrastructures for Global Computing.
Proceedings of the Distributed Applications and Interoperable Systems, 2005

Global Computing in a Dynamic Network of Tuple Spaces.
Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

A Process Calculus for QoS-Aware Applications.
Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

2004
A modal logic for mobile agents.
ACM Trans. Comput. Log., 2004

Formulae Meet Programs Over the Net: A Framework for Correct Network Aware Programming.
Autom. Softw. Eng., 2004

A Software Framework for Rapid Prototyping of Run-Time Systems for Mobile Calculi.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

MoMo: A Modal Logic for Reasoning About Mobility.
Proceedings of the Formal Methods for Components and Objects, 2004

2003
Nondeterministic regular expressions as solutions of equational systems.
Theor. Comput. Sci., 2003

The Klaim Project: Theory and Practice.
Proceedings of the Global Computing. Programming Environments, 2003

A Formal Basis for Reasoning on Programmable QoS.
Proceedings of the Verification: Theory and Practice, 2003

2002
Klava: a Java package for distributed and mobile applications.
Softw., Pract. Exper., 2002

An Equational Axiomatization of Bisimulation over Regular Expressions.
J. Log. Comput., 2002

Trace and Testing Equivalence on Asynchronous Processes.
Inf. Comput., 2002


Software update via mobile agent based programming.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

A Java Middleware for Guaranteeing Privacy of Distributed Tuple Spaces.
Proceedings of the Scientific Engineering for Distributed Java Applications, 2002

Formalizing Properties of Mobile Agent Systems.
Proceedings of the Coordination Models and Languages, 5th International Conference, 2002

2001
Algebraic characterizations of trace and decorated trace equivalences over tree-like structures.
Theor. Comput. Sci., 2001

Divergence in testing and readiness semantics.
Theor. Comput. Sci., 2001

Proof Techniques for Cryptographic Processes.
SIAM J. Comput., 2001

XKlaim and Klava: Programming Mobile Code.
Electr. Notes Theor. Comput. Sci., 2001

Translating Strong Mobility into Weak Mobility.
Proceedings of the Mobile Agents, 5th International Conference, 2001

2000
Linda-based applicative and imperative process algebras.
Theor. Comput. Sci., 2000

Types for access control.
Theor. Comput. Sci., 2000

Mobile Applications in X-KLAIM.
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.
Proceedings of the Formal Techniques for Distributed System Development, 2000

Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces.
Proceedings of the Coordination Languages and Models, 4th International Conference, 2000

Programming Access Control: The KLAIM Experience.
Proceedings of the CONCUR 2000, 2000

A Modal Logic for KLAIM.
Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

1999
Models of Nondeterministic Regular Expressions.
J. Comput. Syst. Sci., 1999

A finite axiomatization of nondeterministic regular expressions.
ITA, 1999

Basic Observables for Processes.
Inf. Comput., 1999

Proof Techniques for Cryptographic Processes.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Graded Modalities and Resource Bisimulation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

A Theory of "May" Testing for Asynchronous Languages.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

Types as Specifications of Access Policies.
Proceedings of the Secure Internet Programming, 1999

Coordination and Access Control of Mobile Agents.
Proceedings of the Coordination Languages and Models, Third International Conference, 1999

1998
KLAIM: A Kernel Language for Agents Interaction and Mobility.
IEEE Trans. Software Eng., 1998

Tree Morphisms and Bisimulations.
Electr. Notes Theor. Comput. Sci., 1998

Interactive Mobile Agents in X-Klaim.
Proceedings of the 7th Workshop on Enabling Technologies (WETICE '98), 1998

Asynchronous Observations of Processes.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

Possible Worlds for Process Algebras.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
Locality Based Semantics for Process Algebras.
Acta Inf., 1997

Locality Based Linda: Programming with Explicit Localities.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Basic Observables for Processes.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Coordinating Mobile Agents via Blackboards and Access Rights.
Proceedings of the Coordination Languages and Models, Second International Conference, 1997

1996
A Symbolic Semantics for the pi-Calculus.
Inf. Comput., 1996

On Four Partial Ordering Semantics for a Process Calculus.
Fundam. Inform., 1996

Concurrency: Theory and Practice.
ACM Comput. Surv., 1996

Testing Semantics of Asynchronous Distributed Programs.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

A Process Algebra Based on LINDA.
Proceedings of the Coordination Languages and Models, First International Conference, 1996

1995
Testing Equivalence for Mobile Processes
Inf. Comput., August, 1995

A Process Algebraic View of Input/Output Automata.
Theor. Comput. Sci., 1995

Three Logics for Branching Bisimulation.
J. ACM, 1995

Fully Abstract Models for Nondeterministic Regular Expressions.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

Verifying hardware components within JACK.
Proceedings of the Correct Hardware Design and Verification Methods, 1995

1994
A Completeness Theorem fro Nondeterministic Kleene Algebras.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Distribution and Locality of Concurrent Systems.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

A Symbolic Semantics for the pi-calculus (Extended Abstract).
Proceedings of the CONCUR '94, 1994

1993
Universal Axioms for Bisimulations.
Theor. Comput. Sci., 1993

An Action-Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems.
Computer Networks and ISDN Systems, 1993

1992
Observation Trees.
Proceedings of the NAPAW 92, 1992

Testing Equivalence for Mobile Processes (Extended Abstract).
Proceedings of the CONCUR '92, 1992

1991
Action and State-based Logics for Process Algebras.
Proceedings of the CONCUR '91, 1991

An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

1990
A Partial Ordering Semantics for CCS.
Theor. Comput. Sci., 1990

Action versus State based Logics for Transition Systems.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Three Logics for Branching Bisimulation (Extended Abstract)
LICS, 1990

Observational Logics and Concurrency Models.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

Back and Forth Bisimulations.
Proceedings of the CONCUR '90, 1990

1989
Using the Adxiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988
A Distributed Operational Semantics for CCS Based on Condition/Event Systems.
Acta Inf., 1988

Partial orderings descriptions and observations of nondeterministic concurrent processes.
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)
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
Extensional Equivalences for Transition Systems.
Acta Inf., 1987

CCS without tau's.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986
Testing equivalences and fully abstract models for communicating systems.
PhD thesis, 1986

Net Theory and Application - Response.
IFIP Congress, 1986

CCS is an (Augmented) Contact Free C/E System.
Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

Testing Equivalences for Event Structures.
Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

1985
Two Complete Axiom Systems for a Theory of Communicating Sequential Processes
Information and Control, 1985

Partial ordering derivations for CCS.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Testing Equivalences for Processes.
Theor. Comput. Sci., 1984

Models and Operators for Nondeterministic Processes.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
Testing Equivalence for Processes.
Proceedings of the Automata, 1983

A Complete Set of Axioms for a Theory of Communicating Sequential Processes.
Proceedings of the Fundamentals of Computation Theory, 1983

1981
Communication Through Message Passing or Shared Memory: A Formal Comparison.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981


  Loading...