Sciweavers

281 search results - page 4 / 57
» Concurrent Java Test Generation as a Search Problem
Sort
View
ISCIS
2003
Springer
14 years 20 days ago
Test Case Generation According to the Binary Search Strategy
One of the important tasks during software testing is the generation of test cases. Unfortunately, existing approaches to test case generation often have problems limiting their us...
Sami Beydeda, Volker Gruhn
CAV
2010
Springer
201views Hardware» more  CAV 2010»
13 years 11 months ago
Contessa: Concurrency Testing Augmented with Symbolic Analysis
Testing of multi-threaded programs poses enormous challenges. To improve the coverage of testing, we present a framework named CONTESSA that augments conventional testing (concrete...
Sudipta Kundu, Malay K. Ganai, Chao Wang
FLAIRS
2004
13 years 9 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
ASIAN
2004
Springer
150views Algorithms» more  ASIAN 2004»
14 years 27 days ago
Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Vijay A. Saraswat
SPIN
2010
Springer
13 years 5 months ago
Experimental Comparison of Concolic and Random Testing for Java Card Applets
Concolic testing is a method for test input generation where a given program is executed both concretely and symbolically at the same time. This paper introduces the LIME Concolic ...
Kari Kähkönen, Roland Kindermann, Keijo ...