Proving Termination Assertions in Dynamic Logics

  • Authors:

  • Daniel Leivant

  • Affiliations:

  • Indiana University

  • Venue:
  • LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ...