Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,302,973 papers from all fields of science
Search
Sign In
Create Free Account
Fail-stop
A fail-stop subset of a computer language is one that has the same semantics as the original, except in the case where an exceptional condition…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Bottom type
Computer language
Correctness (computer science)
Exception handling
Expand
Broader (1)
Security engineering
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Does the Buck Stop Here ? A Comparison of Withdrawals from Money Market Mutual Funds with Floating and Constant Share Prices
Scott Hendry
2012
Corpus ID: 8088705
Bank of Canada working papers are theoretical or empirical works-in-progress on subjects in economics and finance. The views…
Expand
2006
2006
Local L2-Thresholding Based Data Mining in Peer-to-Peer Systems
R. Wolff
,
Kanishka Bhaduri
,
H. Kargupta
SDM
2006
Corpus ID: 11025648
In a large network of computers, wireless sensors, or mobile devices, each of the components (hence, peers) has some data about…
Expand
2005
2005
Fault tolerant asynchronous adder through dynamic self-reconfiguration
Song Peng
,
R. Manohar
ICCD
2005
Corpus ID: 1023431
This paper presents a systematic method for the design of a self-healing asynchronous adder. We propose a graph-based model for…
Expand
2005
2005
Power transmission control using distributed max-flow
Austin Armbruster
,
M. Gosnell
,
B. McMillin
,
M. Crow
Annual International Computer Software and…
2005
Corpus ID: 8118081
Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the…
Expand
2003
2003
The Round-Complexity of Black-Box Concurrent Zero-Knowledge
Alon Rosen
2003
Corpus ID: 115629923
Zero-knowledge proof systems are interactive protocols that enable one party, called the prover, to convince another party…
Expand
2003
2003
Solving Range Queries in a Distributed System
P. Yalagandula
2003
Corpus ID: 16174819
The goal of the project is to design and build a scalable distributed discovery system for documents that (i) supports both…
Expand
2001
2001
The Design of TerraDir
Bobby Bhattacharjee
,
P. Keleher
,
Bujor D. Silaghi
2001
Corpus ID: 14354017
1995
1995
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
P. K. Reddy
,
S. Bhalla
IEEE Transactions on Knowledge and Data…
1995
Corpus ID: 11289722
Replicated data management systems adopt the 1-copy serializability criteria for processing transactions. In order to achieve…
Expand
Highly Cited
1994
Highly Cited
1994
Constraint satisfaction as a basis for designing nonmasking fault-tolerance
A. Arora
,
M. Gouda
,
G. Varghese
IEEE International Conference on Distributed…
1994
Corpus ID: 3528567
We present a method for the design of nonmasking fault-tolerant programs. In our method, a set of constraints is associated with…
Expand
1991
1991
Achieving Optimal CRCW PRAM Fault-Tolerance
Alexander A. Shvartsman
Information Processing Letters
1991
Corpus ID: 5414081
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE