Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
David A. Naumann
2010 – today
- 2013
[j18]Anindya Banerjee, David A. Naumann, Stan Rosenberg: Local Reasoning for Global Invariants, Part I: Region Logic. J. ACM 60(3): 18 (2013)- [j17]Anindya Banerjee, David A. Naumann: Local Reasoning for Global Invariants, Part II: Dynamic Boundaries. J. ACM 60(3): 19 (2013)
- [p1]Anindya Banerjee, David A. Naumann: State Based Encapsulation for Modular Reasoning about Behavior-Preserving Refactorings. Aliasing in Object-Oriented Programming 2013: 319-365
- [i3]Anindya Banerjee, David A. Naumann: A Simple Semantics and Static Analysis for Stack Inspection. CoRR abs/1309.5144 (2013)
- [i2]Chunyu Tang, David A. Naumann, Susanne Wetzel: Analysis of authentication and key establishment in inter-generational mobile telephony. IACR Cryptology ePrint Archive 2013: 227 (2013)
- 2012
- [j16]David A. Naumann, Augusto Sampaio, Leila Silva: Refactoring and representation independence for class hierarchies. Theor. Comput. Sci. 433: 60-97 (2012)
- [c39]Stan Rosenberg, Anindya Banerjee, David A. Naumann: Decision Procedures for Region Logic. VMCAI 2012: 379-395
- [e3]Rohit Gheyi, David A. Naumann (Eds.): Formal Methods: Foundations and Applications - 15th Brazilian Symposium, SBMF 2012, Natal, Brazil, September 23-28, 2012. Proceedings. Lecture Notes in Computer Science 7498, Springer 2012, ISBN 978-3-642-33295-1
- 2011
- [c38]François Dupressoir, Andrew D. Gordon, Jan Jürjens, David A. Naumann: Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols. CSF 2011: 3-17
- [c37]Chunyu Tang, David A. Naumann, Susanne Wetzel: Symbolic Analysis for Security of Roaming Protocols in Mobile Networks - [Extended Abstract]. SecureComm 2011: 480-490
- 2010
- [c36]
- [c35]David A. Naumann, Anindya Banerjee: Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions. ESOP 2010: 2-22
- [c34]Stan Rosenberg, Anindya Banerjee, David A. Naumann: Local Reasoning and Dynamic Framing for the Composite Pattern and Its Clients. VSTTE 2010: 183-198
2000 – 2009
- 2009
- [j15]Michael Johnson, David A. Naumann, John Power: Category Theoretic Models of Data Refinement. Electr. Notes Theor. Comput. Sci. 225: 21-38 (2009)
- [e2]Stephen Chong, David A. Naumann (Eds.): Proceedings of the 2009 Workshop on Programming Languages and Analysis for Security, PLAS 2009, Dublin, Ireland, 15-21 June, 2009. ACM 2009, ISBN 978-1-60558-645-8
- 2008
- [c33]Anindya Banerjee, David A. Naumann, Stan Rosenberg: Regional Logic for Local Reasoning about Global Invariants. ECOOP 2008: 387-411
- [c32]Anindya Banerjee, David A. Naumann, Stan Rosenberg: Expressive Declassification Policies and Modular Static Enforcement. IEEE Symposium on Security and Privacy 2008: 339-353
- [c31]Anindya Banerjee, Michael Barnett, David A. Naumann: Boogie Meets Regions: A Verification Experience Report. VSTTE 2008: 177-191
- 2007
- [j14]David A. Naumann: On assertion-based encapsulation for object invariants and simulations. Formal Asp. Comput. 19(2): 205-224 (2007)
- [j13]David A. Naumann: Observational purity and encapsulation. Theor. Comput. Sci. 376(3): 205-224 (2007)
- [c30]Steve M. Shaner, Gary T. Leavens, David A. Naumann: Modular verification of higher-order methods with mandatory calls specified by model programs. OOPSLA 2007: 351-368
- [c29]Anindya Banerjee, David A. Naumann, Stan Rosenberg: Towards a logical account of declassification. PLAS 2007: 61-66
- [c28]Marco Pistoia, Anindya Banerjee, David A. Naumann: Beyond Stack Inspection: A Unified Access-Control and Information-Flow Security Model. IEEE Symposium on Security and Privacy 2007: 149-163
- 2006
- [j12]David A. Naumann, Michael Barnett: Towards imperative modules: Reasoning about invariants and sharing of mutable state. Theor. Comput. Sci. 365(1-2): 143-168 (2006)
- [c27]Alejandro Russo, John Hughes, David A. Naumann, Andrei Sabelfeld: Closing Internal Timing Channels by Transformation. ASIAN 2006: 120-135
- [c26]David A. Naumann: From Coupling Relations to Mated Invariants for Checking Information Flow. ESORICS 2006: 279-296
- [c25]Michael Barnett, David A. Naumann, Wolfram Schulte, Qi Sun: Allowing State Changes in Specifications. ETRICS 2006: 321-336
- [c24]Gilles Barthe, Tamara Rezk, David A. Naumann: Deriving an Information Flow Checker and Certifying Compiler for Java. IEEE Symposium on Security and Privacy 2006: 230-242
- 2005
- [j11]Anindya Banerjee, David A. Naumann: Ownership confinement ensures representation independence for object-oriented programs. J. ACM 52(6): 894-960 (2005)
- [j10]Anindya Banerjee, David A. Naumann: Stack-based access control and secure information flow. J. Funct. Program. 15(2): 131-177 (2005)
- [c23]Anindya Banerjee, David A. Naumann: State Based Ownership, Reentrance, and Encapsulation. ECOOP 2005: 387-411
- [c22]
- [c21]
- [c20]
- [e1]Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld (Eds.): Language-Based Security, 5.-10. October 2003. Dagstuhl Seminar Proceedings 03411, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005
- 2004
- [c19]Anindya Banerjee, David A. Naumann: History-Based Access Control and Secure Information Flow. CASSIS 2004: 27-48
- [c18]David A. Naumann: Assertion-Based Encapsulation, Object Invariants and Simulations. FMCO 2004: 251-273
- [c17]David A. Naumann, Michael Barnett: Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State. LICS 2004: 313-323
- [c16]Michael Barnett, David A. Naumann: Friends Need a Bit More: Maintaining Invariants Over Shared State. MPC 2004: 54-84
- [c15]Qi Sun, Anindya Banerjee, David A. Naumann: Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language. SAS 2004: 84-99
- 2003
- [c14]Anindya Banerjee, David A. Naumann: Using Access Control for Secure Information Flow in a Java-like Language. CSFW 2003: 155-169
- [c13]Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld: 03411 Final Report - Language Based Security. Language Based Security 2003
- [c12]Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld: 03411 Abstracts Collection - Language Based Security. Language Based Security 2003
- [c11]Dennis Hromin, Michael Chladil, Natalie Vanatta, David A. Naumann, Susanne Wetzel, Farooq Anjum, Ravi Jain: CodeBLUE: a Bluetooth interactive dance club system. GLOBECOM 2003: 2814-2818
- 2002
- [j9]David A. Naumann: Soundness of data refinement for a higher-order imperative language. Theor. Comput. Sci. 278(1-2): 271-301 (2002)
- [c10]Anindya Banerjee, David A. Naumann: Secure Information Flow and Pointer Confinement in a Java-like Language. CSFW 2002: 253-
- [c9]Ana Cavalcanti, David A. Naumann: Forward Simulation for Data Refinement of Classes. FME 2002: 471-490
- [c8]Anindya Banerjee, David A. Naumann: Representation independence, confinement and access control [extended abstract]. POPL 2002: 166-177
- [i1]Anindya Banerjee, David A. Naumann: Ownership Confinement Ensures Representation Independence for Object-Oriented Programs. CoRR cs.PL/0212003 (2002)
- 2001
- [j8]
- [j7]David A. Naumann: Predicate transformer semantics of a higher-order imperative language with record subtyping. Sci. Comput. Program. 41(1): 1-51 (2001)
- [c7]David A. Naumann: Ideal Models for Pointwise Relational and State-Free Imperative Programming. PPDP 2001: 4-15
- 2000
- [j6]Ana Cavalcanti, David A. Naumann: A Weakest Precondition Semantics for Refinement of Object-Oriented Programs. IEEE Trans. Software Eng. 26(8): 713-728 (2000)
1990 – 1999
- 1999
- [c6]Ana Cavalcanti, David A. Naumann: A Weakest Precondition Semantics for an Object-Oriented Language of Refinement. World Congress on Formal Methods 1999: 1439-1459
- 1998
- [j5]David A. Naumann: A Categorical Model for Higher Order Imperative Programming. Mathematical Structures in Computer Science 8(4): 351-399 (1998)
- [c5]David A. Naumann: Beyond Fun: Order and Membership in Polytypic Imperative Programming. MPC 1998: 286-314
- [c4]
- 1995
- [j4]David A. Naumann: Data Refinement, Call by Value and Higher Order Programs. Formal Asp. Comput. 7(6): 651-662 (1995)
- [j3]David A. Naumann: Predicate Transformers and Higher-Order Programs. Theor. Comput. Sci. 150(1): 111-159 (1995)
- 1994
- [j2]David A. Naumann: A Recursion Theorem for Predicate Transformers on Inductive Data Types. Inf. Process. Lett. 50(6): 329-336 (1994)
- [c3]David A. Naumann: On the Essence of Oberon. Programming Languages and System Architectures 1994: 313-327
- [c2]David A. Naumann: Predicate Transformer Semantics of an Oberon-Like Language. PROCOMET 1994: 467-487
- [c1]Richard T. Denman, David A. Naumann, Walter Potter, Gary Richter: Derivation of programs for freshmen. SIGCSE 1994: 116-120
- 1991
- [j1]Raymond T. Yeh, David A. Naumann, Roland Mittermeir, Reinhard A. Schlemmer, William S. Gilmore, George E. Sumrall, John T. Lebaron: A Commonsense Management Model. IEEE Software 8(6): 23-33 (1991)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:27 CEST by the dblp team