Previous Up Next

1  Selected papers by general topic

Rather than cross-list I’ve chosen arbitrarily in cases that fit multiple topics. For superseded conference and workshop versions, see section .

1.1  Security and secure information flow

Spartan Jester: end-to-end information flow control for hybrid Android applications, with Julian Sexton and Andrey Chudnov. In Mobile Security Technologies workshop (2017) to appear.

Hypercollecting semantics and its application to static analysis of information flow, with Mounir Assaf, Julien Signoles, Éric Totel, and Frédéric Tronel). In 44th ACM Symposium on Principles of Programming Languages (2017).

Calculational design of information flow monitors, with Mounir Assaf. In IEEE Computer Security Foundations Symposium (2016) 210–224.

Inlined information flow monitoring for JavaScript, with Andrey Chudnov. In ACM Conference on Computer and Communication Security (2015) 629–643.

Information flow monitoring as abstract interpretation for relational logic, with Andrey Chudnov and George Kuan. In IEEE Computer Security Foundations Symposium 2014.

Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols, with François Dupressoir, Andrew D. Gordon, and Jan Jürjens. In Journal of Computer Security 22 (2014) 823-866.

A Simple Semantics and Static Analysis for Stack Inspection, with Anindya Banerjee. In Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday, EPTCS 129, September 2013, 284–308. (DOI: 10.4204/EPTCS.129, ISSN: 2075-2180, link).

Analysis of authentication and key establishment in inter-generational mobile telephony (long version), with Chunyu Tang and Susanne Wetzel. In the 4th International Symposium on Trust, Security and Privacy for Emerging Applications (TSP 2013).

Symbolic Analysis for Security of Roaming Protocols in Mobile Networks [Extended Abstract], with Chunyu Tang and Susanne Wetzel. In 7th International ICST Conference on Security and Privacy in Communication Networks (SecureComm), Sept 2011, 480–490.

Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols, with François Dupressoir, Andrew D. Gordon, and Jan Jürjens. In IEEE Computer Security Foundations Symposium, July 2011. Extended version as Microsoft MSR–TR–2011–50.

Information Flow Monitor Inlining, with Andrey Chudnov. In IEEE Computer Security Foundations Symposium, July 2010, 200–214. See also slightly older version with proofs.

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.

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. 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, with Qi Sun and Anindya Banerjee. In 11th International Static Analysis Symposium SAS 2004 84–99

Stack-based Access Control for Secure Information Flow, with Anindya Banerjee. In Journal of Functional Programming (2005) 15(2) 131–177, special issue on Language Based Security. This supersedes our CSFW 2002 and CSFW 2003 papers.

1.2  Data refinement and representation-independence

State Based Encapsulation for Modular Reasoning about Behavior-Preserving Refactorings, with Anindya Banerjee. Invited chapter in Aliasing in Object-oriented Programming, Dave Clarke and James Noble and Tobias Wrigstad, eds., Springer State-of-the-art Surveys, 2012.

Refactoring and representation independence for class hierarchies, with Leila Silva and Augusto Sampaio. Theoretical Computer Science 433 (2012) 60–97. This supersedes our FTfJP 2010 paper.

Category theoretic models of data refinement, with Michael Johnson and John Power. In Electronic Notes in Theoretical Computer Science 225(2) 21–38. Proceedings of Irish Conference on Mathmatical Foundations of Computer Science and Information Technology MFCSIT 2006.

State based ownership, reentrance, and encapsulation, with Anindya Banerjee. In ECOOP 2005, 387–411.

Ownership Confinement Ensures Representation Independence for Object-oriented Programs, with Anindya Banerjee. In Journal of the ACM 52(6) (2005) 894–960. This supersedes our POPL 2002 paper.

Forward simulation for data refinement of classes, with Ana Cavalcanti. Proceedings of Formal Methods Europe FME’2002, LNCS 2391, 471–490. 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.

Data refinement, call by value, and higher order programs, Formal Aspects of Computing 7 (1995) 652–662.

1.3  Verification, semantics and refinement calculi

A Logical Analysis of Framing for Specifications with Pure Method Calls, with Anindya Banerjee and Mohammad Nikouei, to appear in ACM TOPLAS 2017/18. Supersedes A Logical Analysis of Framing for Specifications with Pure Method Calls, with Anindya Banerjee, in Verified Software: Theories, Tools, Experiments (VSTTE) 2014, post-proceedings, LNCS 8471.

Relational Logic with Framing and Hypotheses, with Anindya Banerjee and Mohammad Nikouei. In 36th Conference on Foundations of Software Technology and Theoretical Computer Science (2016) 11:1–11:16. Technical report on arXiv.

Specifying and verifying advanced control features, with Gary T. Leavens, Hridesh Rajan, Tomoyuki Aotani. In 7th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (2016) LNCS 9953, 80–96.

Behavioral Subtyping, Specification Inheritance, and Modular Reasoning, with Gary Leavens. In ACM Transactions on Programming Languages and Systems 47(4) 13:1–13:88, 2015. Supersedes Iowa State tech reports TR-06-36 and TR-06-20 and U. of Central Florida CS-TR-13-03a.

Laws of Programming for References, with Giovanny Lucero and Augusto Sampaio. In 11th Asian Symposium on Programming Languages and Systems (APLAS 2013) LNCS 8301, 124–139.

Decision Procedures for Region Logic, with Anindya Banerjee and Stan Rosenberg. In 13th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), January 2012, LNCS 7148, 379–395.

Local Reasoning for Global Invariants, Part I: Region Logic, with Anindya Banerjee and Stan Rosenberg. In Journal of the ACM 60 (2013) 18:1–18:56. . (This version has an index of definitions and differs by slight copy-edits from the published version.)

Local Reasoning for Global Invariants, Part II: Dynamic Boundaries, with Anindya Banerjee. In Journal of the ACM 60 (2013) 19:1–19:73. (This version has an index of definitions and differs by slight copy-edits from the published version.)

Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions, with Anindya Banerjee. In Programming Languages and Systems, 19th European Symposium on Programming (ESOP) 2010, invited paper. (The version here corrects a bug in the proceedings and includes appendix.) Superseded by Local Reasoning for Global Invariants, Part II: Dynamic Boundaries (see above).

Local Reasoning and Dynamic Framing for the Composite Pattern and its Clients, with Stan Rosenberg and Anindya Banerjee. In Verified Software: Theories, Tools, Experiments, VSTTE 2010, LNCS 6217, pages 183–198.

Theory for Software Verification —DRAFT, Jan 2009.

Boogie Meets Regions: a Verification Experience Report, with Anindya Banerjee and Mike Barnett. In Verified Software: Theories, Tools, Experiments, 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. Superseded by Local Reasoning for Global Invariants, Part II: Dynamic Boundaries (see above)

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. Superseded by Local Reasoning for Global Invariants, Part I: Region Logic (see above).

Modular Verification of Higher-Order Methods with Mandatory Calls Specified by Model Programs, with Steve M. Shaner and Gary T. Leavens. In Object Oriented Programming, Languages, and Systems OOPSLA 2007. (Iowa State University TR-07-04). Awarded Best Student Paper.

On assertion-based encapsulation for object invariants and simulations, Formal Aspects of Computing 19(2) 2007, 205–224. Supersedes my position paper in VSTTE 2005.

Preliminary Definition of Core JML, Sept 2006, with Gary T. Leavens and Stan Rosenberg. (Stevens Institute of Technology CS Report 2006-07, revised.) See also the PVS source files.

Allowing State Changes in Specifications, with Mike Barnett, Wolfram Schulte, and Qi Sun. Invited paper in International Conference on Emerging Trends in Information and Communication Security, 2006.

Observational purity and encapsulation, Theoretical Computer Science 376 (2007) 205–224. This supersedes the version that 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, with Mike Barnett. In Theoretical Computer Science 365 (2006) 143–168. This supersedes the version in LICS 2004.

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 , with Mike Barnett. In Mathematics of Program Construction MPC 2004.

On a specification-oriented model for object-orientation, with Ana Cavalcanti. Proceedings of Sixth Brazilian Symposium on Programming Languages, 114–127 (2002).

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, with Ana Cavalcanti. In IEEE Transactions on Software Engineering 26, 8 (2000) 713-728. There is an Extended Version, SIT Report 99-03.

1.4  Algebra of higher order imperative programs

Towards patterns, heaps and imperative lambdas, Journal of Logical and Algebraic Methods in Programming 85 (2016) 1038–1056.

Ideal models for pointwise relational and state-free imperative programming. Proceedings of ACM Principles and Practice of Declarative Programming (2001) 4–15.

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

Two-categories and program structure, PhD thesis 1992.

1.5  Ad hoc networking, music performance, education, software engineering, etc.

ModelWizard: Toward Interactive Model Construction, Masters Thesis by Dylan Hutchison.

CodeBLUE: a Bluetooth interactive dance club system, with Dennis Hromin, Michael Chladil, Natalie Vanatta, Susanne Wetzel, Farooq Anjum, and Ravi Jain. In IEEE Global Telecommunications Conference GLOBECOM (2003) 2814–2818.

High assurance for interactive applications in ad hoc networks, with Susanne Wetzel. Proceedings of First International Workshop on Wireless Security Technologies, London, April 2003.

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.

A common sense management model, IEEE Software, Nov. 1991 (with R.T. Yeh et al.)

Naumann publications          Revision: 1.9 , Date: 2017/09/27 15:07:38
Previous Up Next