dblp.uni-trier.dewww.uni-trier.de

David A. Naumann

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
48EEAnindya Banerjee, David A. Naumann, Stan Rosenberg: Regional Logic for Local Reasoning about Global Invariants. ECOOP 2008: 387-411
47EEAnindya Banerjee, David A. Naumann, Stan Rosenberg: Expressive Declassification Policies and Modular Static Enforcement. IEEE Symposium on Security and Privacy 2008: 339-353
46EEAnindya Banerjee, Michael Barnett, David A. Naumann: Boogie Meets Regions: A Verification Experience Report. VSTTE 2008: 177-191
2007
45EEMarco 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
44EESteve 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
43EEAnindya Banerjee, David A. Naumann, Stan Rosenberg: Towards a logical account of declassification. PLAS 2007: 61-66
42EEDavid A. Naumann: On assertion-based encapsulation for object invariants and simulations. Formal Asp. Comput. 19(2): 205-224 (2007)
41EEDavid A. Naumann: Observational purity and encapsulation. Theor. Comput. Sci. 376(3): 205-224 (2007)
2006
40EEAlejandro Russo, John Hughes, David A. Naumann, Andrei Sabelfeld: Closing Internal Timing Channels by Transformation. ASIAN 2006: 120-135
39EEDavid A. Naumann: From Coupling Relations to Mated Invariants for Checking Information Flow. ESORICS 2006: 279-296
38EEMichael Barnett, David A. Naumann, Wolfram Schulte, Qi Sun: Allowing State Changes in Specifications. ETRICS 2006: 321-336
37EEGilles 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
36EEDavid A. Naumann, Michael Barnett: Towards imperative modules: Reasoning about invariants and sharing of mutable state. Theor. Comput. Sci. 365(1-2): 143-168 (2006)
2005
35 Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld: Language-Based Security, 5.-10. October 2003 IBFI, Schloss Dagstuhl, Germany 2005
34EEAnindya Banerjee, David A. Naumann: State Based Ownership, Reentrance, and Encapsulation. ECOOP 2005: 387-411
33EEDavid A. Naumann: Observational Purity and Encapsulation. FASE 2005: 190-204
32EEDavid A. Naumann: Verifying a Secure Information Flow Analyzer. TPHOLs 2005: 211-226
31EEDavid A. Naumann: Modular Reasoning in Object-Oriented Programming. VSTTE 2005: 105-115
30EEAnindya Banerjee, David A. Naumann: Ownership confinement ensures representation independence for object-oriented programs. J. ACM 52(6): 894-960 (2005)
29EEAnindya Banerjee, David A. Naumann: Stack-based access control and secure information flow. J. Funct. Program. 15(2): 131-177 (2005)
2004
28EEAnindya Banerjee, David A. Naumann: History-Based Access Control and Secure Information Flow. CASSIS 2004: 27-48
27EEDavid A. Naumann: Assertion-Based Encapsulation, Object Invariants and Simulations. FMCO 2004: 251-273
26EEDavid A. Naumann, Michael Barnett: Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State. LICS 2004: 313-323
25EEMichael Barnett, David A. Naumann: Friends Need a Bit More: Maintaining Invariants Over Shared State. MPC 2004: 54-84
24EEQi Sun, Anindya Banerjee, David A. Naumann: Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language. SAS 2004: 84-99
2003
23EEAnindya Banerjee, David A. Naumann: Using Access Control for Secure Information Flow in a Java-like Language. CSFW 2003: 155-169
22EEAnindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld: 03411 Abstracts Collection - Language Based Security. Language Based Security 2003
21EEAnindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld: 03411 Final Report - Language Based Security. Language Based Security 2003
2002
20EEAnindya Banerjee, David A. Naumann: Secure Information Flow and Pointer Confinement in a Java-like Language. CSFW 2002: 253-
19EEAna Cavalcanti, David A. Naumann: Forward Simulation for Data Refinement of Classes. FME 2002: 471-490
18EEAnindya Banerjee, David A. Naumann: Representation independence, confinement and access control [extended abstract]. POPL 2002: 166-177
17EEAnindya Banerjee, David A. Naumann: Ownership Confinement Ensures Representation Independence for Object-Oriented Programs CoRR cs.PL/0212003: (2002)
16EEDavid A. Naumann: Soundness of data refinement for a higher-order imperative language. Theor. Comput. Sci. 278(1-2): 271-301 (2002)
2001
15 David A. Naumann: Ideal Models for Pointwise Relational and State-Free Imperative Programming. PPDP 2001: 4-15
14EEDavid A. Naumann: Calculating sharp adaptation rules. Inf. Process. Lett. 77(2-4): 201-208 (2001)
13 David A. Naumann: Predicate transformer semantics of a higher-order imperative language with record subtyping. Sci. Comput. Program. 41(1): 1-51 (2001)
2000
12EEAna Cavalcanti, David A. Naumann: A Weakest Precondition Semantics for Refinement of Object-Oriented Programs. IEEE Trans. Software Eng. 26(8): 713-728 (2000)
1999
11EEAna Cavalcanti, David A. Naumann: A Weakest Precondition Semantics for an Object-Oriented Language of Refinement. World Congress on Formal Methods 1999: 1439-1459
1998
10EEDavid A. Naumann: Beyond Fun: Order and Membership in Polytypic Imperative Programming. MPC 1998: 286-314
9 David A. Naumann: Towards squiggly refinement algebra. PROCOMET 1998: 346-365
8 David A. Naumann: A Categorical Model for Higher Order Imperative Programming. Mathematical Structures in Computer Science 8(4): 351-399 (1998)
1995
7 David A. Naumann: Data Refinement, Call by Value and Higher Order Programs. Formal Asp. Comput. 7(6): 651-662 (1995)
6EEDavid A. Naumann: Predicate Transformers and Higher-Order Programs. Theor. Comput. Sci. 150(1): 111-159 (1995)
1994
5 David A. Naumann: Predicate Transformer Semantics of an Oberon-Like Language. PROCOMET 1994: 467-487
4 David A. Naumann: On the Essence of Oberon. Programming Languages and System Architectures 1994: 313-327
3EERichard T. Denman, David A. Naumann, Walter Potter, Gary Richter: Derivation of programs for freshmen. SIGCSE 1994: 116-120
2 David A. Naumann: A Recursion Theorem for Predicate Transformers on Inductive Data Types. Inf. Process. Lett. 50(6): 329-336 (1994)
1991
1 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

1Anindya Banerjee [17] [18] [20] [21] [22] [23] [24] [28] [29] [30] [34] [35] [43] [45] [46] [47] [48]
2Michael Barnett [25] [26] [36] [38] [46]
3Gilles Barthe [37]
4Ana Cavalcanti [11] [12] [19]
5Richard T. Denman [3]
6William S. Gilmore [1]
7John Hughes [40]
8Gary T. Leavens [44]
9John T. Lebaron [1]
10Heiko Mantel [21] [22] [35]
11Roland Mittermeir (Roland T. Mittermeir) [1]
12Marco Pistoia [45]
13Walter Potter [3]
14Tamara Rezk [37]
15Gary Richter [3]
16Stan Rosenberg [43] [47] [48]
17Alejandro Russo [40]
18Andrei Sabelfeld [21] [22] [35] [40]
19Reinhard A. Schlemmer [1]
20Wolfram Schulte [38]
21Steve M. Shaner [44]
22George E. Sumrall [1]
23Qi Sun [24] [38]
24Raymond T. Yeh [1]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)