vRadhaJagadeesan, Alan Jeffrey, Corin Pitcher and James Riely.Confidential Safety Via correspondence
assertions. In FCS-PrivMod'10.14th European Symposium on Research in Computer Security. 2009. Paper available
on-line.

Memory Models &
Shared Memory Concurrency

vRadhaJagadeesan,
Gustavo Petri and James Riely.Brookes Is Relaxed, Almost! Foundations of
Software Science and Computational Structures - 15th International Conference,
FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice
of Software, ETAPS 2012. Lecture Notes in Computer Science7213 Springer 2012.pp 180—194. Paper available
online.

vGlenn
Bruns, RadhaJagadeesan, Alan Jeffrey and James Riely.mu-ABC: A minimal calculus
for aspect-oriented programs.In the
proceedings of the 2004 International Conference on Concurrency Theory.Lecture Notes in Computer Science 3170, pp
209-224.Springer.

vJ.
Desharnais and V. Gupta and R. Jagadeesan
and P. Panangaden. Approximating labeled
Markov processes. In the Proceedings of the IEEE Conference
on Logic in Computer Science, June 2000.To appear in Information and Computation.

vJ.
Desharnais and V. Gupta and R. Jagadeesan
and P. Panangaden. Metrics for
labeled Markov processes. In the Proceedings of the
International Conference on Concurrency theory 1999, Lecture Notes in Computer
Science.TO appear in Theoretical
Computer Science.

Models for
Concurrency

vV.
Gupta and R. Jagadeesan and V. A. Saraswat.
Truly
concurrent constraint programming. In Theoretical Computer Science,
278: 223-255, May 2002. Preliminary version in the proceedings of the
International Conference on Concurrency theory , Lecture Notes in Computer Science,
Vol. 1119, October 1996.

vV.
Gupta and R. Jagadeesan and V. A. Saraswat.
Models
of concurrent constraint programming. In the Proceedings of the
International Conference on Concurrency theory , Lecture Notes in Computer
Science, Vol. 1119, October 1996.

Linear Logic

vS.
Abramsky and R. Jagadeesan.
New
foundations for the Geometry of Interaction . In Information
and Computation ,
111(1):53-119, May 1994. Preliminary version appeared in the Proceedings of the
7th Annual IEEE Symposium on Logic in Computer Science, June 1992.

vS.
Abramsky and R. Jagadeesan.
Games
and Full Completeness for Multiplicative Linear Logic. In Journal of
Symbolic Logic ,
59(2): 543-574. June 1994. Preliminary version appeared in the Proceedings of
the Conference on Foundations of Software Technology and Theoretical Computer
Science, December 1992.

This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or by
other copyright holders. All persons copying this information are expected to
adhere to the terms and constraints invoked by each author's copyright. In most
cases, these works may not be reposted without the explicit permission of the
copyright holder. Some of this material is based upon work supported by the
National Science Foundation. Any opinions, findings and conclusions or recomendations expressed in this material are those of the
author(s) and do not necessarily reflect the views of the National Science
Foundation (NSF).