Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Amir Kafshdar Goharshady"'
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:727-756
Template-based synthesis, also known as sketching, is a localized approach to program synthesis in which the programmer provides not only a specification, but also a high-level "sketch" of the program. The sketch is basically a partial program that m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a79db8551b1ad363369fbff068891c78
https://doi.org/10.1145/3586052
https://doi.org/10.1145/3586052
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031249495
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93a3f2476688e4f843aa856dff82c7a0
https://doi.org/10.1007/978-3-031-24950-1_9
https://doi.org/10.1007/978-3-031-24950-1_9
Publikováno v:
2022 IEEE International Conference on Blockchain (Blockchain).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef4c031acb5225556cb1aa2ef9c68900
https://doi.org/10.1109/blockchain55522.2022.00044
https://doi.org/10.1109/blockchain55522.2022.00044
Publikováno v:
Computer Aided Verification ISBN: 9783031131844
We consider the quantitative problem of obtaining lower-bounds on the probability of termination of a given non-deterministic probabilistic program. Specifically, given a non-termination threshold $$p \in [0, 1],$$ p ∈ [ 0 , 1 ] , we aim for certif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1eaf2edd80dbaeddb727470a00650e99
https://doi.org/10.1007/978-3-031-13185-1_4
https://doi.org/10.1007/978-3-031-13185-1_4
Publikováno v:
ACM Transactions on Programming Languages and Systems. 41:1-52
We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34f510783253a0a48c9129e42a0537ad
https://doi.org/10.1145/3339984
https://doi.org/10.1145/3339984
Publikováno v:
PLDI
In this work, we consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide automated algorithms that obtain both lower and upper bounds on the asserti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5aaa6325d03ecec0a1e097287edffcc3
https://doi.org/10.1145/3453483.3454102
https://doi.org/10.1145/3453483.3454102
Autor:
Kiarash Mohammadi, Andreas Pavlogiannis, Krishnendu Chatterjee, Ali Asadi, Amir Kafshdar Goharshady
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783030591519
ATVA
ATVA
Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting probabilities, discounted sum, and mean payoff. Although there are many t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29ff42b9ffb8118def0ff910375a675e
https://doi.org/10.1007/978-3-030-59152-6_14
https://doi.org/10.1007/978-3-030-59152-6_14
Publikováno v:
Programming Languages and Systems ISBN: 9783030449131
ESOP
ESOP
Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-fl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c2b0176064118c41403239ad2923416
https://doi.org/10.1007/978-3-030-44914-8_5
https://doi.org/10.1007/978-3-030-44914-8_5
Publikováno v:
IEEE ICBC
In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d43a9d461a54befbee13afb44c79647
https://doi.org/10.1109/bloc.2019.8751326
https://doi.org/10.1109/bloc.2019.8751326
Publikováno v:
SAC
Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money in the form of cryptocurrency units. Two important problems regarding smart contracts are formal analysis and compiler optimization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d40427766649c50b7ec8482e16a8177f
https://doi.org/10.1145/3297280.3297322
https://doi.org/10.1145/3297280.3297322