203 search results - page 32 / 41 » Datatype-Generic Termination Proofs |
120
click to vote
AIML
2008
15 years 3 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
123
click to vote
JFP
2000
15 years 1 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
119
Voted
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
115
Voted
SAC
2004
ACM
15 years 7 months ago
2004
ACM
Since fingerprint data are no secrets but of public nature, the verification data transmitted to a smartcard for oncardmatching need protection by appropriate means in order to ...
103
Voted
TPHOL
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...