Electronic Notes in Theoretical Computer Science, Volume 20
MFPS XV Mathematical Foundations of Progamming Semantics, Fifteenth Conference
Tulane University, New Orleans, LA, April 28-May 1, 1999
Martín Abadi:
Secrecy in Programming-Language Semantics. 80-94 Dominique Bolignano:
Using Abstract Interpretation for the Safe Verification of Security Protocols. 95-116 George C. Necula:
Enforcing Security and Safety with Proof-Carrying Code. 117-131 Paul Syvreson:
Towards a Strand Semantics for Authentication Logic. 143-157 Stephen D. Brookes:
Reasoning About Recursive Processes: Expansion is not Always Fair. 182-201 Hongde Hu:
Contractible Coherence Spaces and Maximal Maps. 309-319 C. Barry Jay:
Denotational Semantics of Shape: Past, Present and Future. 320-333 Ralph Kummetz:
From Partial Orders with Projections to Domains. 334-345 S. Lassen:
Bisimulation in Untyped Lambda Calculus: Böhm Trees and Bisimulation up to Context. 346-374 Lawrence S. Moss:
Recursion and Corecursion Have the Same Equational Logic. 413-432 Susan Older:
Strong fairness and Recursive Communicating Processes. 433-448 J. Polokow,
Frank Pfenning:
Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic. 449-466
maintained by

at
