| 2006 |
|---|
| 22 | | Monica Nesi,
Giustina Nocera:
Deriving the Type Flaw Attacks in the Otway-Rees Protocol by Rewriting.
Nord. J. Comput. 13(1-2): 78-97 (2006) |
| 2005 |
|---|
| 21 | EE | Monica Nesi,
Giuseppina Rucci:
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting.
Electr. Notes Theor. Comput. Sci. 135(1): 95-114 (2005) |
| 2004 |
|---|
| 20 | EE | Paola Inverardi,
Fabio Mancinelli,
Monica Nesi:
A declarative framework for adaptable applications in heterogeneous environments.
SAC 2004: 1177-1183 |
| 2003 |
|---|
| 19 | EE | Monica Nesi,
Giuseppina Rucci,
Massimo Verdesca:
A rewriting strategy for protocol verification.
Electr. Notes Theor. Comput. Sci. 86(4): (2003) |
| 18 | EE | Benedetto Intrigila,
Monica Nesi:
On structural properties of eta-expansions of identity.
Inf. Process. Lett. 87(6): 327-333 (2003) |
| 1999 |
|---|
| 17 | | Paola Inverardi,
Monica Nesi:
Adding sorts to TRSs: a result on modularity of termination.
APPIA-GULP-PRODE 1999: 273-288 |
| 16 | EE | Monica Nesi:
Formalising a Value-Passing Calculus in HOL.
Formal Asp. Comput. 11(2): 160-199 (1999) |
| 1996 |
|---|
| 15 | EE | Monica Nesi:
Mechanising a modal logic for value-passing agents in HOL.
Electr. Notes Theor. Comput. Sci. 5: (1996) |
| 1995 |
|---|
| 14 | EE | Paola Inverardi,
Monica Nesi:
Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting.
Theor. Comput. Sci. 139(1&2): 315-354 (1995) |
| 13 | EE | Paola Inverardi,
Monica Nesi:
Infinite Normal Forms for Non-Linear Term Rewritting Systems.
Theor. Comput. Sci. 152(2): 285-303 (1995) |
| 1993 |
|---|
| 12 | | Monica Nesi,
Valeria de Paiva,
Eike Ritter:
Rewriting Properties of Combinators for Rudimentary Linear Logic.
HOA 1993: 256-275 |
| 11 | | Monica Nesi:
Value-Passing CCS in HOL.
HUG 1993: 352-365 |
| 1992 |
|---|
| 10 | | Paola Inverardi,
Monica Nesi:
A Strategy to Deal with Divergent Rewrite Systems.
CTRS 1992: 458-467 |
| 9 | | Monica Nesi:
Formalizing a Modal Logic for CSS in the HOL Theorem Prover.
TPHOLs 1992: 279-294 |
| 8 | | Michele Boreale,
Paola Inverardi,
Monica Nesi:
Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences.
Inf. Process. Lett. 43(3): 155-160 (1992) |
| 1991 |
|---|
| 7 | | Paola Inverardi,
Monica Nesi:
On Rewriting Behavioral Semantics in Process Algebras.
AMAST 1991: 108-116 |
| 6 | | Monica Nesi:
Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic.
CAV 1991: 288-298 |
| 5 | | Paola Inverardi,
Monica Nesi:
Infinite Normal Forms for Non-Linear Term Rewriting Systems.
MFCS 1991: 231-239 |
| 4 | | Albert John Camilleri,
Paola Inverardi,
Monica Nesi:
Combining Interaction and Automation in Process Algebra Verification.
TAPSOFT, Vol.2 1991: 283-296 |
| 1990 |
|---|
| 3 | | Paola Inverardi,
Monica Nesi:
A Rewriting Strategy to Verify Observational Congruence.
Inf. Process. Lett. 35(4): 191-199 (1990) |
| 1989 |
|---|
| 2 | | Rocco De Nicola,
Paola Inverardi,
Monica Nesi:
Using the Adxiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications.
Automatic Verification Methods for Finite State Systems 1989: 54-67 |
| 1988 |
|---|
| 1 | | Stefania Gnesi,
Paola Inverardi,
Monica Nesi:
A Logic-Functional Approach to the Execution of CCS Specifications Modulo Behavioural Equivalences.
Concurrency 1988: 181-196 |
