Philipp G. Haselwarter

Orcid: 0000-0003-0198-7751

According to our database1, Philipp G. Haselwarter authored at least 20 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs.
Dataset, June, 2025

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs.
Dataset, June, 2025

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs.
Dataset, May, 2025

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs.
CoRR, March, 2025

Approximate Relational Reasoning for Higher-Order Probabilistic Programs.
Proc. ACM Program. Lang., 2025

2024
Approximate Relational Reasoning for Higher-Order Probabilistic Programs - Formalization Artifact.
Dataset, October, 2024

Almost-Sure Termination by Guarded Refinement - Coq Artifact.
Dataset, June, 2024

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs - Coq Artifact.
Dataset, June, 2024

Asynchronous Probabilistic Couplings in Higher-Order Separation Logic.
Proc. ACM Program. Lang., January, 2024

Tachis: Higher-Order Separation Logic with Credits for Expected Costs.
Proc. ACM Program. Lang., 2024

Almost-Sure Termination by Guarded Refinement.
Proc. ACM Program. Lang., 2024

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs.
Proc. ACM Program. Lang., 2024

The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography.
Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

2023
Finitary Type Theories With and Without Contexts.
J. Autom. Reason., December, 2023

Asynchronous Probabilistic Couplings in Higher-Order Separation Logic - Coq Artifact.
Dataset, October, 2023

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

2021
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
A general definition of dependent type theories.
CoRR, 2020

Equality Checking for General Type Theories in Andromeda 2.
Proceedings of the Mathematical Software - ICMS 2020, 2020

2016
Design and Implementation of the Andromeda Proof Assistant.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016


  Loading...