A Logic-Functional Approach to the Execution of CCS Specifications Modulo Behavioural Equivalences. - Stefania Gnesi; Paola Inverardi; Monica Nesi (Concurrency, 1988)

Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications. - Rocco De Nicola; Paola Inverardi; Monica Nesi (Automatic Verification Methods for Finite State Systems, 1989)

A Rewriting Strategy to Verify Observational Congruence. - Paola Inverardi; Monica Nesi (Inf. Process. Lett., 1990)

On Rewriting Behavioral Semantics in Process Algebras. - Paola Inverardi; Monica Nesi (AMAST, 1991)

Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic. - Monica Nesi (CAV, 1991)

Equational reasoning about LOTOS specifications: a rewriting approach. - Rocco De Nicola; Paola Inverardi; Monica Nesi (IWSSD, 1991)

Infinite Normal Forms for Non-Linear Term Rewriting Systems. - Paola Inverardi; Monica Nesi (MFCS, 1991)

Combining Interaction and Automation in Process Algebra Verification. - Albert John Camilleri; Paola Inverardi; Monica Nesi (TAPSOFT, Vol.2, 1991)

A Strategy to Deal with Divergent Rewrite Systems. - Paola Inverardi; Monica Nesi (CTRS, 1992)

Formalizing a Modal Logic for CSS in the HOL Theorem Prover. - Monica Nesi (TPHOLs, 1992)

Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences. - Michele Boreale; Paola Inverardi; Monica Nesi (Inf. Process. Lett., 1992)

Rewriting Properties of Combinators for Rudimentary Linear Logic. - Monica Nesi; Valeria de Paiva; Eike Ritter (HOA, 1993)

Value-Passing CCS in HOL. - Monica Nesi (HUG, 1993)

Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting. - Paola Inverardi; Monica Nesi (Theor. Comput. Sci., 1995)

Infinite Normal Forms for Non-Linear Term Rewritting Systems. - Paola Inverardi; Monica Nesi (Theor. Comput. Sci., 1995)

Mechanising a modal logic for value-passing agents in HOL. - Monica Nesi (INFINITY, 1996)

Formalising process calculi in higher order logic. - Monica Nesi (1997)

Adding sorts to TRSs: a result on modularity of termination. - Paola Inverardi; Monica Nesi (APPIA-GULP-PRODE, 1999)

Formalising a Value-Passing Calculus in HOL. - Monica Nesi (Formal Aspects Comput., 1999)

A rewriting strategy for protocol verification. - Monica Nesi; Giuseppina Rucci; Massimo Verdesca (WRS, 2003)

On structural properties of eta-expansions of identity. - Benedetto Intrigila; Monica Nesi (Inf. Process. Lett., 2003)

A declarative framework for adaptable applications in heterogeneous environments. - Paola Inverardi; Fabio Mancinelli; Monica Nesi (SAC, 2004)

Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting. - Monica Nesi; Giuseppina Rucci (ARSPA@ICALP, 2005)

Deriving the Type Flaw Attacks in the Otway-Rees Protocol by Rewriting. - Monica Nesi; Giustina Nocera (Nord. J. Comput., 2006)

A Service for Supporting Digital and Immersive Cultural Experiences. - Karthik Vaidhyanathan; Antonio Bruno; Eleonora Mendola; Filippo Mignosi; Mahyar Tourchi Moghaddam; Henry Muccini; Monica Nesi (CoRR, 2021)