Reusing System States by Active Learning Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Reusing System States by Active Learning Algorithms


In this paper we present a practical optimization to active automata learning that reduces the average execution time per query as well as the number of actual tests to be executed. Key to our optimization are two observations: (1) establishing well-defined initial conditions for a test (reset) is a very expensive operation on real systems, as it usually involves modifications to the persisted state of the system (e.g., a database). (2) In active learning many of the (sequentially) produced queries are extensions of previous queries. We exploit these observations by using the same test run on a real system for multiple "compatible'' queries. We maintain a pool of runs on the real system (system states), and execute only suffixes of queries on the real system whenever possible. The optimizations allow us to apply active learning to an industry-scale web-application running on an enterprise platform: the Online Conference Service (OCS) an online service-oriented manuscript submission and review system.
Not file

Dates and versions

hal-00664310 , version 1 (30-01-2012)


  • HAL Id : hal-00664310 , version 1


Oliver Bauer, Johannes Neubauer, Bernhard Steffen, Falk Howar. Reusing System States by Active Learning Algorithms. Eternal Systems, May 2011, Budapest, Hungary. pp.61-78. ⟨hal-00664310⟩


89 View
0 Download


Gmail Facebook Twitter LinkedIn More