English
Related papers

Related papers: Solvability-Based Comparison of Failure Detectors

200 papers

To deal with failures as simply as possible, we propose a new foun- dation for the core (untyped) C, which is based on a new logic called task logic or imperative logic. We then introduce a sequential-disjunctive statement of the form S :…

Programming Languages · Computer Science 2015-06-12 Keehang Kwon , Sungwoo Hur , Mi-Young Park

Satisfiability-based automated reasoning is an approach that is being successfully used in software engineering to validate complex software, including for safety-critical systems. Such reasoning underlies many validation activities, from…

Software Engineering · Computer Science 2024-09-17 Nick Feng , Lina Marsso , Marsha Chechik

Testability is the probability whether tests will detect a fault, given that a fault in the program exists. How efficiently the faults will be uncovered depends upon the testability of the software. Various researchers have proposed…

Software Engineering · Computer Science 2013-08-16 Sujata Khatri , R. S. Chhillar , V. B. Singh

Failures in optical network backbone can lead to major disruption of internet data traffic. Hence, minimizing such failures is of paramount importance for the network operators. Even better, if the network failures can be predicted and…

Networking and Internet Architecture · Computer Science 2021-01-19 Dibakar Das , Mohammad Fahad Imteyaz , Jyotsna Bapat , Debabrata Das

Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is…

Logic in Computer Science · Computer Science 2017-01-11 Bernd Finkbeiner , Leander Tentrup

Recent years have witnessed impressive robotic manipulation systems driven by advances in imitation learning and generative modeling, such as diffusion- and flow-based approaches. As robot policy performance increases, so does the…

We revisit the vertex-failure connectivity oracle problem. This is one of the most basic graph data structure problems under vertex updates, yet its complexity is still not well-understood. We essentially settle the complexity of this…

Data Structures and Algorithms · Computer Science 2022-05-10 Yaowei Long , Thatchaphol Saranurak

Reliable prediction is an essential requirement for deep neural models that are deployed in open environments, where both covariate and semantic out-of-distribution (OOD) data arise naturally. In practice, to make safe decisions, a reliable…

Machine Learning · Computer Science 2025-04-22 Fei Zhu , Zhaoxiang Zhang

This paper presents the results of a research study related to software system failures, with the goal of understanding how we might better evolve, maintain and support software systems in production. We have qualitatively analyzed thirty…

Software Engineering · Computer Science 2020-08-26 Jonathan Sillito , Esdras Kutomi

How to provide information security while fulfilling ultra reliability and low-latency requirements is one of the major concerns for enabling the next generation of ultra-reliable and low-latency communications service (xURLLC), specially…

Information Theory · Computer Science 2023-03-09 Yao Zhu , Xiaopeng Yuan , Yulin Hu , Rafael F. Schaefer , Anke Schmeink

Building reliable classifiers is a fundamental challenge for deploying machine learning in real-world applications. A reliable system should not only detect out-of-distribution (OOD) inputs but also anticipate in-distribution (ID) errors by…

Computer Vision and Pattern Recognition · Computer Science 2026-03-05 Yang Li , Youyang Sha , Yinzhi Wang , Timothy Hospedales , Xi Shen , Shell Xu Hu , Xuanlong Yu

We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes…

Data Structures and Algorithms · Computer Science 2019-09-04 Peyman Afshani , Rolf Fagerberg , David Hammer , Riko Jacob , Irina Kostitsyna , Ulrich Meyer , Manuel Penschuck , Nodari Sitchinava

The paper proposes an alternative proof that Omega, an oracle that outputs a process identifier and guarantees that eventually the same correct process identifier is output at all correct processes, provides minimal information about…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-09-19 Eli Gafni , Petr Kuznetsov

System reliability is the probability of the maximum flow in a stochastic-flow network from the source node to the sink node being more than a demand level d. There are several approaches to compute system reliability using upper boundary…

Optimization and Control · Mathematics 2014-01-03 Majid Forghani-elahabad , Nezam Mahdavi-Amiri

IoT systems complexity and susceptibility to failures pose significant challenges in ensuring their reliable operation Failures can be internally generated or caused by external factors impacting both the systems correctness and its…

Availability analysis is used to assess the possible failures and their restoration process for a given system. This analysis involves the calculation of instantaneous and steady-state availabilities of the individual system components and…

Logic in Computer Science · Computer Science 2016-08-08 Waqar Ahmed , Osman Hasan

Interactive time responses are a crucial requirement for users analyzing large amounts of data. Such analytical queries are typically run in a distributed setting, with data being sharded across thousands of nodes for high throughput.…

Databases · Computer Science 2020-02-06 Bruhathi Sundarmurthy , Harshad Deshmukh , Paris Koutris , Jeffrey Naughton

Usually, methods evaluating system reliability require engineers to quantify the reliability of each of the system components. For series and parallel systems, there are some options to handle the estimation of each component's reliability.…

Methodology · Statistics 2018-05-29 Agatha Rodrigues , Carlos Alberto Pereira , Adriano Polpo

In software testing, a set of test cases is constructed according to some predefined selection criteria. The software is then examined against these test cases. Three interesting observations have been made on the current artifacts of…

Software Engineering · Computer Science 2020-03-02 T. Y. Chen , S. C. Cheung , S. M. Yiu

The problem of designing connectivity oracles supporting vertex failures is one of the basic data structures problems for undirected graphs. It is already well understood: previous works [Duan--Pettie STOC'10; Long--Saranurak FOCS'22]…

Data Structures and Algorithms · Computer Science 2024-09-24 Bingbing Hu , Evangelos Kosinas , Adam Polak