| 2006 | ||
|---|---|---|
| j10 | 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 | ||
| j9 | 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 | ||
| c12 | Paola Inverardi, Fabio Mancinelli, Monica Nesi: A declarative framework for adaptable applications in heterogeneous environments. SAC 2004: 1177-1183 | |
| 2003 | ||
| j8 | Monica Nesi, Giuseppina Rucci, Massimo Verdesca: A rewriting strategy for protocol verification. Electr. Notes Theor. Comput. Sci. 86(4): 657-672 (2003) | |
| j7 | Benedetto Intrigila, Monica Nesi: On structural properties of eta-expansions of identity. Inf. Process. Lett. 87(6): 327-333 (2003) | |
| 1999 | ||
| j6 | ||
| c11 | Paola Inverardi, Monica Nesi: Adding sorts to TRSs: a result on modularity of termination. APPIA-GULP-PRODE 1999: 273-288 | |
| 1996 | ||
| j5 | Monica Nesi: Mechanising a modal logic for value-passing agents in HOL. Electr. Notes Theor. Comput. Sci. 5: 31-46 (1996) | |
| 1995 | ||
| j4 | Paola Inverardi, Monica Nesi: Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting. Theor. Comput. Sci. 139(1&2): 315-354 (1995) | |
| j3 | Paola Inverardi, Monica Nesi: Infinite Normal Forms for Non-Linear Term Rewritting Systems. Theor. Comput. Sci. 152(2): 285-303 (1995) | |
| 1993 | ||
| c10 | Monica Nesi, Valeria de Paiva, Eike Ritter: Rewriting Properties of Combinators for Rudimentary Linear Logic. HOA 1993: 256-275 | |
| c9 | ||
| 1992 | ||
| j2 | Michele Boreale, Paola Inverardi, Monica Nesi: Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences. Inf. Process. Lett. 43(3): 155-160 (1992) | |
| c8 | ||
| c7 | ||
| 1991 | ||
| c6 | Paola Inverardi, Monica Nesi: On Rewriting Behavioral Semantics in Process Algebras. AMAST 1991: 108-116 | |
| c5 | Monica Nesi: Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic. CAV 1991: 288-298 | |
| c4 | Paola Inverardi, Monica Nesi: Infinite Normal Forms for Non-Linear Term Rewriting Systems. MFCS 1991: 231-239 | |
| c3 | Albert John Camilleri, Paola Inverardi, Monica Nesi: Combining Interaction and Automation in Process Algebra Verification. TAPSOFT, Vol.2 1991: 283-296 | |
| 1990 | ||
| j1 | Paola Inverardi, Monica Nesi: A Rewriting Strategy to Verify Observational Congruence. Inf. Process. Lett. 35(4): 191-199 (1990) | |
| 1989 | ||
| c2 | 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 | ||
| c1 | Stefania Gnesi, Paola Inverardi, Monica Nesi: A Logic-Functional Approach to the Execution of CCS Specifications Modulo Behavioural Equivalences. Concurrency 1988: 181-196 | |
Colors in the list of coauthors
Last update Thu May 23 03:03:52 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page