Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kafshdar Goharshady, Ehsan
19  Ergebnisse:
Artikel (Online) X
Personensuche X
?
1

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/..
 
?
2

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/..
 
?
3

Quantitative Bounds on Resource Usage of Probabilistic Prog..:

Chatterjee, Krishnendu ; Goharshady, Amir Kafshdar ; Meggendorfer, Tobias.
Proceedings of the ACM on Programming Languages.  8 (2024)  OOPSLA1 - p. 362-391 , 2024
Link: https://doi.org/10.1145/..
 
?
4

Exploiting the Sparseness of Control-Flow and Call Graphs f..:

Conrado, Giovanna Kobus ; Goharshady, Amir Kafshdar ; Kochekov, Kerim..
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA2 - p. 1993-2022 , 2023
Link: https://doi.org/10.1145/..
 
?
5

The Bounded Pathwidth of Control-Flow Graphs:

Conrado, Giovanna Kobus ; Goharshady, Amir Kafshdar ; Lam, Chun Kit
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA2 - p. 292-317 , 2023
Link: https://doi.org/10.1145/..
 
?
6

Efficient parameterized algorithms for data packing:

Chatterjee, Krishnendu ; Goharshady, Amir Kafshdar ; Okati, Nastaran.
Proceedings of the ACM on Programming Languages.  3 (2019)  POPL - p. 1-28 , 2019
Link: https://doi.org/10.1145/..
 
?
7

Asparagus: Automated Synthesis of Parametric Gas Upper-Boun..:

Cai, Zhuo ; Farokhnia, Soroush ; Goharshady, Amir Kafshdar.
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA2 - p. 882-911 , 2023
Link: https://doi.org/10.1145/..
 
?
8

Algebro-geometric Algorithms for Template-Based Synthesis o..:

Goharshady, Amir Kafshdar ; Hitarth, S. ; Mohammadi, Fatemeh.
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA1 - p. 727-756 , 2023
Link: https://doi.org/10.1145/..
 
?
9

An efficient algorithm for computing network reliability in..:

Goharshady, Amir Kafshdar ; Mohammadi, Fatemeh
Reliability Engineering & System Safety.  193 (2020)  - p. 106665 , 2020
Link: https://doi.org/10.1016/..
 
?
10

Efficient parameterized algorithms for data packing:

Chatterjee, Krishnendu ; Goharshady, Amir Kafshdar ; Okati, Nastaran.
Proceedings of the ACM on Programming Languages.  3 (2019)  POPL - p. 1-28 , 2019
Link: https://dl.acm.org/doi/1..
 
?
11

Modular verification for almost-sure termination of probabi..:

Huang, Mingzhang ; Fu, Hongfei ; Chatterjee, Krishnendu.
Proceedings of the ACM on Programming Languages.  3 (2019)  OOPSLA - p. 1-29 , 2019
Link: https://dl.acm.org/doi/1..
 
?
12

Modular verification for almost-sure termination of probabi..:

Huang, Mingzhang ; Fu, Hongfei ; Chatterjee, Krishnendu.
Proceedings of the ACM on Programming Languages.  3 (2019)  OOPSLA - p. 1-29 , 2019
Link: https://doi.org/10.1145/..
 
?
13

Faster Algorithms for Dynamic Algebraic Queries in Basic RS..:

Chatterjee, Krishnendu ; Goharshady, Amir Kafshdar ; Goyal, Prateesh..
ACM Transactions on Programming Languages and Systems.  41 (2019)  4 - p. 1-46 , 2019
Link: https://doi.org/10.1145/..
 
?
14

Non-polynomial Worst-Case Analysis of Recursive Programs:

Chatterjee, Krishnendu ; Fu, Hongfei ; Goharshady, Amir Kafshdar
ACM Transactions on Programming Languages and Systems (TOPLAS).  41 (2019)  4 - p. 1-52 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

Non-polynomial Worst-Case Analysis of Recursive Programs:

Chatterjee, Krishnendu ; Fu, Hongfei ; Goharshady, Amir Kafshdar
ACM Transactions on Programming Languages and Systems.  41 (2019)  4 - p. 1-52 , 2019
Link: https://doi.org/10.1145/..
 
1-15