Results 1  10
of
390
Impossibility of distributed consensus with one faulty process
, 1983
"... The consensus problem involves an asynchronous system of proceses, some of which may be unreliable. The problem is for the rcliablc processes to agree on a bbary value. h this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only otre faulty p ..."
Abstract

Cited by 1721 (28 self)
 Add to MetaCart
The consensus problem involves an asynchronous system of proceses, some of which may be unreliable. The problem is for the rcliablc processes to agree on a bbary value. h this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only otre faulty
Learning Accurate, Compact, and Interpretable Tree Annotation
 In ACL ’06
, 2006
"... We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals. In co ..."
Abstract

Cited by 423 (42 self)
 Add to MetaCart
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals
ORDERINGS FOR TERMREWRITING SYSTEMS
, 1982
"... Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree Theorem ..."
Abstract

Cited by 294 (24 self)
 Add to MetaCart
Theorem, any nonterminating system must be selfembedding in the sense that it allows for the derivation of some term from a simpler one; thus termination is guaranteed jf every rule in the system as a reduction in some simplification ordering. Most 01 the orderings that have been used for proving
Certification of nontermination proofs
 In Proc. ITP 2012, volume 7406 of LNCS
, 2012
"... Abstract Automatic tools for proving (non)termination of term rewrite systems, if successful, deliver proofs as justification. In this work, we focus on how to certify nontermination proofs. Besides some techniques that allow to reduce the number of rules, the main way of showing nontermination is t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract Automatic tools for proving (non)termination of term rewrite systems, if successful, deliver proofs as justification. In this work, we focus on how to certify nontermination proofs. Besides some techniques that allow to reduce the number of rules, the main way of showing nontermination
Grammars with Scattered Nonterminals
, 2002
"... We investigate rewriting systems, grammars with scattered nonterminals, which extend the generative capacity of contextfree grammars. They can be thought of as having sentential forms where some instances of a nonterminal may be coupled. The contextfreelike productions replace a nonterminal toget ..."
Abstract
 Add to MetaCart
We investigate rewriting systems, grammars with scattered nonterminals, which extend the generative capacity of contextfree grammars. They can be thought of as having sentential forms where some instances of a nonterminal may be coupled. The contextfreelike productions replace a nonterminal
Existential Invariants and Nontermination
"... Abstract. We describe a methodology for automatically strengthening proposed existential invariants. Proving the systemvalidity of an existential invariant is equivalent to falsifying a guarantee property. Thus, an immediate application is nontermination analysis, which complements termination anal ..."
Abstract
 Add to MetaCart
Abstract. We describe a methodology for automatically strengthening proposed existential invariants. Proving the systemvalidity of an existential invariant is equivalent to falsifying a guarantee property. Thus, an immediate application is nontermination analysis, which complements termination
Reasoning about Infinite Computations
 Information and Computation
, 1994
"... We investigate extensions of temporal logic by connectives defined by finite automata on infinite words. We consider three different logics, corresponding to three different types of acceptance conditions (finite, looping and repeating) for the automata. It turns out, however, that these logics all ..."
Abstract

Cited by 315 (58 self)
 Add to MetaCart
, logics of programs have been tools for reasoning about the input/output behavior of programs. When dealing with concurrent or nonterminating processes (like operating systems) there is, however, a need to reason about infinite computations. Thus, instead of considering the first and last states of finite
NonTermination Checking for Imperative Programs
"... Abstract. While termination checking tailored to realworld library code or frameworks has received everincreasing attention during the last years, the complementary question of disproving termination properties as a means of debugging has largely been ignored so far. We present an approach to auto ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
states are identified using constraintsolving techniques. The method is fully implemented on top of a program verification system and available for download. We give an empirical evaluation of the approach using a collection of nonterminating example programs. 1
Information Leakage of NonTerminating Processes
"... In recent years, quantitative security techniques have been providing effective measures of the security of a system against an attacker. Such techniques usually assume that the system produces a finite amount of observations based on a finite amount of secret bits and terminates, and the attack is ..."
Abstract
 Add to MetaCart
is based on these observations. By modeling systems with Markov chains, we are able to measure the effectiveness of attacks on nonterminating systems. Such systems do not necessarily produce a finite amount of output and are not necessarily based on a finite amount of secret bits. We provide
On confluence of nonterminating CHR programs
, 2007
"... Abstract. Confluence is an important property for any kind of rewrite system including CHR, which is a generalpurpose declarative committedchoice language consisting of multiheaded guarded rules. CHR can yield a confluence problem, because of nondeterminism in the choice of rules using the abstra ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Confluence is an important property for any kind of rewrite system including CHR, which is a generalpurpose declarative committedchoice language consisting of multiheaded guarded rules. CHR can yield a confluence problem, because of nondeterminism in the choice of rules using
Results 1  10
of
390