Sciweavers

3495 search results - page 353 / 699
» On the random satisfiable process
Sort
View
200
Voted
EDCC
2005
Springer
16 years 11 days ago
PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...
Nicky Williams, Bruno Marre, Patricia Mouy, Muriel...
153
Voted
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 7 days ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
COMPSAC
2002
IEEE
15 years 11 months ago
From System Comprehension to Program Comprehension
Program and system comprehension are vital parts of the software maintenance process. We discuss the need for both perspectives and describe two methods that may be integrated to ...
Christos Tjortjis, Nicolas Gold, Paul J. Layzell, ...
CSCW
2000
ACM
15 years 11 months ago
Copies convergence in a distributed real-time collaborative environment
In real−time collaborative systems, replicated objects, shared by users, are subject to concurrency constraints. In order to satisfy these, various algorithms, qualified as op...
Nicolas Vidot, Michèle Cart, Jean Ferri&eac...
HASE
1998
IEEE
15 years 11 months ago
Analytical Partition of Software Components for Evolvable and Reliable MEMS Design Tools
Transforming software requirements into a software design involves the iterative partition of a solution into software components. The process is human-intensive and does not guar...
Carol L. Hoover, Pradeep K. Khosla