Eleftherios Ioannidis

Orcid: 0000-0003-2749-797X

According to our database1, Eleftherios Ioannidis authored at least 7 papers between 2019 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq.
J. Funct. Program., 2025

2024
Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization.
Proc. ACM Program. Lang., 2024

Structural temporal logic for mechanized program verification.
CoRR, 2024

Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization (Extended Version).
CoRR, 2024

Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs.
Proceedings of the 33rd USENIX Security Symposium, 2024

2022
Efficient Representation of Numerical Optimization Problems for SNARKs.
Proceedings of the 31st USENIX Security Symposium, 2022

2019
Extracting and Optimizing Formally Verified Code for Systems Programming.
Proceedings of the NASA Formal Methods - 11th International Symposium, 2019


  Loading...