Deepak Garg

Orcid: 0000-0002-0888-3093

Affiliations:
  • Max Planck Institute for Software Systems, Saarbrücken, Germany
  • Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, USA (former)


According to our database1, Deepak Garg authored at least 105 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Compositional Security Definitions for Higher-Order Where Declassification.
Proc. ACM Program. Lang., April, 2023

DimSum: A Decentralized Approach to Multi-language Semantics and Verification.
Proc. ACM Program. Lang., January, 2023

Blueprint: A Toolchain for Highly-Reconfigurable Microservice Applications.
Proceedings of the 29th Symposium on Operating Systems Principles, 2023

Groundhog: Efficient Request Isolation in FaaS.
Proceedings of the Eighteenth European Conference on Computer Systems, 2023

2022
BFF: foundational and automated verification of bitfield-manipulating programs.
Proc. ACM Program. Lang., 2022

Isolation without taxation: near-zero-cost transitions for WebAssembly and SFI.
Proc. ACM Program. Lang., 2022

Pirouette: higher-order typed functional choreographies.
Proc. ACM Program. Lang., 2022

From Fine- to Coarse-Grained Dynamic Information Flow Control and Back, a Tutorial on Dynamic Information Flow.
CoRR, 2022

CoVault: A Secure Analytics Platform.
CoRR, 2022

Pacer: Comprehensive Network Side-Channel Mitigation in the Cloud.
Proceedings of the 31st USENIX Security Symposium, 2022

Islaris: verification of machine code against authoritative ISA semantics.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

SecurePtrs: Proving Secure Compilation with Data-Flow Back-Translation and Turn-Taking Simulation.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2021
Robustly Safe Compilation, an Efficient Form of Secure Compilation.
ACM Trans. Program. Lang. Syst., 2021

An Extended Account of Trace-relating Compiler Correctness and Secure Compilation.
ACM Trans. Program. Lang. Syst., 2021

A unifying type-theory for higher-order (amortized) cost analysis.
Proc. ACM Program. Lang., 2021

Higher-order probabilistic adversarial computations: categorical semantics and program logics.
Proc. ACM Program. Lang., 2021

Relational cost analysis in a functional-imperative setting.
J. Funct. Program., 2021

Permissive runtime information flow control in the presence of exceptions.
J. Comput. Secur., 2021

Secure Compilation (Dagstuhl Seminar 21481).
Dagstuhl Reports, 2021

Isolation Without Taxation: Near Zero Cost Transitions for SFI.
CoRR, 2021

RefinedC: automating the foundational verification of C code with refined ownership types.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Accountability in the Decentralised-Adversary Setting.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

CapablePtrs: Securely Compiling Partial Programs Using the Pointers-as-Capabilities Principle.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
The high-level benefits of low-level sandboxing.
Proc. ACM Program. Lang., 2020

On the expressiveness and semantics of information flow types.
J. Comput. Secur., 2020

PanCast: Listening to Bluetooth Beacons for Epidemic Risk Mitigation.
CoRR, 2020

Finding Safety in Numbers with Secure Allegation Escrows.
Proceedings of the 27th Annual Network and Distributed System Security Symposium, 2020

Trace-Relating Compiler Correctness and Secure Compilation.
Proceedings of the Programming Languages and Systems, 2020

2019
From fine- to coarse-grained dynamic information flow control and back.
Proc. ACM Program. Lang., 2019

Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization.
Proc. ACM Program. Lang., 2019

Relational cost analysis for functional-imperative programs.
Proc. ACM Program. Lang., 2019

Causality & Control Flow.
Proceedings of the 4th Workshop on Formal Reasoning about Causation, 2019

Pacer: Network Side-Channel Mitigation in the Cloud.
CoRR, 2019

Trace-Relating Compiler Correctness and Secure Compilation.
CoRR, 2019

ERIM: Secure, Efficient In-process Isolation with Protection Keys (MPK).
Proceedings of the 28th USENIX Security Symposium, 2019

Bidirectional type checking for relational properties.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Composing Abstractions using the null-Kernel.
Proceedings of the Workshop on Hot Topics in Operating Systems, 2019

ConfLLVM: A Compiler for Enforcing Data Confidentiality in Low-Level Code.
Proceedings of the Fourteenth EuroSys Conference 2019, Dresden, Germany, March 25-28, 2019, 2019

Robustly Safe Compilation.
Proceedings of the Programming Languages and Systems, 2019

Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018
Monadic refinements for relational cost analysis.
Proc. ACM Program. Lang., 2018

Accountability in Security Protocols.
IACR Cryptol. ePrint Arch., 2018

Secure Compilation (Dagstuhl Seminar 18201).
Dagstuhl Reports, 2018

SATE: Robust and Private Allegation Escrows.
CoRR, 2018

Formal verification of higher-order probabilistic programs.
CoRR, 2018

Exploring Robust Property Preservation for Secure Compilation.
CoRR, 2018

Robustly Safe Compilation or, Efficient, Provably Secure Compilation.
CoRR, 2018

ERIM: Secure and Efficient In-process Isolation with Memory Protection Keys.
CoRR, 2018

Shai: Enforcing Data-Specific Policies with Near-Zero Runtime Overhead.
CoRR, 2018

UniTraX: Protecting Data Privacy with Discoverable Biases.
Proceedings of the Principles of Security and Trust - 7th International Conference, 2018

Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus.
Proceedings of the Programming Languages and Systems, 2018

Types for Information Flow Control: Labeling Granularity and Semantic Models.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017
Type systems for information flow control: the question of granularity.
ACM SIGLOG News, 2017

Robust and compositional verification of object capability patterns.
Proc. ACM Program. Lang., 2017

A relational logic for higher-order programs.
Proc. ACM Program. Lang., 2017

Encrypting Messages for Incomplete Chains of Certificates.
IACR Cryptol. ePrint Arch., 2017

An Instrumenting Compiler for Enforcing Confidentiality in Low-Level Code.
CoRR, 2017

Robust Hyperproperty Preservation for Secure Compilation (Extended Abstract).
CoRR, 2017

Qapla: Policy compliance for database-backed systems.
Proceedings of the 26th USENIX Security Symposium, 2017

Relational cost analysis.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

WebPol: Fine-Grained Information Flow Policies for Web Browsers.
Proceedings of the Computer Security - ESORICS 2017, 2017

Secure Compilation and Hyperproperty Preservation.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016
Thoth: Comprehensive Policy Compliance in Data Retrieval Systems.
Proceedings of the 25th USENIX Security Symposium, 2016

Asymmetric Secure Multi-execution with Declassification.
Proceedings of the Principles of Security and Trust - 5th International Conference, 2016

Light-Weight Contexts: An OS Abstraction for Safety and Performance.
Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

A type theory for incremental computational complexity with control flow changes.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Progress-Sensitive Security for SPARK.
Proceedings of the Engineering Secure Software and Systems - 8th International Symposium, 2016

On Access Control, Capabilities, Their Equivalence, and Confused Deputy Attacks.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

Causally Consistent Dynamic Slicing.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
System M: A Program Logic for Code Sandboxing and Identification.
CoRR, 2015

Guardat: enforcing data policies at the storage layer.
Proceedings of the Tenth European Conference on Computer Systems, 2015

Refinement Types for Incremental Computational Complexity.
Proceedings of the Programming Languages and Systems, 2015

Information Flow Control for Event Handling and the DOM in Web Browsers.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

A Logic of Programs with Interface-Confined Code.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

Program Actions as Actual Causes: A Building Block for Accountability.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

Equivalence-based Security for Querying Encrypted Databases: Theory and Application to Privacy Policy Audits.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Information Flow Control in WebKit's JavaScript Bytecode.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

Generalizing Permissive-Upgrade in Dynamic Information Flow Analysis.
Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, 2014

Privacy-preserving audit for broker-based health information exchange.
Proceedings of the Fourth ACM Conference on Data and Application Security and Privacy, 2014

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Dependent Type Theory for Verification of Information Flow and Access Control Policies.
ACM Trans. Program. Lang. Syst., 2013

2012
Stateful authorization logic - Proof theory and a case study.
J. Comput. Secur., 2012

Labeled Goal-Directed Search in Access Control Logic.
Proceedings of the Security and Trust Management - 8th International Workshop, 2012

Countermodels from Sequent Calculi in Multi-Modal Logics.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Superficially substructural types.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

2011
On Adversary Models and Compositional Security.
IEEE Secur. Priv., 2011

A Logical Method for Policy Enforcement over Evolving Audit Logs
CoRR, 2011

A Proof-Carrying File System with Revocable and Use-Once Certificates.
Proceedings of the Security and Trust Management - 7th International Workshop, 2011

New Modalities for Access Control Logics: Permission, Control and Ratification.
Proceedings of the Security and Trust Management - 7th International Workshop, 2011

Verification of Information Flow and Access Control Policies with Dependent Types.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

Understanding and Protecting Privacy: Formal Semantics and Principled Audit Mechanisms.
Proceedings of the Information Systems Security - 7th International Conference, 2011

Policy auditing over incomplete logs: theory, implementation and applications.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2010
Compositional System Security with Interface-Confined Adversaries.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

Experiences in the logical specification of the HIPAA and GLBA privacy laws.
Proceedings of the 2010 ACM Workshop on Privacy in the Electronic Society, 2010

A Proof-Carrying File System.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

2009
A Logic of Secure Systems and its Application to Trusted Computing.
Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009

PCAL: Language Support for Proof-Carrying Authorization Systems.
Proceedings of the Computer Security, 2009

2008
A Modal Deconstruction of Access Control Logics.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

An Authorization Logic With Explicit Time.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

2007
Consumable Credentials in Linear-Logic-Based Access-Control Systems.
Proceedings of the Network and Distributed System Security Symposium, 2007

2006
A Linear Logic of Authorization and Knowledge.
Proceedings of the Computer Security, 2006

Non-Interference in Constructive Authorization Logic.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005
Type-Directed Concurrency.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Effective Chemistry for Synchrony and Asynchrony.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004


  Loading...