default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Naumann
Person information
- affiliation: Stevens Institute of Technology, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j25]Frederico Ramos, Nuno Sabino, Pedro Adão, David A. Naumann, José Fragoso Santos:
Toward Tool-Independent Summaries for Symbolic Execution (Artifact). Dagstuhl Artifacts Ser. 9(2): 07:1-07:4 (2023)- [j24]Stefano Calzavara, David A. Naumann:
Special issue: 35th IEEE Computer Security Symposium - CSF 2022. J. Comput. Secur. 31(5): 419-420 (2023) - [j23]Timos Antonopoulos
, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo:
An Algebra of Alignment for Relational Verification. Proc. ACM Program. Lang. 7(POPL): 573-603 (2023) - 2022
- [j22]Anindya Banerjee, Ramana Nagasamudram, David A. Naumann, Mohammad Nikouei:
A Relational Program Logic with Data Abstraction and Dynamic Framing. ACM Trans. Program. Lang. Syst. 44(4): 25:1-25:136 (2022) - 2018
- [j21]Anindya Banerjee, David A. Naumann, Mohammad Nikouei:
A Logical Analysis of Framing for Specifications with Pure Method Calls. ACM Trans. Program. Lang. Syst. 40(2): 6:1-6:90 (2018) - 2016
- [j20]David A. Naumann:
Towards patterns for heaps and imperative lambdas. J. Log. Algebraic Methods Program. 85(5): 1038-1056 (2016) - 2015
- [j19]Gary T. Leavens, David A. Naumann:
Behavioral Subtyping, Specification Inheritance, and Modular Reasoning. ACM Trans. Program. Lang. Syst. 37(4): 13:1-13:88 (2015) - 2014
- [j18]François Dupressoir, Andrew D. Gordon, Jan Jürjens, David A. Naumann:
Guiding a general-purpose C verifier to prove cryptographic protocols. J. Comput. Secur. 22(5): 823-866 (2014) - 2013
- [j17]Anindya Banerjee, David A. Naumann, Stan Rosenberg:
Local Reasoning for Global Invariants, Part I: Region Logic. J. ACM 60(3): 18:1-18:56 (2013) - [j16]Anindya Banerjee, David A. Naumann:
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries. J. ACM 60(3): 19:1-19:73 (2013) - 2012
- [j15]David A. Naumann, Augusto Sampaio, Leila Silva:
Refactoring and representation independence for class hierarchies. Theor. Comput. Sci. 433: 60-97 (2012) - 2007
- [j14]David A. Naumann:
On assertion-based encapsulation for object invariants and simulations. Formal Aspects Comput. 19(2): 205-224 (2007) - [j13]David A. Naumann:
Observational purity and encapsulation. Theor. Comput. Sci. 376(3): 205-224 (2007) - 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) - 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) - 2002
- [j9]David A. Naumann:
Soundness of data refinement for a higher-order imperative language. Theor. Comput. Sci. 278(1-2): 271-301 (2002) - 2001
- [j8]David A. Naumann:
Calculating sharp adaptation rules. Inf. Process. Lett. 77(2-4): 201-208 (2001) - [j7]David A. Naumann:
Predicate transformer semantics of a higher-order imperative language with record subtyping. Sci. Comput. Program. 41(1): 1-51 (2001) - 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) - 1998
- [j5]David A. Naumann:
A Categorical Model for Higher Order Imperative Programming. Math. Struct. Comput. Sci. 8(4): 351-399 (1998) - 1995
- [j4]David A. Naumann:
Data Refinement, Call by Value and Higher Order Programs. Formal Aspects 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) - 1991
- [j1]Raymond T. Yeh, David A. Naumann, Roland T. Mittermeir, Reinhard A. Schlemmer, William S. Gilmore, George E. Sumrall, John T. Lebaron:
A Commonsense Management Model. IEEE Softw. 8(6): 23-33 (1991)
Conference and Workshop Papers
- 2024
- [c61]Ramana Nagasamudram, Lennart Beringer, Ken Birman, Mae Milano, David A. Naumann:
Verifying a C Implementation of Derecho's Coordination Mechanism Using VST and Coq. NFM 2024: 99-117 - 2023
- [c60]Toby Murray, Mukesh Tiwari, Gidon Ernst, David A. Naumann:
Assume but Verify: Deductive Verification of Leaked Information in Concurrent Applications. CCS 2023: 1746-1760 - [c59]Frederico Ramos, Nuno Sabino, Pedro Adão, David A. Naumann, José Fragoso Santos:
Toward Tool-Independent Summaries for Symbolic Execution. ECOOP 2023: 24:1-24:29 - [c58]Ramana Nagasamudram, Anindya Banerjee, David A. Naumann:
The WhyRel Prototype for Modular Relational Verification of Pointer Programs. TACAS (2) 2023: 133-151 - 2021
- [c57]Ramana Nagasamudram, David A. Naumann:
Alignment Completeness for Relational Hoare Logics. LICS 2021: 1-13 - 2020
- [c56]Minh Ngo, David A. Naumann, Tamara Rezk:
Type-Based Declassification for Free. ICFEM 2020: 181-197 - [c55]David A. Naumann:
Thirty-Seven Years of Relational Hoare Logic: Remarks on Its Principles and History. ISoLA (2) 2020: 93-116 - [c54]Andrew W. Appel, David A. Naumann:
Verified sequential Malloc/Free. ISMM 2020: 48-59 - 2019
- [c53]David A. Naumann, Minh Ngo:
Whither Specifications as Programs. UTP 2019: 39-61 - 2018
- [c52]Andrey Chudnov, David A. Naumann:
Assuming You Know: Epistemic Semantics of Relational Annotations for Expressive Flow Policies. CSF 2018: 189-203 - 2017
- [c51]Mounir Assaf, David A. Naumann, Julien Signoles, Eric Totel, Frédéric Tronel:
Hypercollecting semantics and its application to static analysis of information flow. POPL 2017: 874-887 - [c50]Gary T. Leavens, David A. Naumann:
An Illustrated Guide to the Model Theory of Supertype Abstraction and Behavioral Subtyping. SETSS 2017: 39-88 - [c49]Julian Sexton, Andrey Chudnov, David A. Naumann:
Spartan Jester: End-to-End Information Flow Control for Hybrid Android Applications. IEEE Symposium on Security and Privacy Workshops 2017: 157-162 - 2016
- [c48]Mounir Assaf, David A. Naumann:
Calculational Design of Information Flow Monitors. CSF 2016: 210-224 - [c47]Anindya Banerjee, David A. Naumann, Mohammad Nikouei:
Relational Logic with Framing and Hypotheses. FSTTCS 2016: 11:1-11:16 - [c46]Gary T. Leavens, David A. Naumann, Hridesh Rajan, Tomoyuki Aotani:
Specifying and Verifying Advanced Control Features. ISoLA (2) 2016: 80-96 - 2015
- [c45]Andrey Chudnov, David A. Naumann:
Inlined Information Flow Monitoring for JavaScript. CCS 2015: 629-643 - 2014
- [c44]Andrey Chudnov, George Kuan, David A. Naumann:
Information Flow Monitoring as Abstract Interpretation for Relational Logic. CSF 2014: 48-62 - [c43]Anindya Banerjee, David A. Naumann:
A Logical Analysis of Framing for Specifications with Pure Method Calls. VSTTE 2014: 3-20 - 2013
- [c42]Giovanny Lucero, David A. Naumann, Augusto Sampaio:
Laws of Programming for References. APLAS 2013: 124-139 - [c41]Chunyu Tang, David A. Naumann, Susanne Wetzel:
Analysis of Authentication and Key Establishment in Inter-generational Mobile Telephony. HPCC/EUC 2013: 1605-1614 - [c40]Anindya Banerjee, David A. Naumann:
A Simple Semantics and Static Analysis for Stack Inspection. Festschrift for Dave Schmidt 2013: 284-308 - 2012
- [c39]Stan Rosenberg, Anindya Banerjee, David A. Naumann:
Decision Procedures for Region Logic. VMCAI 2012: 379-395 - 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]Andrey Chudnov, David A. Naumann:
Information Flow Monitor Inlining. CSF 2010: 200-214 - [c35]Leila Silva, David A. Naumann, Augusto Sampaio:
Refactoring and representation independence for class hierarchies: extended abstract. FTfJP@ECOOP 2010: 8:1-8:7 - [c34]David A. Naumann, Anindya Banerjee:
Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions. ESOP 2010: 2-22 - [c33]Stan Rosenberg, Anindya Banerjee, David A. Naumann:
Local Reasoning and Dynamic Framing for the Composite Pattern and Its Clients. VSTTE 2010: 183-198 - 2008
- [c32]Anindya Banerjee, David A. Naumann, Stan Rosenberg:
Regional Logic for Local Reasoning about Global Invariants. ECOOP 2008: 387-411 - [c31]Anindya Banerjee, David A. Naumann, Stan Rosenberg:
Expressive Declassification Policies and Modular Static Enforcement. SP 2008: 339-353 - [c30]Anindya Banerjee, Michael Barnett, David A. Naumann:
Boogie Meets Regions: A Verification Experience Report. VSTTE 2008: 177-191 - 2007
- [c29]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 - [c28]Anindya Banerjee, David A. Naumann, Stan Rosenberg:
Towards a logical account of declassification. PLAS 2007: 61-66 - [c27]Marco Pistoia, Anindya Banerjee, David A. Naumann:
Beyond Stack Inspection: A Unified Access-Control and Information-Flow Security Model. S&P 2007: 149-163 - 2006
- [c26]Alejandro Russo, John Hughes, David A. Naumann, Andrei Sabelfeld:
Closing Internal Timing Channels by Transformation. ASIAN 2006: 120-135 - [c25]David A. Naumann:
From Coupling Relations to Mated Invariants for Checking Information Flow. ESORICS 2006: 279-296 - [c24]Michael Barnett, David A. Naumann, Wolfram Schulte, Qi Sun:
Allowing State Changes in Specifications. ETRICS 2006: 321-336 - [c23]Gilles Barthe, Tamara Rezk, David A. Naumann:
Deriving an Information Flow Checker and Certifying Compiler for Java. S&P 2006: 230-242 - [c22]Michael Johnson, David A. Naumann, John Power:
Category Theoretic Models of Data Refinement. MFCSIT 2006: 21-38 - 2005
- [c21]Anindya Banerjee, David A. Naumann:
State Based Ownership, Reentrance, and Encapsulation. ECOOP 2005: 387-411 - [c20]David A. Naumann:
Observational Purity and Encapsulation. FASE 2005: 190-204 - [c19]David A. Naumann:
Verifying a Secure Information Flow Analyzer. TPHOLs 2005: 211-226 - [c18]David A. Naumann:
Modular Reasoning in Object-Oriented Programming. VSTTE 2005: 105-115 - 2004
- [c17]Anindya Banerjee, David A. Naumann:
History-Based Access Control and Secure Information Flow. CASSIS 2004: 27-48 - [c16]David A. Naumann:
Assertion-Based Encapsulation, Object Invariants and Simulations. FMCO 2004: 251-273 - [c15]David A. Naumann, Michael Barnett:
Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State. LICS 2004: 313-323 - [c14]Michael Barnett, David A. Naumann:
Friends Need a Bit More: Maintaining Invariants Over Shared State. MPC 2004: 54-84 - [c13]Qi Sun, Anindya Banerjee, David A. Naumann:
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language. SAS 2004: 84-99 - 2003
- [c12]Anindya Banerjee, David A. Naumann:
Using Access Control for Secure Information Flow in a Java-like Language. CSFW 2003: 155-169 - [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
- [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 - 2001
- [c7]David A. Naumann:
Ideal Models for Pointwise Relational and State-Free Imperative Programming. PPDP 2001: 4-15 - 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
- [c5]David A. Naumann:
Beyond Fun: Order and Membership in Polytypic Imperative Programming. MPC 1998: 286-314 - [c4]David A. Naumann:
Towards squiggly refinement algebra. PROCOMET 1998: 346-365 - 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
Parts in Books or Collections
- 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
Editorship
- 2015
- [e4]David A. Naumann:
Unifying Theories of Programming - 5th International Symposium, UTP 2014, Singapore, May 13, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8963, Springer 2015, ISBN 978-3-319-14805-2 [contents] - 2012
- [e3]Rohit Gheyi, David A. Naumann:
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 [contents] - 2009
- [e2]Stephen Chong, David A. Naumann:
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 [contents] - 2005
- [e1]Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld:
Language-Based Security, 5.-10. October 2003. Dagstuhl Seminar Proceedings 03411, IBFI, Schloss Dagstuhl, Germany 2005 [contents]
Informal and Other Publications
- 2023
- [i19]Ramana Nagasamudram, Anindya Banerjee, David A. Naumann:
The WhyRel Prototype for Relational Verification. CoRR abs/2303.14314 (2023) - [i18]Ramana Nagasamudram, Anindya Banerjee, David A. Naumann:
Alignment complete relational Hoare logics for some and all. CoRR abs/2307.10045 (2023) - [i17]Toby Murray, Mukesh Tiwari, Gidon Ernst, David A. Naumann:
Assume but Verify: Deductive Verification of Leaked Information in Concurrent Applications (Extended Version). CoRR abs/2309.03442 (2023) - 2022
- [i16]Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo:
An algebra of alignment for relational verification. CoRR abs/2202.04278 (2022) - [i15]Anindya Banerjee, Ramana Nagasamudram, David A. Naumann:
Making Relational Hoare Logic Alignment Complete. CoRR abs/2212.10338 (2022) - 2021
- [i14]Ramana Nagasamudram, David A. Naumann:
Alignment Completeness for Relational Hoare Logics. CoRR abs/2101.11730 (2021) - 2020
- [i13]David A. Naumann:
Thirty-seven years of relational Hoare logic: remarks on its principles and history. CoRR abs/2007.06421 (2020) - 2019
- [i12]Minh Ngo, David A. Naumann, Tamara Rezk:
Typed-based Relaxed Noninterference for Free. CoRR abs/1905.00922 (2019) - [i11]David A. Naumann:
Whither Programs as Specifications. CoRR abs/1906.03557 (2019) - [i10]Anindya Banerjee, Ramana Nagasamudram, David A. Naumann, Mohammad Nikouei:
Data Abstraction and Relational Program Logic. CoRR abs/1910.14560 (2019) - 2016
- [i9]Mounir Assaf, David A. Naumann:
Calculational Design of Information Flow Monitors (extended version). CoRR abs/1605.02778 (2016) - [i8]Mounir Assaf, David A. Naumann, Julien Signoles, Eric Totel, Frédéric Tronel:
Hypercollecting Semantics and its Application to Static Analysis of Information Flow. CoRR abs/1608.01654 (2016) - [i7]Anindya Banerjee, David A. Naumann, Mohammad Nikouei:
Relational Logic with Framing and Hypotheses: Technical Report. CoRR abs/1611.08992 (2016) - 2015
- [i6]David A. Naumann:
Towards Patterns for Heaps and Imperative Lambdas. CoRR abs/1510.05527 (2015) - 2013
- [i5]François Dupressoir, Andrew D. Gordon, Jan Jürjens, David A. Naumann:
Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols. CoRR abs/1312.6532 (2013) - [i4]Chunyu Tang, David A. Naumann, Susanne Wetzel:
Analysis of authentication and key establishment in inter-generational mobile telephony. IACR Cryptol. ePrint Arch. 2013: 227 (2013) - 2003
- [i3]Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld:
03411 Final Report - Language Based Security. Language Based Security 2003 - [i2]Anindya Banerjee, Heiko Mantel, David A. Naumann, Andrei Sabelfeld:
03411 Abstracts Collection - Language Based Security. Language Based Security 2003 - 2002
- [i1]Anindya Banerjee, David A. Naumann:
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs. CoRR cs.PL/0212003 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
