Ehsan Kafshdar Goharshady

Orcid: 0000-0002-8595-0587

According to our database1, Ehsan Kafshdar Goharshady authored at least 13 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

Online presence:

On csauthors.net:

Bibliography

2025
Qualitative Analysis of ω-Regular Objectives on Robust MDPs.
CoRR, May, 2025

Refuting Equivalence in Probabilistic Programs with Conditioning.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2025

PolyQEnt: A Polynomial Quantified Entailment Solver.
Proceedings of the Automated Technology for Verification and Analysis, 2025

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024
Equivalence and Similarity Refutation for Probabilistic Programs.
Proc. ACM Program. Lang., 2024

PolyHorn: A Polynomial Horn Clause Solver.
CoRR, 2024

Solving Long-run Average Reward Robust MDPs via Stochastic Games.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.
Proceedings of the Formal Methods - 26th International Symposium, 2024

Bidding Games with Charging.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

2021
Proving non-termination by program reversal.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

On Lexicographic Proof Rules for Probabilistic Termination.
Proceedings of the Formal Methods - 24th International Symposium, 2021

2020
Polynomial invariant generation for non-deterministic recursive programs.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019
The treewidth of smart contracts.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019


  Loading...