Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Nagar, Kartik"'
Autor:
Bhat, Shreesha G., Nagar, Kartik
Distributed protocols are generally parametric and can be executed on a system with any number of nodes, and hence proving their correctness becomes an infinite state verification problem. The most popular approach for verifying distributed protocols
Externí odkaz:
http://arxiv.org/abs/2211.15175
Replicated data types (RDTs) are data structures that permit concurrent modification of multiple, potentially geo-distributed, replicas without coordination between them. RDTs are designed in such a way that conflicting operations are eventually dete
Externí odkaz:
http://arxiv.org/abs/2203.14518
Serializability is a well-understood concurrency control mechanism that eases reasoning about highly-concurrent database programs. Unfortunately, enforcing serializability has a high-performance cost, especially on geographically distributed database
Externí odkaz:
http://arxiv.org/abs/2103.05573
Geo-replicated systems provide a number of desirable properties such as globally low latency, high availability, scalability, and built-in fault tolerance. Unfortunately, programming correct applications on top of such systems has proven to be very c
Externí odkaz:
http://arxiv.org/abs/2004.10158
Relational database applications are notoriously difficult to test and debug. Concurrent execution of database transactions may violate complex structural invariants that constraint how changes to the contents of one (shared) table affect the content
Externí odkaz:
http://arxiv.org/abs/1908.05655
Autor:
Nagar, Kartik, Jagannathan, Suresh
Maintaining multiple replicas of data is crucial to achieving scalability, availability and low latency in distributed applications. Conflict-free Replicated Data Types (CRDTs) are important building blocks in this domain because they are designed to
Externí odkaz:
http://arxiv.org/abs/1905.05684
Autor:
Nagar, Kartik
Worst Case Execution Time (WCET) is an important metric for programs running on real-time systems, and finding precise estimates of a program’s WCET is crucial to avoid over-allocation and wastage of hardware resources and to improve the schedulabi
Externí odkaz:
http://etd.iisc.ernet.in/handle/2005/2742
http://etd.ncsi.iisc.ernet.in/abstracts/3569/G27842-Abs.pdf
http://etd.ncsi.iisc.ernet.in/abstracts/3569/G27842-Abs.pdf
Autor:
Nagar, Kartik, Jagannathan, Suresh
While a number of weak consistency mechanisms have been developed in recent years to improve performance and ensure availability in distributed, replicated systems, ensuring correctness of transactional applications running on top of such systems rem
Externí odkaz:
http://arxiv.org/abs/1806.08416
Serializability is a well-understood correctness criterion that simplifies reasoning about the behavior of concurrent transactions by ensuring they are isolated from each other while they execute. However, enforcing serializable isolation comes at a
Externí odkaz:
http://arxiv.org/abs/1710.09844
Autor:
Bhat, Shreesha G., Nagar, Kartik
We propose a framework to automate and mechanize simulation-based proofs of cutoffs for parameterized verification of distributed protocols. We propose a strategy to derive the simulation relation given the cutoff instance and encode the correctness
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22a20e452b1e1bd684c0455d0fd894a1