In reverse chronological order within topics. Rather than cross-list I've chosen arbitrarily in cases that fit multiple topics. Here is a file with BibTeX entries.
(See also section 1.3.)
Expressive declassification policies and modular static enforcement, with Anindya Banerjee and Stan Rosenberg, in 29th IEEE Symposium on Security and Privacy, May 2008, 339-353.
Towards a Logical Account of Declassification (Short Paper), with Anindya Banerjee and Stan Rosenberg, in ACM SIGPLAN workshop on Programming Languages and Analysis for Security 2007, 61-66. Here is a talk on recent advances.
Beyond stack inspection: a unified access-control and information-flow security model, with Marco Pistoia and Anindya Banerjee, in 28th IEEE Symposium on Security and Privacy, May 2007, 149-163.
Closing internal timing channels by transformation, with Alejandro Russo, John Hughes, and Andrei Sabelfeld, to appear in 11th Asian Computing Science Conference, Tokyo, Dec 2006.
From coupling relations to mated invariants for checking information flow (extended abstract), in ESORICS 2006 (European Symposium on Research in Computer Security), LNCS 4189, 279-296.
Deriving an Information Flow Checker and certifying compiler for Java, with Gilles Barthe and Tamara Rezk, in 27th IEEE Symposium on Security and Privacy, May 2006 230-242.
History-based access control and secure information flow, with Anindya Banerjee, in Proceedings of the workshop on Construction and Analysis of Safe, Secure and Interoperable Smart Cards (CASSIS), May 2004.
Modular and constraint-based information flow inference for an object-oriented language, in 11th International Static Analysis Symposium SAS 2004 84-99 (with Qi Sun and Anindya Banerjee).
Stack-based Access Control for Secure Information Flow, Sept 2003 (with Anindya Banerjee). Journal of Functional Programming (2005) 15(2) 131-177, special issue on Language Based Security. This supersedes our CSFW 2002 and CSFW 2003 papers.
A simple semantics and static analysis for Java security, SIT Report 2001-1 (with Anindya Banerjee). (There is also a short version: A simple static analysis for Java security, June 2001 (with Anindya Banerjee).
Category theoretic models of data refinement, with Michael Johnson and John Power. Proceedings of Irish Conference on Mathmatical Foundations of Computer Science and Information Technology MFCSIT (2006), invited paper, to appear.
State based ownership, reentrance, and encapsulation, in ECOOP 2005, 387-411 (with Anindya Banerjee).
State based encapsulation and generics, Dec 2004 Technical Report CS-2004-11, Stevens Institute of Technology and KSU CIS-TR-2004-5 (with Anindya Banerjee)
Ownership Confinement Ensures Representation Independence for Object-oriented Programs, (with Anindya Banerjee), Journal of the ACM 52(6) (2005) 894-960. This supersedes the following POPL version.
Forward simulation for data refinement of classes, Proceedings of Formal Methods Europe FME'2002, LNCS 2391, 471-490 (with Ana Cavalcanti). There is an Extended Version, SIT Report 2001-4.
Soundness of data refinement for a higher order imperative language, Theoretical Computer Science 278 (2002) 271-301. (Also appeared as SIT Report 9905.)
Data refinement, call by value, and higher order programs, Formal Aspects of Computing 7 (1995) 652-662.
Boogie Meets Regions: a Verification Experience Report, with Anindya Banerjee and Mike Barnett. To appear in VSTTE 2008. The BoogiePL files can be found here and in the Microsoft Tech Report.
An admissible second order frame rule in region logic, Mar 2008, Stevens CS TR-2008-02. There is a shorter version.
Regional Logic for Local Reasoning about Global Invariants, with Anindya Banerjee and Stan Rosenberg. In European Conference on Object Oriented Programming, ECOOP 2008. Won the ECOOP 2008 Distinguished Paper Award.
Modular Verification of Higher-Order Methods with Mandatory Calls Specified by Model Programs, in Object Oriented Programming, Languages, and Systems OOPSLA (2007) with Steve M. Shaner and Gary T. Leavens (Iowa State University TR-07-04). Awarded Best Student Paper.
Behavioral Subtyping is Equivalent to Modular Reasoning for Object-oriented Programs, March 2007, with Gary T. Leavens. The technical report is Iowa State University TR-06-36.
On assertion-based encapsulation for object invariants and simulations, Formal Aspects of Computing 19(2) 2007, 205-224. Supersedes the VSTTE position paper 2005.
Preliminary Definition of Core JML, Sept 2006, with Gary T. Leavens and Stan Rosenberg (Stevens Institute of Technology CS Report 2006-07). See also the PVS source files.
Behavioral Subtyping, Specification Inheritance, and Modular Reasoning, July 2006, with Gary Leavens (Iowa State University TR-06-20).
Allowing State Changes in Specifications, invited paper in International Conference on Emerging Trends in Information and Communication Security, with Mike Barnett, Wolfram Schulte, and Qi Sun.
Observational purity and encapsulation, Theoretical Computer Science 376 (2007) 205-224. This supersedes the conference version which appeared in Fundamental Aspects of Software Engineering (FASE) 2005 and was awarded Best Software Science Paper by the EASST at ETAPS 2005. Here are the slides.
Towards imperative modules: Reasoning about invariants and sharing of mutable state. In Theoretical Computer Science 365 (2006) 143-168. This supersedes the LICS version.
Assertion-based encapsulation, invariants and simulations, July 2005 (survey paper, in proceedings of Formal Methods for Components and Objects FMCO 2004.
Verifying a secure information flow analyzer, In Theorem Proving in Higher Order Logics (TPHOLS), 211-226, 2005. Here are the PVS files and tech report.
Friends need a bit more: Maintaining invariants over shared state , in Mathematics of Program Construction 2004 (with Mike Barnett).
On a specification-oriented model for object-orientation, Proceedings of Sixth Brazilian Symposium on Programming Languages, 114-127 (2002) (with Ana Cavalcanti).
Predicate transformer semantics of a higher order imperative language with record subtypes, Science of Computer Programming 41, 1 (2001) 1-51.
Calculating Sharp Adaptation Rules, Information Processing Letters 7 (2000) 201-208.
A Weakest Precondition Semantics for Refinement of Object-oriented Programs, IEEE Transactions on Software Engineering 26, 8 (2000) 713-728 (with Ana Cavalcanti). There is an Extended Version, SIT Report 99-03.
Ideal models for pointwise relational and state-free imperative programming. Proceedings of ACM Principles and Practice of Declarative Programming (2001) 4-15.
The preceding paper is based on An ideal model for pointwise relational programming, SIT Report 20-04 (Dec. 2000), and it is further extended in Patterns, heaps, and imperative lambdas, Jan. 2002, and Patterns and lax lambda laws for relational and imperative programming, SIT Report 2001-2.
Beyond Fun: order and membership in polytypic imperative programming, Proceedings of Mathematics of Program Construction, LNCS 1442 (1998) 286-314.
Towards squiggly refinement algebra, in Programming Concepts and Methods, David Gries and Willem-Paul de Roever, eds, Chapman and Hall (1998) 346-365.
A categorical model of higher order imperative programming, Mathematical Structures in Computer Science 8, 4 (1998) 351-399. (Here is a preprint).
Predicate transformers and higher order programs, Theoretical Computer Science 150 (1995) 111-159. (Here is a preprint).
A recursion theorem for predicate transformers on inductive data types, Information Processing Letters 50 (1994) 329-336 (Here is a preprint.)
CodeBLUE: a Bluetooth interactive dance club system, in IEEE Global Telecommunications Conference GLOBECOM (2003) 2814-2818. (with Dennis Hromin, Michael Chladil, Natalie Vanatta, Susanne Wetzel, Farooq Anjum, and Ravi Jain).
High assurance for interactive applications in ad hoc networks, Proceedings of First International Workshop on Wireless Security Technologies, London, April 2003 (with Susanne Wetzel).
codeBLUE: a Bluetooth interactive dance club system, May 2002 (with Dennis Hromin, Michael Chladil, Natalie Vanatta, Farooq Anjum, and Ravi Jain). SIT Report 2002-1.
Program derivation for freshmen, Proceedings of ACM Conference of the Special Interest Group in Computer Science Education 1994 (with R. Denman, W. Potter, and G. Richter).
A categorical algebra of programs, course module in Proceedings of Workshop on Teaching Formal Methods to Undergraduates 1994.
Two-categories and program structure, PhD thesis 1992.
A common sense management model, IEEE Software, Nov. 1991 (with R.T. Yeh et al.)