Sciweavers

729 search results - page 33 / 146
» A Transitive Closure Based Algorithm for Test Generation
Sort
View
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
13 years 7 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
ICDCSW
2000
IEEE
14 years 1 days ago
Games-Based Model Checking of Protocols: counting doesn't count
We introduce a technique that can be used to model the behaviour of protocols. In our model each process within a protocol belongs to a particular class. A set of rules governs th...
Tim Kempster, Colin Stirling, Peter Thanisch
FUIN
2008
98views more  FUIN 2008»
13 years 7 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
SPIN
2000
Springer
13 years 11 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
PTS
2010
134views Hardware» more  PTS 2010»
13 years 6 months ago
A Learning-Based Approach to Unit Testing of Numerical Software
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
Karl Meinke, Fei Niu