The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
David A. Naumann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  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. [Citation Graph (1, 0)][DBLP]
    IEEE Software, 1991, v:8, n:6, pp:23-33 [Journal]
  2. Anindya Banerjee, David A. Naumann
    History-Based Access Control and Secure Information Flow. [Citation Graph (0, 0)][DBLP]
    CASSIS, 2004, pp:27-48 [Conf]
  3. Anindya Banerjee, David A. Naumann
    Secure Information Flow and Pointer Confinement in a Java-like Language. [Citation Graph (0, 0)][DBLP]
    CSFW, 2002, pp:253-0 [Conf]
  4. Anindya Banerjee, David A. Naumann
    Using Access Control for Secure Information Flow in a Java-like Language. [Citation Graph (0, 0)][DBLP]
    CSFW, 2003, pp:155-169 [Conf]
  5. Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld
    03411 Final Report - Language Based Security. [Citation Graph (0, 0)][DBLP]
    Language Based Security, 2003, pp:- [Conf]
  6. Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld
    03411 Abstracts Collection - Language Based Security. [Citation Graph (0, 0)][DBLP]
    Language Based Security, 2003, pp:- [Conf]
  7. Anindya Banerjee, David A. Naumann
    State Based Ownership, Reentrance, and Encapsulation. [Citation Graph (0, 0)][DBLP]
    ECOOP, 2005, pp:387-411 [Conf]
  8. David A. Naumann
    From Coupling Relations to Mated Invariants for Checking Information Flow. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2006, pp:279-296 [Conf]
  9. Michael Barnett, David A. Naumann, Wolfram Schulte, Qi Sun
    Allowing State Changes in Specifications. [Citation Graph (0, 0)][DBLP]
    ETRICS, 2006, pp:321-336 [Conf]
  10. David A. Naumann
    Observational Purity and Encapsulation. [Citation Graph (0, 0)][DBLP]
    FASE, 2005, pp:190-204 [Conf]
  11. Ana Cavalcanti, David A. Naumann
    Forward Simulation for Data Refinement of Classes. [Citation Graph (0, 0)][DBLP]
    FME, 2002, pp:471-490 [Conf]
  12. Ana Cavalcanti, David A. Naumann
    A Weakest Precondition Semantics for an Object-Oriented Language of Refinement. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:1439-1459 [Conf]
  13. David A. Naumann
    Assertion-Based Encapsulation, Object Invariants and Simulations. [Citation Graph (0, 0)][DBLP]
    FMCO, 2004, pp:251-273 [Conf]
  14. David A. Naumann, Michael Barnett
    Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:313-323 [Conf]
  15. David A. Naumann
    Beyond Fun: Order and Membership in Polytypic Imperative Programming. [Citation Graph (0, 0)][DBLP]
    MPC, 1998, pp:286-314 [Conf]
  16. Michael Barnett, David A. Naumann
    Friends Need a Bit More: Maintaining Invariants Over Shared State. [Citation Graph (0, 0)][DBLP]
    MPC, 2004, pp:54-84 [Conf]
  17. David A. Naumann
    On the Essence of Oberon. [Citation Graph (0, 0)][DBLP]
    Programming Languages and System Architectures, 1994, pp:313-327 [Conf]
  18. Anindya Banerjee, David A. Naumann
    Representation independence, confinement and access control [extended abstract]. [Citation Graph (0, 0)][DBLP]
    POPL, 2002, pp:166-177 [Conf]
  19. David A. Naumann
    Ideal Models for Pointwise Relational and State-Free Imperative Programming. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:4-15 [Conf]
  20. David A. Naumann
    Predicate Transformer Semantics of an Oberon-Like Language. [Citation Graph (0, 0)][DBLP]
    PROCOMET, 1994, pp:467-487 [Conf]
  21. David A. Naumann
    Towards squiggly refinement algebra. [Citation Graph (0, 0)][DBLP]
    PROCOMET, 1998, pp:346-365 [Conf]
  22. Qi Sun, Anindya Banerjee, David A. Naumann
    Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:84-99 [Conf]
  23. Richard T. Denman, David A. Naumann, Walter Potter, Gary Richter
    Derivation of programs for freshmen. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1994, pp:116-120 [Conf]
  24. Gilles Barthe, Tamara Rezk, David A. Naumann
    Deriving an Information Flow Checker and Certifying Compiler for Java. [Citation Graph (0, 0)][DBLP]
    S&P, 2006, pp:230-242 [Conf]
  25. Marco Pistoia, Anindya Banerjee, David A. Naumann
    Beyond Stack Inspection: A Unified Access-Control and Information-Flow Security Model. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2007, pp:149-163 [Conf]
  26. David A. Naumann
    Verifying a Secure Information Flow Analyzer. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:211-226 [Conf]
  27. Anindya Banerjee, David A. Naumann
    Ownership Confinement Ensures Representation Independence for Object-Oriented Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  28. David A. Naumann
    Data Refinement, Call by Value and Higher Order Programs. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1995, v:7, n:6, pp:651-662 [Journal]
  29. David A. Naumann
    Calculating sharp adaptation rules. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:2-4, pp:201-208 [Journal]
  30. David A. Naumann
    A Recursion Theorem for Predicate Transformers on Inductive Data Types. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:6, pp:329-336 [Journal]
  31. Anindya Banerjee, David A. Naumann
    Ownership confinement ensures representation independence for object-oriented programs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:894-960 [Journal]
  32. Anindya Banerjee, David A. Naumann
    Stack-based access control and secure information flow. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2005, v:15, n:2, pp:131-177 [Journal]
  33. David A. Naumann
    A Categorical Model for Higher Order Imperative Programming. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1998, v:8, n:4, pp:351-399 [Journal]
  34. David A. Naumann
    Predicate transformer semantics of a higher-order imperative language with record subtyping. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2001, v:41, n:1, pp:1-51 [Journal]
  35. David A. Naumann
    Soundness of data refinement for a higher-order imperative language. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:278, n:1-2, pp:271-301 [Journal]
  36. David A. Naumann
    Predicate Transformers and Higher-Order Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:150, n:1, pp:111-159 [Journal]
  37. David A. Naumann, Michael Barnett
    Towards imperative modules: Reasoning about invariants and sharing of mutable state. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:365, n:1-2, pp:143-168 [Journal]
  38. David A. Naumann
    Observational purity and encapsulation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:3, pp:205-224 [Journal]
  39. Ana Cavalcanti, David A. Naumann
    A Weakest Precondition Semantics for Refinement of Object-Oriented Programs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2000, v:26, n:8, pp:713-728 [Journal]
  40. Steve M. Shaner, Gary T. Leavens, David A. Naumann
    Modular verification of higher-order methods with mandatory calls specified by model programs. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2007, pp:351-368 [Conf]
  41. David A. Naumann
    On assertion-based encapsulation for object invariants and simulations. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2007, v:19, n:2, pp:205-224 [Journal]

  42. Closing Internal Timing Channels by Transformation. [Citation Graph (, )][DBLP]


  43. Information Flow Monitor Inlining. [Citation Graph (, )][DBLP]


  44. Regional Logic for Local Reasoning about Global Invariants. [Citation Graph (, )][DBLP]


  45. Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions. [Citation Graph (, )][DBLP]


  46. Towards a logical account of declassification. [Citation Graph (, )][DBLP]


  47. Expressive Declassification Policies and Modular Static Enforcement. [Citation Graph (, )][DBLP]


  48. Boogie Meets Regions: A Verification Experience Report. [Citation Graph (, )][DBLP]


  49. Modular Reasoning in Object-Oriented Programming. [Citation Graph (, )][DBLP]


  50. Local Reasoning and Dynamic Framing for the Composite Pattern and Its Clients. [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002