Sciweavers

444 search results - page 19 / 89
» Sensitive state-space exploration
Sort
View
SPIN
2009
Springer
15 years 6 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh
SPIN
2009
Springer
15 years 6 months ago
Fast, All-Purpose State Storage
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
Peter C. Dillinger, Panagiotis Manolios
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
15 years 5 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
IJAIT
2000
142views more  IJAIT 2000»
14 years 11 months ago
Adequacy of Limited Testing for Knowledge Based Systems
Knowledge-based engineering and computational intelligence are expected to become core technologies in the design and manufacturing for the next generation of space exploration mi...
Tim Menzies, Bojan Cukic
SIGIR
2008
ACM
14 years 11 months ago
Exploring mouse movements for inferring query intent
Clickthrough on search results have been successfully used to infer user interest and preferences, but are often noisy and potentially ambiguous. We explore the potential of a com...
Qi Guo, Eugene Agichtein