|Fulltext||0.05 MB||PDF (requires Acrobat Reader)||Previous|
|Authors:||Roberto Castañeda Lozano: School of Information and Communication Technology, KTH Royal Institute of Technology, Sweden|
|Publication title:||Constraint Programming for Random Testing of a Trading System|
|Conference:||The Swedish AI Society Workshop May 20-21, 2010, Uppsala University|
|Publication type:||Abstract and Fulltext|
|Abstract:||Financial markets use complex computer trading systems whose failures can cause serious economic damage, making reliability a major concern. Automated random testing has been shown to be useful in finding defects in these systems, but its inherent test oracle problem (automatic generation of the expected system output) is a drawback that has typically prevented its application on a larger scale.|
Two main tasks have been carried out in this thesis as a solution to the test oracle problem. First, an independent model of a real trading system based on constraint programming, a method for solving combinatorial problems, has been created. Then, the model has been integrated as a true test oracle in automated random tests. The test oracle maintains the expected state of an order book throughout a sequence of random trade order actions, and provides the expected output of every auction triggered in the order book by generating a corresponding constraint program that is solved with the aid of a constraint programming system.
Constraint programming has allowed the development of an inexpensive, yet reliable test oracle. In 500 random test cases, the test oracle has detected two system failures. These failures correspond to defects that had been present for several years without being discovered neither by less complete oracles nor by the application of more systematic testing approaches.
The main contributions of this thesis are: (1) empirical evidence of both the suitability of applying constraint programming to solve the test oracle problem and the effectiveness of true test oracles in random testing, and (2) a first attempt, as far as the author is aware, to model a non-theoretical combinatorial double auction using constraint programming.
|No. of pages:||1|
|Series:||Linköping Electronic Conference Proceedings|
|Publisher:||Linköping University Electronic Press, Linköpings universitet|
|REFERENCE TO THIS PAGE |