Zobrazeno 1 - 10
of 143
pro vyhledávání: '"Pavlogiannis, Andreas"'
We consider a problem of placing generators of rewards to be collected by randomly moving agents in a network. In many settings, the precise mobility pattern may be one of several possible, based on parameters outside our control, such as weather con
Externí odkaz:
http://arxiv.org/abs/2405.05433
The Moran process is a classic stochastic process that models the rise and takeover of novel traits in network-structured populations. In biological terms, a set of mutants, each with fitness $m\in(0,\infty)$ invade a population of residents with fit
Externí odkaz:
http://arxiv.org/abs/2404.15986
Autor:
Tunç, Hünkar Can, Deshmukh, Ameya Prashant, Çirisci, Berk, Enea, Constantin, Pavlogiannis, Andreas
Dynamic analyses are a standard approach to analyzing and testing concurrent programs. Such techniques observe program traces and analyze them to infer the presence or absence of bugs. At its core, each analysis maintains a partial order $P$ that rep
Externí odkaz:
http://arxiv.org/abs/2403.17818
Dynamic data race detection has emerged as a key technique for ensuring reliability of concurrent software in practice. However, dynamic approaches can often miss data races owing to nondeterminism in the thread scheduler. Predictive race detection t
Externí odkaz:
http://arxiv.org/abs/2401.05642
Dyck reachability is a principled, graph-based formulation of a plethora of static analyses. Bidirected graphs are used for capturing dataflow through mutable heap data, and are usual formalisms of demand-driven points-to and alias analyses. The best
Externí odkaz:
http://arxiv.org/abs/2311.04319
Weak-memory models are standard formal specifications of concurrency across hardware, programming languages, and distributed systems. A fundamental computational problem is consistency testing: is the observed execution of a concurrent program in ali
Externí odkaz:
http://arxiv.org/abs/2311.04302
Autor:
Tunç, Hünkar Can, Abdulla, Parosh Aziz, Chakraborty, Soham, Krishna, Shankaranarayanan, Mathur, Umang, Pavlogiannis, Andreas
Over the years, several memory models have been proposed to capture the subtle concurrency semantics of C/C++.One of the most fundamental problems associated with a memory model M is consistency checking: given an execution X, is X consistent with M?
Externí odkaz:
http://arxiv.org/abs/2304.03714
Deadlocks are one of the most notorious concurrency bugs, and significant research has focused on detecting them efficiently. Dynamic predictive analyses work by observing concurrent executions, and reason about alternative interleavings that can wit
Externí odkaz:
http://arxiv.org/abs/2304.03692
The Voter model is a well-studied stochastic process that models the invasion of a novel trait $A$ (e.g., a new opinion, social meme, genetic mutation, magnetic spin) in a network of individuals (agents, people, genes, particles) carrying an existing
Externí odkaz:
http://arxiv.org/abs/2211.14676
Autor:
Chatterjee, Krishnendu, Svoboda, Jakub, Žikelić, Ðorđe, Pavlogiannis, Andreas, Tkadlec, Josef
Publikováno v:
Phys. Rev. E 106, 2022, 034321
Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics dr
Externí odkaz:
http://arxiv.org/abs/2210.02394