Zobrazeno 1 - 10
of 899
pro vyhledávání: '"CHATTERJEE, KRISHNENDU"'
Autor:
Chatterjee, Krishnendu, Goharshady, Amir Kafshdar, Goharshady, Ehsan Kafshdar, Karrabi, Mehrdad, Saadat, Milad, Seeliger, Maximilian, Žikelić, Đorđe
Polynomial Horn clauses with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyHorn which is a tool for solving polynomial Horn clauses in which variables on both sides of t
Externí odkaz:
http://arxiv.org/abs/2408.03796
Unobservable Markov decision processes (UMDPs) serve as a prominent mathematical framework for modeling sequential decision-making problems. A key aspect in computational analysis is the consideration of decidability, which concerns the existence of
Externí odkaz:
http://arxiv.org/abs/2405.12583
Autor:
Chatterjee, Krishnendu, Ebrahimzadeh, Amirali, Karrabi, Mehrdad, Pietrzak, Krzysztof, Yeo, Michelle, Žikelić, Đorđe
We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems -- like proofs of stake or proofs of space -- and consider the problem of computing an optimal selfish min
Externí odkaz:
http://arxiv.org/abs/2405.04420
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-avoidance Properties
Markov Decision Processes (MDPs) are a classical model for decision making in the presence of uncertainty. Often they are viewed as state transformers with planning objectives defined with respect to paths over MDP states. An increasingly popular alt
Externí odkaz:
http://arxiv.org/abs/2405.04015
We study two-player zero-sum concurrent stochastic games with finite state and action space played for an infinite number of steps. In every step, the two players simultaneously and independently choose an action. Given the current state and the chos
Externí odkaz:
http://arxiv.org/abs/2405.02486
Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided by a playe
Externí odkaz:
http://arxiv.org/abs/2405.02479
We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two fundamental relational properties of probabilistic programs that are es
Externí odkaz:
http://arxiv.org/abs/2404.03430
Autor:
Brázdil, Tomáš, Chatterjee, Krishnendu, Chmelik, Martin, Forejt, Vojtěch, Křetínský, Jan, Kwiatkowska, Marta, Meggendorfer, Tobias, Parker, David, Ujma, Mateusz
We present a general framework for applying learning algorithms and heuristical guidance to the verification of Markov decision processes (MDPs). The primary goal of our techniques is to improve performance by avoiding an exhaustive exploration of th
Externí odkaz:
http://arxiv.org/abs/2403.09184
Autor:
Chatterjee, Krishnendu, Goharshady, Amir Kafshdar, Goharshady, Ehsan Kafshdar, Karrabi, Mehrdad, Žikelić, Đorđe
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are
Externí odkaz:
http://arxiv.org/abs/2403.05386
Populations evolve by accumulating advantageous mutations. Every population has some spatial structure that can be modeled by an underlying network. The network then influences the probability that new advantageous mutations fixate. Amplifiers of sel
Externí odkaz:
http://arxiv.org/abs/2401.14914