Monica Nesi

25 papers A* 1B 1Misc 1Journal 8Unranked 13
YearRankTypeTitle / Venue / Authors
2021 J jnl
A Service for Supporting Digital and Immersive Cultural Experiences.
CoRR
Karthik Vaidhyanathan, Antonio Bruno, Eleonora Mendola, Filippo Mignosi, Mahyar Tourchi Moghaddam, Henry Muccini, Monica Nesi
2006 J jnl
Deriving the Type Flaw Attacks in the Otway-Rees Protocol by Rewriting.
Nord. J. Comput.
Monica Nesi, Giustina Nocera
2005 — conf
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting.
ARSPA@ICALP
Monica Nesi, Giuseppina Rucci
2004 Misc conf
A declarative framework for adaptable applications in heterogeneous environments.
SAC
Paola Inverardi, Fabio Mancinelli, Monica Nesi
2003 — conf
A rewriting strategy for protocol verification.
WRS
Monica Nesi, Giuseppina Rucci, Massimo Verdesca
2003 J jnl
On structural properties of eta-expansions of identity.
Inf. Process. Lett.
Benedetto Intrigila, Monica Nesi
1999 — conf
Adding sorts to TRSs: a result on modularity of termination.
APPIA-GULP-PRODE
Paola Inverardi, Monica Nesi
1999 J jnl
Formalising a Value-Passing Calculus in HOL.
Formal Aspects Comput.
Monica Nesi
1997 — —
Formalising process calculi in higher order logic.
Monica Nesi
1996 — conf
Mechanising a modal logic for value-passing agents in HOL.
INFINITY
Monica Nesi
1995 J jnl
Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting.
Theor. Comput. Sci.
Paola Inverardi, Monica Nesi
1995 J jnl
Infinite Normal Forms for Non-Linear Term Rewritting Systems.
Theor. Comput. Sci.
Paola Inverardi, Monica Nesi
1993 — conf
Rewriting Properties of Combinators for Rudimentary Linear Logic.
HOA
Monica Nesi, Valeria de Paiva, Eike Ritter
1993 — conf
Value-Passing CCS in HOL.
HUG
Monica Nesi
1992 — conf
A Strategy to Deal with Divergent Rewrite Systems.
CTRS
Paola Inverardi, Monica Nesi
1992 J jnl
Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences.
Inf. Process. Lett.
Michele Boreale, Paola Inverardi, Monica Nesi
1992 — conf
Formalizing a Modal Logic for CSS in the HOL Theorem Prover.
TPHOLs
Monica Nesi
1991 — conf
Combining Interaction and Automation in Process Algebra Verification.
TAPSOFT, Vol.2
Albert John Camilleri, Paola Inverardi, Monica Nesi
1991 — conf
Equational reasoning about LOTOS specifications: a rewriting approach.
IWSSD
Rocco De Nicola, Paola Inverardi, Monica Nesi
1991 B conf
Infinite Normal Forms for Non-Linear Term Rewriting Systems.
MFCS
Paola Inverardi, Monica Nesi
1991 A* conf
Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic.
CAV
Monica Nesi
1991 — conf
On Rewriting Behavioral Semantics in Process Algebras.
AMAST
Paola Inverardi, Monica Nesi
1990 J jnl
A Rewriting Strategy to Verify Observational Congruence.
Inf. Process. Lett.
Paola Inverardi, Monica Nesi
1989 — conf
Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications.
Automatic Verification Methods for Finite State Systems
Rocco De Nicola, Paola Inverardi, Monica Nesi
1988 — conf
A Logic-Functional Approach to the Execution of CCS Specifications Modulo Behavioural Equivalences.
Concurrency
Stefania Gnesi, Paola Inverardi, Monica Nesi