Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Yaron Velner"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 260-274 (2014)
Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a m
Externí odkaz:
https://doaj.org/article/a41b10e29c2744f9b2a27c42b6a8f748
Autor:
Alexander Rabinovich, Kalev Alpernas, Mooly Sagiv, Aurojit Panda, Yaron Velner, Sharon Shoham, Scott Shenker
Publikováno v:
Formal Methods in System Design
In modern networks, forwarding of packets often depends on the history of previously transmitted traffic. Such networks contain stateful middleboxes, whose forwarding behaviour depends on a mutable internal state. Firewalls and load balancers are typ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7e5b46fa41d746092d385e22c32a4bb
http://arxiv.org/abs/2106.01030
http://arxiv.org/abs/2106.01030
Autor:
Krishnendu Chatterjee, Yaron Velner
Publikováno v:
Journal of the ACM. 64:1-49
Two-player games on graphs are central in many problems in formal verification and program analysis, such as synthesis and verification of open systems. In this work, we consider solving recursive game graphs (or pushdown game graphs) that model the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a3f33187380fee18fa5d782db0b9b4f
https://doi.org/10.1145/3121408
https://doi.org/10.1145/3121408
Publikováno v:
Information and Computation. 254:143-166
Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, sim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13a65ded7b6ed7213d2678f526043c31
https://doi.org/10.1016/j.ic.2016.10.006
https://doi.org/10.1016/j.ic.2016.10.006
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 260-274 (2014)
GandALF
GandALF
Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3621054352994369535d59553ae70961
https://doi.org/10.1016/j.ic.2016.07.007
https://doi.org/10.1016/j.ic.2016.07.007
Publikováno v:
Programming Languages and Systems ISBN: 9783319898834
ESOP
ESOP
Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f04875d87349197e245fea25b91e13f
https://doi.org/10.1007/978-3-319-89884-1_26
https://doi.org/10.1007/978-3-319-89884-1_26
Autor:
Mooly Sagiv, Kalev Alpernas, Aurojit Panda, Roman Manevich, Scott Shenker, Yaron Velner, Sharon Shoham
Publikováno v:
Static Analysis-25th International Symposium, SAS 2018, Freiburg, Germany, August 29–31, 2018, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Static Analysis
Static Analysis ISBN: 9783319997247
SAS
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Static Analysis
Static Analysis ISBN: 9783319997247
SAS
Modern networks achieve robustness and scalability by maintaining states on their nodes. These nodes are referred to as middleboxes and are essential for network functionality. However, the presence of middleboxes drastically complicates the task of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d9a1ed0ccd49209ecd94631e44c7c21
Autor:
Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Yaron Velner, Alexander Rabinovich
Publikováno v:
Information and Computation. 241:177-196
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a309a102e02bd8fce95372697898a92e
https://doi.org/10.1016/j.ic.2015.03.001
https://doi.org/10.1016/j.ic.2015.03.001
Publikováno v:
Computer Aided Verification ISBN: 9783319633893
CAV (2)
CAV (2)
In assume-guarantee synthesis, we are given a specification \(\langle A,G \rangle \), describing an assumption on the environment and a guarantee for the system, and we construct a system that interacts with an environment and is guaranteed to satisf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a68b7b7b300df5daa99b1c7c6cbf208
https://doi.org/10.1007/978-3-319-63390-9_19
https://doi.org/10.1007/978-3-319-63390-9_19
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783319702773
Financial Cryptography Workshops
Financial Cryptography Workshops
Despite their incentive structure flaws, mining pools account for more than 95% of Bitcoin’s computation power. This paper introduces an attack against mining pools in which a malicious party pays pool members to withhold their solutions from their
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93237dcc252687612ea3acacd1997ebd
https://doi.org/10.1007/978-3-319-70278-0_19
https://doi.org/10.1007/978-3-319-70278-0_19