Sciweavers

1448 search results - page 13 / 290
» From Requirements to Code Revisited
Sort
View
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ERCIM
2008
78views more  ERCIM 2008»
13 years 7 months ago
Test Coverage Analysis and Preservation for Requirements-Based Testing
The testing process for safety-critical systems is usually evaluated with code coverage criteria such as MC/DC (Modified Condition/Decision Coverage) defined in the standard DO-17...
Raimund Kirner, Susanne Kandl
GLOBECOM
2008
IEEE
14 years 2 months ago
Adaptive Multicast Tree Construction for Elastic Data Streams
— In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for ...
Ying Zhu, Ken Q. Pu
JACM
2006
146views more  JACM 2006»
13 years 7 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
RE
2007
Springer
14 years 1 months ago
Value-Based Requirements Traceability: Lessons Learned
Abstract. Traceability from requirements to code is mandated by numerous software development standards. These standards, however, are not explicit about the appropriate level of q...
Alexander Egyed, Paul Grünbacher, Matthias He...