PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Nesi, Monica"

Author of the publication

copydeleteadd this publication to your clipboard
A Rewriting Strategy to Verify Observational Congruence.

, and . Inf. Process. Lett., 35 (4): 191-199 (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Monica Mead University of Stuttgart

 

Other publications of authors with the same name

Formalizing a Modal Logic for CSS in the HOL Theorem Prover.. TPHOLs, volume A-20 of IFIP Transactions, page 279-294. North-Holland/Elsevier, (1992)Adding sorts to TRSs: a result on modularity of termination., and . APPIA-GULP-PRODE, page 273-288. (1999)Combining Interaction and Automation in Process Algebra Verification., , and . TAPSOFT, Vol.2, volume 494 of Lecture Notes in Computer Science, page 283-296. Springer, (1991)Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting., and . Theor. Comput. Sci., 139 (1&2): 315-354 (1995)Formalising a Value-Passing Calculus in HOL.. Formal Asp. Comput., 11 (2): 160-199 (1999)On structural properties of eta-expansions of identity., and . Inf. Process. Lett., 87 (6): 327-333 (2003)Using the Adxiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications., , and . Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, page 54-67. Springer, (1989)Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting., and . Electron. Notes Theor. Comput. Sci., 135 (1): 95-114 (2005)Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences., , and . Inf. Process. Lett., 43 (3): 155-160 (1992)Infinite Normal Forms for Non-Linear Term Rewritting Systems., and . Theor. Comput. Sci., 152 (2): 285-303 (1995)