Zobrazeno 1 - 10
of 319
pro vyhledávání: '"Mathur, Umang"'
The classical `decision problem' asks whether a given formula of first-order logic is satisfiable. In this work we consider an extension of this problem to regular first-order theories, i.e. (infinite) regular sets of formulae. Building on the beauti
Externí odkaz:
http://arxiv.org/abs/2410.17185
Autor:
Han, Lee Zheng, Mathur, Umang
In this paper, we consider the problem of automatically monitoring linearizability. Here, one observes an execution of a concurrent program that interacts with a concurrent object and determines if the execution witnesses the violation of linearizabi
Externí odkaz:
http://arxiv.org/abs/2410.04581
Autor:
Ang, Zhendong, Mathur, Umang
Runtime predictive analyses enhance coverage of traditional dynamic analyses based bug detection techniques by identifying a space of feasible reorderings of the observed execution and determining if any of these witnesses the violation of some desir
Externí odkaz:
http://arxiv.org/abs/2405.10499
Publikováno v:
GMS Ophthalmology Cases, Vol 10, p Doc20 (2020)
Objective: To describe a case of surgically induced scleral necrosis in Treacher Collins syndrome after strabismus surgery.Methods: A 19-year-old girl underwent bilateral squint surgery. Two weeks postoperatively, she presented with subconjunctival a
Externí odkaz:
https://doaj.org/article/6197d94d47944ad2bf96d07c2a54f0f6
Publikováno v:
GMS Ophthalmology Cases, Vol 10, p Doc01 (2020)
Purpose: To report 3 cases of microsporidial stromal keratitis presenting as a diagnostic dilemma to a tertiary eye care center in north India.Methods: Three eyes of 3 patients underwent therapeutic keratoplasty for microsporidial stromal keratitis.
Externí odkaz:
https://doaj.org/article/b629727c43e14a45b9c4f23279be5445
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
Given a non-deterministic finite automaton (NFA) A with m states, and a natural number n (presented in unary), the #NFA problem asks to determine the size of the set L(A_n) of words of length n accepted by A. While the corresponding decision problem
Externí odkaz:
http://arxiv.org/abs/2312.13320
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:
Ang, Zhendong, Mathur, Umang
In this paper, we focus on the problem of dynamically analysing concurrent software against high-level temporal specifications. Existing techniques for runtime monitoring against such specifications are primarily designed for sequential software and
Externí odkaz:
http://arxiv.org/abs/2310.14611
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