PUBLICATIONS

Note: In case of problems downloading, please send me email at rjagadeesan@cs.depaul.edu

Security: Controls

· Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, James Riely . TAPIDO: Trust and Authorization via Provenance and Integrity in Distributed Objects. In ESOP'08 17th European Symposium on Programming. 2008. Extended version of ESOP paper with type and effect system and results available on-line.

· Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, James Riely. Do As I SaY! Programmatic Access Control with Explicit Identities.. In Computer Security Foundations Symposium (CSF). 2007. Extended version of CSF paper with several typos and minor bugs fixed available on-line.

· Bin Zhang, Ehab Al-Shaer, Radha Jagadeesan, James Riely, Corin Pitcher. Specifications of A High-level Conflict-Free Firewall Policy Language for Multi-domain Networks.. In Proc. ACM symposium on access control models and technologies (SACMAT), 2007.

• Krishnendu Chatterjee, Radha Jagadeesan and Corin Pitcher. Games for Controls. In Computer Security Foundations Workshop, 2006.
• Radha Jagadeesan, Alan Jeffrey, Corin Pitcher and James Riely. Lambda-RBAC: Programmatic Role-Based Access Control . In ICALP 2006, 2006. Extended version from Logical Methods In Computer Science, VOLUME 4, ISSUE 1, PAPER 2.
• Vijay Saraswat and Radha Jagadeesan. Static support for capability-based programming in Java. Vijay's slides from an hour talk.
• Radha Jagadeesan and Will Marrero and Corin Pitcher and Vijay Saraswat. Timed Constraint Programming: A Declarative Approach to Usage Control. In the proceedings of Principles and Practice of Declarative Programming 2005, pp 164-175. ACM 2005. Pitcher’s slides from PPDP 05 talk.

Aspect Oriented Programming.

• Radha Jagadeesan, Corin Pitcher and James Riely. Open bisimulation for aspects. In the proceedings of the International Conference on Aspect-Oriented System Development, 2007, pp 107-120, ACM Press. (version with some proofs)
• Radha Jagadeesan, Alan Jeffrey and James Riely. Typed Parametric Polymorphism for Aspects . Science of Computer Programming, 63(3), pp. 267-296, 2006.
• Glenn Bruns, Radha Jagadeesan, 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.
• Radha Jagadeesan, Alan Jeffrey and James Riely. An untyped calculus for aspect oriented programs. In the proceedings of the 2003 European Conference on Object Oriented Programming. Lecture Notes in Computer Science, vol. 2743, pp 54-73, Springer. Slides from a 25 min talk.
• Radha Jagadeesan, Alan Jeffrey and James Riely. A typed calculus for aspect oriented programs. Unpublished. Largely superceded conceptually by paper in Science of Computer Programming above.

Languages for High-Performance Computing.

• V. A. Saraswat, R. Jagadeesan, M. Maged, C. von Praun . A Theory of Memory Models. In The ACM SIGPLAN 2007 Symposium on Principles and Practice of Parallel Programming.
• Vijay Saraswat and Radha Jagadeesan. Concurrent Clustered Programming. In the proceedings of the 2005 International Conference on Concurrency Theory.

Abstractions for software model-checking.

• Luca de Alfaro and Patrice Godefroid and Radha Jagadeesan. Three-Valued Abstractions of Games: Uncertainty, but with Precision. In LICS 04: Proceedings of 19th IEEE Symposium on Logic in Computer Science, 2004. Slides from a 25 minute talk.
• Patrice Godefroid and Radha Jagadeesan. On The Expressiveness of 3-Valued Models . Proceedings of VMCAI'2003 (4th Conference on Verification, Model Checking and Abstract Interpretation), New York, January 2003. Lecture Notes in Computer Science, vol. 2575, pages, 206-222, Springer-Verlag.
• Patrice Godefroid and Radha Jagadeesan. Automatic Abstraction Using Generalized Model Checking. In the Proceedings of the 14^th International conference on Computer Aided Verificaiton, 2002. Lecture Notes in Computer Science, Vol. 2044.
• Patrice Godefroid, Michael Huth and Radha Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In `the International Conference on Concurrency Theory, August 2001. Lecture Notes in Computer Science, Vol. 2154.
• Michael Huth, R. Jagadeesan and D. Schmidt. Modal Transition Systems: A foundation for three-valued program analysis. In the European Symposium on Programming, April 2001. Lecture Notes in Computer Science, Vol. 2028. Full paper. Mathematical Structures in Computer Science 2004(14), 469—505.

Triveni and related stuff.

• Patrice Godefroid, Lalita J Jagadeesan, R. Jagadeesan, and K. Läufer. Automated Systematic Testing for Constraint-Based Interactive Services. In the Proceedings of Foundations of Software Engineering, San Diego, CA, November 2000.
• T. Ball, C. Colby, P. Danielsen, Lalita J. Jagadeesan, R. Jagadeesan, K. Läufer, P. Mataga, and K. Rehor. Sisl: several interfaces, single logic. 3 (2):91-106, International Journal of Speech Technology, June 2000. Copyright © 2000 Kluwer Academic Publishers.
• V. Gupta, Lalita J. Jagadeesan, R. Jagadeesan, XiaoWei Jiang and K. Läufer. A constraint based framework for prototyping distributed virtual applications. In the Proceedings of the workshop on Constraint Programming, October 2000. Lecture notes in Computer Science.
• C. Colby and Lalita J. Jagadeesan and R. Jagadeesan and K. Laufer and C. Puchol. Objects and Processes in Triveni: A case study from telecommunications in Java. Proceedings of the 1998 USENIX Conference on Object Oriented Technologies and Systems. Usenix publications.
• C. Colby and Lalita J. Jagadeesan and R. Jagadeesan and K. Laufer and C. Puchol. Design and Implementation of Triveni - A process algebraic API for threads + events. Proceedings of the 1998 IEEE International Conference on Computer Languages. IEEE Press.
• C. Colby and Lalita J. Jagadeesan and R. Jagadeesan and K. Laufer and C. Puchol. Semantics of Triveni - A process algebraic API for threads + events. Electronic Notes in Theoretical Computer Science, Vol. 14 (1999).
• C. Colby and R. Jagadeesan and K. Laufer and C. Sekharan. Interaction and Concurrency in the curriculum - A sophomore course . In the Proceedings of the 1998 OOPSLA Workshop on Education.

Probability and Stochastic Processes.

• R. Jagadeesan. Slides from an invited talk at MFPS 04. Approximate reasoning for real-time probabilistic processes. 1 Hour talk. Broad survey of several of the following papers.
• Vineet Gupta and R. Jagadeesan and P. Panangaden. Approximate reasoning for real-time probabilistic processes. In the Proceedings of 2004 First IEEE conference QEST. IEEE Press. Full version in the Logical Methods in Computer Science.
• J. Desharnais and V. Gupta and R. Jagadeesan and P. Panangaden. Weak bisimulation is sound and complete for PCTL*. In the Proceedings of the International Conference on Concurrency Theory, 2002.
• J. Desharnais and V. Gupta and R. Jagadeesan and P. Panangaden. The Metric analogue of weak bisimulation for probabilistic processes. In the Proceedings of the IEEE Conference on Logic in Computer Science, 2002.
• J. 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.
• J. 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.
• V. Gupta and R. Jagadeesan and P. Panangaden. Stochastic programs as concurrent constraint programs . In the 1999 ACM Symposium on Principles of Programming languages.
• V. Gupta and R. Jagadeesan and V. A. Saraswat. Probabilistic concurrent constraint programming. In the Proceedings of the the International Conference on Concurrency theory , Lecture Notes in Computer Science, Vol. , October 1997.

Models for Concurrency.

• R. Jagadeesan and A. Jefferey and R. Riely. An untyped calculus of aspect oriented programming. In ECOOP 2003.
• V. 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.
• V. 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.
• L. Jagadeesan and R. Jagadeesan. Causality and True Concurrency: A Dataflow Analysis of the Pi-Calculus. In Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology, Lecture Notes in Computer Science, Vol. 936, July 1995.
• R. Jagadeesan and P. Panangaden. A Domain-theoretic Model for a Higher-order Process Calculus. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming , Lecture Notes in Computer Science, Vol. Vol. 443, July 1990.
• R. Jagadeesan, P. Panangaden and K. Pingali. A fully-abstract semantics for a first order functional language with logic variables. In ACM Transactions on Programming Languages and Systems , 13(4): 577-625, October 1991. Preliminary version appeared in the Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science, 294-303, June 1989.
• R. Jagadeesan and K. Pingali. Abstract semantics for a higher order functional language with logic variables. In the Proceedings of the 19th Annual ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages , January 1992.
• R. Jagadeesan. L-Domains and Lossless Powerdomains. In Proceedings of the 5th Conference on Mathematical Foundations of Programming Semantics, , March 1989, Lecture Notes in Computer Science, Vol. 439.

Linear Logic

• S. Abramsky and R. Jagadeesan. A game semantics for generic polymorphism. To appear in FOSSACS 2003. To appear in the Annals of Pure and Applied Logic.
• S. 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.
• S. 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.
• S. Abramsky and R. Jagadeesan and P. Malacaria. Games and Full Abstraction for PCF. In the proceedings of the International Symposium on Theoretical Aspects of Computer Software , Lecture Notes in Computer Science,Vol. 789. Information and Computation 163(2), 409-470, 2000.Full version of the paper.

Reactive and Hybrid Systems

• V. A. Saraswat and R. Jagadeesan and V. Gupta. jcc: Integrating Timed Default Concurrent Constraint Programming into Java. EPIA 2003. Lecture Notes in Artificial Intelligence, Vol. 2902, 156-170. Slides from a 25 min talk.
• V. A. Saraswat and R. Jagadeesan and V. Gupta. Timed Default concurrent constraint programming. In Journal of Symbolic computation , 22(5,6) 475-520, 1996, Preliminary version appeared in the Proceedings of the 22nd Annual ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages, January 1995.
• V. Gupta and R. Jagadeesan and V. A. Saraswat. Computing with continuous change. In the Science of Computer Programming , 30(1,2) 3-49, 1998.
• V. A. Saraswat and R. Jagadeesan and V. Gupta. Foundations of timed concurrent constraint programming. In the proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science , July 1994. Errata.
• V. A. Saraswat and R. Jagadeesan and V. Gupta. Programming in Timed concurrent constraint Language. In Constraint Programming , NATO Advanced Science Institute Series, Series F: Computer and System Sciences, Vol 131, edited by B Mayoh, E Tougu and J Penjam, Chapter 4, 1994.
• D. G. Bobrow and V. Gupta and R. Jagadeesan and V. A. Saraswat. Programming in Hybrid concurrent constraint Language. In proceedings of the workshop on Hybrid systems , Lecture notes in Computer Science, Hybrid Systems II, Vol. 999.
• V. Gupta and R. Jagadeesan and V. A. Saraswat. Hybrid cc, Hybrid automata and Program verification. In proceedings of the DIMACS/ SYCON workshop on Verification and Control of Hybrid systems , Lecture notes in Computer Science, Hybrid Systems III, Vol 1068.
• V. Gupta and T. Henzinger and R. Jagadeesan. Robust timed automata. In proceedings of the Hybrid and Real time systems workshop , Lecture notes in Computer Science, Hybrid Systems III, Vol 1201, 1997.

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).