Sciweavers

290 search results - page 51 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 4 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
CSFW
1999
IEEE
15 years 1 months ago
Athena: A New Efficient Automatic Checker for Security Protocol Analysis
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
Dawn Xiaodong Song
ZUM
1991
Springer
15 years 29 days ago
The Use of Z
During 1990 and 1991 we carried out a survey of Z users in the UK; in this paper we present the results. Z is being used by a wide variety of companies for many different applicat...
Rosalind Barden, Susan Stepney, David Cooper
ACL2
2006
ACM
15 years 3 months ago
Phylogenetic trees in ACL2
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
Warren A. Hunt Jr., Serita M. Nelesen
ICALP
2009
Springer
15 years 9 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal