Sciweavers

54 search results - page 2 / 11
» Testing Scheme programming assignments automatically
Sort
View
ICFEM
2004
Springer
13 years 10 months ago
A General Model for Reachability Testing of Concurrent Programs
Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...
Richard H. Carver, Yu Lei
ACSE
1996
ACM
13 years 9 months ago
Literate programming as an aid to marking student assignments
In a university climate that sees rising student-sta ratios and increasing workloads for academics, any mechanism that reduces the student marking and assessment process must be w...
A. J. Hurst
IR
2006
13 years 5 months ago
Evolving local and global weighting schemes in information retrieval
This paper describes a method, using Genetic Programming, to automatically determine term weighting schemes for the vector space model. Based on a set of queries and their human de...
Ronan Cummins, Colm O'Riordan
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 6 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
ICSE
2004
IEEE-ACM
14 years 5 months ago
Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
Wee Kheng Leow, Siau-Cheng Khoo, Yi Sun