Sciweavers

4117 search results - page 528 / 824
» On the Satisfiability of Complex Constraints
Sort
View
SEFM
2003
IEEE
16 years 2 days ago
From Requirements to Design: Formalizing the Key Steps
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
R. Geoff Dromey
IUI
2003
ACM
16 years 1 days ago
A reliable natural language interface to household appliances
As household appliances grow in complexity and sophistication, they become harder and harder to use, particularly because of their tiny display screens and limited keyboards. This...
Alexander Yates, Oren Etzioni, Daniel S. Weld
CCS
2003
ACM
16 years 1 days ago
Secure protocol composition
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
Anupam Datta, Ante Derek, John C. Mitchell, Dusko ...
EUROCRYPT
2003
Springer
16 years 19 hour ago
Algebraic Attacks on Stream Ciphers with Linear Feedback
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
Nicolas Courtois, Willi Meier
FATES
2003
Springer
16 years 17 hour ago
Auto-generating Test Sequences Using Model Checkers: A Case Study
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
Mats Per Erik Heimdahl, Sanjai Rayadurgam, Willem ...