Catalin Hritcu

Orcid: 0000-0001-8919-8081

Affiliations:
  • Max Planck Institute for Security and Privacy (MPI-SP), Bochum, Germany
  • Inria, Paris, France (2013-2020)
  • University of Pennsylvania, Philadelphia, PA, USA (2011-2013)
  • Saarland University, Saarbrücken, Germany (2007-2011)


According to our database1, Catalin Hritcu authored at least 58 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Securing Verified IO Programs Against Unverified Code in F.
Proc. ACM Program. Lang., January, 2024

SECOMP: Formally Secure Compilation of Compartmentalized C Programs.
CoRR, 2024

2023
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq.
ACM Trans. Program. Lang. Syst., September, 2023

The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography.
IACR Cryptol. ePrint Arch., 2023

Securely Compiling Verified F* Programs With IO.
CoRR, 2023

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
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation.
ACM Trans. Program. Lang. Syst., 2021

SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq.
IACR Cryptol. ePrint Arch., 2021

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

Dynamic IFC Theorems for Free!
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
The next 700 relational program logics.
Proc. ACM Program. Lang., 2020

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

2019
Dijkstra monads for all.
Proc. ACM Program. Lang., 2019

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

Meta-F ^\star : Proof Automation with SMT, Tactics, and Metaprograms.
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

The Quest for Formally Secure Compartmentalizing Compilation.
, 2019

2018
Recalling a witness: foundations and applications of monotonic state.
Proc. ACM Program. Lang., 2018

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

Exploring Robust Property Preservation for Secure Compilation.
CoRR, 2018

Meta-F*: Metaprogramming and Tactics in an Effectful Program Verifier.
CoRR, 2018

The Meaning of Memory Safety.
Proceedings of the Principles of Security and Trust - 7th International Conference, 2018

A monadic framework for relational verification: applied to information security, program equivalence, and optimizations.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Verified low-level programming embedded in F.
Proc. ACM Program. Lang., 2017

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

Formally Secure Compilation of Unsafe Low-Level Components (Extended Abstract).
CoRR, 2017

A Monadic Framework for Relational Verification (Functional Pearl).
CoRR, 2017

Verified Low-Level Programming Embedded in F<sup>*</sup>.
CoRR, 2017


Beginner's luck: a language for property-based generators.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Dijkstra monads for free.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

2016
Testing noninterference, quickly.
J. Funct. Program., 2016

A verified information-flow architecture.
J. Comput. Secur., 2016

Beyond Full Abstraction: Formalizing the Security Guarantees of Low-Level Compartmentalization.
CoRR, 2016

Dijkstra Monads for Free.
CoRR, 2016

Dependent types and multi-monadic effects in F.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Beyond Good and Evil: Formalizing the Security Guarantees of Compartmentalizing Compilation.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
The Joint EasyCrypt-F*-CryptoVerif School 2014.
ACM SIGLOG News, 2015

Towards a Fully Abstract Compiler Using Micro-Policies: Secure Compilation for Mutually Distrustful Components.
CoRR, 2015

Micro-Policies: Formally Verified, Tag-Based Security Monitors.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Foundational Property-Based Testing.
Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

Micro-Policies: Formally Verified, Tag-Based Security Monitors.
Proceedings of the 10th ACM Workshop on Programming Languages and Analysis for Security, 2015

Architectural Support for Software-Defined Metadata Processing.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014
Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations.
J. Comput. Secur., 2014

2013
All Your IFCException Are Belong to Us.
Proceedings of the 2013 IEEE Symposium on Security and Privacy, 2013

Testing noninterference, quickly.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
Union, intersection, and refinement types and reasoning about type disjointness for security protocol analysis.
PhD thesis, 2012

Semantic subtyping with an SMT solver.
J. Funct. Program., 2012

Hardware Support for Safety Interlocks and Introspection.
Proceedings of the Sixth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops, 2012

On the Development and Formalization of an Extensible Code Generator for Real Life Security Protocols.
Proceedings of the NASA Formal Methods, 2012

2011
Union and Intersection Types for Secure Protocol Implementations.
Proceedings of the Theory of Security and Applications - Joint Workshop, 2011

Automatically Verifying Typing Constraints for a Data Processing Language.
Proceedings of the Certified Programs and Proofs - First International Conference, 2011

2009
A Step-indexed Semantics of Imperative Objects
Log. Methods Comput. Sci., 2009

Achieving Security Despite Compromise Using Zero-knowledge.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2008
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Type-checking zero-knowledge.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2005
A Reference Implementation of ADF (Agent Developing Framework): Semantic Web-Based Agent Communication.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005


  Loading...