Sciweavers

10715 search results - page 142 / 2143
» Proofs from Tests
Sort
View
ICSM
2005
IEEE
14 years 4 months ago
Test Suite Reduction with Selective Redundancy
Software testing is a critical part of software development. Test suite sizes may grow significantly with subsequent modifications to the software over time. Due to time and res...
Dennis Jeffrey, Neelam Gupta
AIML
2004
14 years 6 days ago
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
Martin Lange
FUIN
2010
101views more  FUIN 2010»
13 years 8 months ago
Infinite Product of Traces Represented by Projections
The construction of an associative -product of traces from an earlier paper is revisited using projection representation of traces. Using projections instead of trace prefixes res...
Roman R. Redziejowski
ICCAD
2001
IEEE
113views Hardware» more  ICCAD 2001»
14 years 7 months ago
The Design and Optimization of SOC Test Solutions
1 We propose an integrated technique for extensive optimization of the final test solution for System-on-Chip using Simulated Annealing. The produced results from the technique ar...
Erik Larsson, Zebo Peng, Gunnar Carlsson
QSIC
2007
IEEE
14 years 5 months ago
Testing against Natural Language Requirements
: Testing against natural language requirements is the standard approach for system and acceptance testing. This test is often performed by an independent test organization unfamil...
Harry M. Sneed