default search action
Ehsan Kafshdar Goharshady
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Krishnendu Chatterjee
, Ehsan Kafshdar Goharshady
Equivalence and Similarity Refutation for Probabilistic Programs. Proc. ACM Program. Lang. 8(PLDI): 2098-2122 (2024) - [c7]Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik:
Bidding Games with Charging. CONCUR 2024: 8:1-8:17 - [c6]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic:
Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. FM (1) 2024: 600-619 - [c5]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic:
Solving Long-run Average Reward Robust MDPs via Stochastic Games. IJCAI 2024: 6707-6715 - [i8]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic:
Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. CoRR abs/2403.05386 (2024) - [i7]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Equivalence and Similarity Refutation for Probabilistic Programs. CoRR abs/2404.03430 (2024) - [i6]Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik:
Bidding Games with Charging. CoRR abs/2407.06288 (2024) - [i5]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Dorde Zikelic:
PolyHorn: A Polynomial Horn Clause Solver. CoRR abs/2408.03796 (2024) - 2023
- [j1]Krishnendu Chatterjee
On Lexicographic Proof Rules for Probabilistic Termination. Formal Aspects Comput. 35(2): 11:1-11:25 (2023) - [i4]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic:
Solving Long-run Average Reward Robust MDPs via Stochastic Games. CoRR abs/2312.13912 (2023) - 2021
- [c4]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. FM 2021: 619-639 - [c3]Krishnendu Chatterjee
Proving non-termination by program reversal. PLDI 2021: 1033-1048 - [i3]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Proving Non-termination by Program Reversal. CoRR abs/2104.01189 (2021) - [i2]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. CoRR abs/2108.02188 (2021) - 2020
- [c2]Krishnendu Chatterjee, Hongfei Fu
Polynomial invariant generation for non-deterministic recursive programs. PLDI 2020: 672-687
2010 – 2019
- 2019
- [c1]Krishnendu Chatterjee, Amir Kafshdar Goharshady
The treewidth of smart contracts. SAC 2019: 400-408 - [i1]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial Invariant Generation for Non-deterministic Recursive Programs. CoRR abs/1902.04373 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: