{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/reinforcement-learning-for-automatic-test","title":"Reinforcement Learning for Automatic Test Case Prioritization and Selection in Continuous Integration","arxiv_id":"1811.04122","date":"2018-11-09","proceeding":null,"authors":["Helge Spieker","Arnaud Gotlieb","Dusica Marijan","Morten Mossige"],"abstract":"Testing in Continuous Integration (CI) involves test case prioritization,\nselection, and execution at each cycle. Selecting the most promising test cases\nto detect bugs is hard if there are uncertainties on the impact of committed\ncode changes or, if traceability links between code and tests are not\navailable. This paper introduces Retecs, a new method for automatically\nlearning test case selection and prioritization in CI with the goal to minimize\nthe round-trip time between code commits and developer feedback on failed test\ncases. The Retecs method uses reinforcement learning to select and prioritize\ntest cases according to their duration, previous last execution and failure\nhistory. In a constantly changing environment, where new test cases are created\nand obsolete test cases are deleted, the Retecs method learns to prioritize\nerror-prone test cases higher under guidance of a reward function and by\nobserving previous CI cycles. By applying Retecs on data extracted from three\nindustrial case studies, we show for the first time that reinforcement learning\nenables fruitful automatic adaptive test case selection and prioritization in\nCI and regression testing.","url_abs":"http://arxiv.org/abs/1811.04122v1","url_pdf":"http://arxiv.org/pdf/1811.04122v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"reinforcement-learning-for-automatic-test","repo_url":"https://bitbucket.org/helges/retecs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"reinforcement-learning-for-automatic-test","repo_url":"https://github.com/codeslord/RLforATCP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"bitbucket.org/helges/retecs","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"codeslord/RLforATCP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5d2a1b4e600d06b81873b7575c9352a1af248cf7e08877ea83c1fafbfdfa91ef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}