Testing continuous double auctions with a constraint-based oracle

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Computer trading systems are essential for today's financial markets where the trading systems' correctness is of paramount economical significance. Automated random testing is a useful technique to find bugs in these systems, but it requires an independent system to decide the correctness of the system under test (known as oracle problem). This paper introduces a constraint-based oracle for random testing of a real-world trading system. The oracle provides the expected results by generating and solving constraint models of the trading system's continuous double auction. Constraint programming is essential for the correctness of the test oracle as the logic for calculating trades can be mapped directly to constraint models. The paper shows that the generated constraint models can be solved efficiently. Most importantly, the approach is shown to be successful by finding errors in a deployed financial trading system and in its specification. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Castañeda Lozano, R., Schulte, C., & Wahlberg, L. (2010). Testing continuous double auctions with a constraint-based oracle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6308 LNCS, pp. 613–627). Springer Verlag. https://doi.org/10.1007/978-3-642-15396-9_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free