Journal Papers
Research partially supported by National Science Foundation grants
EIA-9806835, CCR-0209205, CCR-0296182, ITR-0326577, CNS-0627748;
EPSRC grant GR/S03539; IBM T.J. Watson Research Center; Microsoft Research.
Co-authors:
Martín Abadi,
Torben Amtoft,
Sruthi Bandhakavi,
Mike Barnett,
Matthew B. Dwyer,
John Hatcliff,
Nevin Heintze,
Thomas Jensen,
Gurvan Le Guernic ,
David A. Naumann,
Marco Pistoia,
Venkatesh P. Ranganath,
Jon G. Riecke, Stan Rosenberg,
David A. Schmidt,
Qi Sun
-
Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, Matthew B. Dwyer and John Hatcliff.
A New Foundation for Control-Dependence and Slicing for
Modern Program Structures.
ACM Transactions on Programming Languages and Systems (TOPLAS) 29(5),
August 2007.
-
Torben Amtoft and Anindya Banerjee.
A Logic for Information Flow Analysis with an Application to
Forward Slicing of Simple Imperative Programs.
PDF;
Science of Computer Programming 64(1), pp. 3-28, January 2007.
-
Anindya Banerjee and David A. Naumann.
Ownership Confinement Ensures Representation Independence in
Object-Oriented Programs.
Journal of the ACM 52(6), pp. 894-960, November 2005.
PDF;
Technical Report KSU CIS-TR-2004-6
and SIT CS-TR-2004-14.
-
Anindya Banerjee and David A. Naumann.
Stack-based Access Control and Secure Information Flow.
Journal of Functional Programming 15(2), pp. 131-177,
Special issue on Language-based Security, March 2005.
PDF;
-
Anindya Banerjee and Thomas Jensen.
Modular Control-flow Analysis with Rank 2 Intersection Types.
Mathematical Structures in Computer Science 13(1), pp. 87-124,
February 2003.
Cambridge University Press.
PDF (Preprint)
-
Anindya Banerjee and David A. Schmidt.
Stackability in the Simply-Typed Call-by-Value Lambda Calculus.
Science of Computer Programming, Volume 31, pp. 47-73, 1998.
PS (Preprint)