E-LIB Suche - Ergebnisse für: Goharshady, Ehsan Kafshdar - Sprache DE

Personensuche X

Sortierung: Relevanz

Sortierung: Jahr

1

Equivalence and Similarity Refutation for Probabilistic Pro..:

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr.
Proceedings of the ACM on Programming Languages. 8 (2024) PLDI - p. 2098-2122 , 2024

Link: https://doi.org/10.1145/..

2

On Lexicographic Proof Rules for Probabilistic Termination:

, In: Formal Methods; Lecture Notes in Computer Science,

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr.. - p. 619-639 , 2021

Link: https://doi.org/10.1007/..

3

Proving non-termination by program reversal:

, In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation,

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr. - p. 1033-1048 , 2021

Link: https://dl.acm.org/doi/1..

4

Polynomial invariant generation for non-deterministic recur..:

, In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,

Chatterjee, Krishnendu ; Fu, Hongfei ; Goharshady, Amir Kafshdar. - p. 672-687 , 2020

Link: https://dl.acm.org/doi/1..

5

The treewidth of smart contracts:

, In: Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing,

Chatterjee, Krishnendu ; Goharshady, Amir Kafshdar ; Goharshady, Ehsan Kafshdar - p. 400-408 , 2019

Link: https://dl.acm.org/doi/1..

6

On Lexicographic Proof Rules for Probabilistic Termination:

Chatterjee, Krishnendu ; Kafshdar Goharshady, Ehsan ; Novotný, Petr..
Formal Aspects of Computing. 35 (2023) 2 - p. 1-25 , 2023

Link: https://doi.org/10.1145/..

7

Solving Long-run Average Reward Robust MDPs via Stochastic ..:

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Karrabi, Mehrdad..
http://arxiv.org/abs/2312.13912. , 2023

Link: http://arxiv.org/abs/231..

8

On Lexicographic Proof Rules for Probabilistic Termination:

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr..
http://arxiv.org/abs/2108.02188. , 2021

Link: http://arxiv.org/abs/210..

9

Proving Non-termination by Program Reversal:

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr.
http://arxiv.org/abs/2104.01189. , 2021

Link: http://arxiv.org/abs/210..

10

On lexicographic proof rules for probabilistic termination ..:

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr..
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-030-90870-6_33. , 2021

Link: https://research-explore..

11

Proving non-termination by program reversal:

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr.
info:eu-repo/semantics/altIdentifier/doi/10.1145/3453483.3454093. , 2021

Link: https://research-explore..

12

Polynomial invariant generation for non-deterministic recur..:

Chatterjee, Krishnendu ; Fu, Hongfei ; Goharshady, Amir Kafshdar.
info:eu-repo/semantics/altIdentifier/doi/10.1145/3385412.3385969. , 2020

Link: https://research-explore..

13

Proving Almost-Sure Termination of Probabilistic Programs v..:

Chatterjee, Krishnendu ; Goharshady, Ehsan Kafshdar ; Novotný, Petr..
http://arxiv.org/abs/2008.06295. , 2020

Link: http://arxiv.org/abs/200..

14

Polynomial Invariant Generation for Non-deterministic Recur..:

Chatterjee, Krishnendu ; Fu, Hongfei ; Goharshady, Amir Kafshdar.
http://arxiv.org/abs/1902.04373. , 2019

Link: http://arxiv.org/abs/190..

15

The treewidth of smart contracts:

Chatterjee, Krishnendu ; Goharshady, Amir Kafshdar ; Goharshady, Ehsan Kafshdar
info:eu-repo/semantics/altIdentifier/doi/10.1145/3297280.3297322. , 2019

Link: https://research-explore..

1-15