Monica Nesi

Affiliations:
  • University of L'Aquila, Italy


According to our database1, Monica Nesi authored at least 25 papers between 1988 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Service for Supporting Digital and Immersive Cultural Experiences.
CoRR, 2021

2006
Deriving the Type Flaw Attacks in the Otway-Rees Protocol by Rewriting.
Nord. J. Comput., 2006

2005
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting.
Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis, 2005

2004
A declarative framework for adaptable applications in heterogeneous environments.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

2003
On structural properties of eta-expansions of identity.
Inf. Process. Lett., 2003

A rewriting strategy for protocol verification.
Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, 2003

1999
Formalising a Value-Passing Calculus in HOL.
Formal Aspects Comput., 1999

Adding sorts to TRSs: a result on modularity of termination.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1997
Formalising process calculi in higher order logic.
PhD thesis, 1997

1996
Mechanising a modal logic for value-passing agents in HOL.
Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

1995
Infinite Normal Forms for Non-Linear Term Rewritting Systems.
Theor. Comput. Sci., 1995

Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting.
Theor. Comput. Sci., 1995

1993
Value-Passing CCS in HOL.
Proceedings of the Higher Order Logic Theorem Proving and its Applications, 1993

Rewriting Properties of Combinators for Rudimentary Linear Logic.
Proceedings of the Higher-Order Algebra, 1993

1992
Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences.
Inf. Process. Lett., 1992

Formalizing a Modal Logic for CSS in the HOL Theorem Prover.
Proceedings of the Higher Order Logic Theorem Proving and its Applications, 1992

A Strategy to Deal with Divergent Rewrite Systems.
Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

1991
Combining Interaction and Automation in Process Algebra Verification.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Infinite Normal Forms for Non-Linear Term Rewriting Systems.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Equational reasoning about LOTOS specifications: a rewriting approach.
Proceedings of the 6th International Workshop on Software Specification and Design, 1991

Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

On Rewriting Behavioral Semantics in Process Algebras.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
A Rewriting Strategy to Verify Observational Congruence.
Inf. Process. Lett., 1990

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

1988
A Logic-Functional Approach to the Execution of CCS Specifications Modulo Behavioural Equivalences.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988


  Loading...