Sciweavers

3333 search results - page 241 / 667
» Abstract Proof Search
Sort
View
SPIN
2001
Springer
15 years 10 months ago
Distributed LTL Model-Checking in SPIN
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in di...
Jiri Barnat, Lubos Brim, Jitka Stríbrn&aacu...
FLOPS
2008
Springer
15 years 7 months ago
EasyCheck - Test Data for Free
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
Jan Christiansen, Sebastian Fischer
148
Voted
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 5 months ago
Authentication from matrix conjugation
Abstract. We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter is equivalen...
Dima Grigoriev, Vladimir Shpilrain
150
Voted
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
JACM
2006
99views more  JACM 2006»
15 years 5 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller