Unit Testing in ASPIDE

Answer Set Programming (ASP) is a declarative logic programming formalism, which is employed nowadays in both academic and industrial real-world applications. Although some tools for supporting the development of ASP programs have been proposed in the last few years, the crucial task of testing ASP programs received less attention, and is an Achilles' heel of the available programming environments. In this paper we present a language for specifying and running unit tests on ASP programs. The testing language has been implemented in ASPIDE, a comprehensive IDE for ASP, which supports the entire life-cycle of ASP development with a collection of user-friendly graphical tools for program composition, testing, debugging, profiling, solver execution configuration, and output-handling.Comment: 12 pages, 4 figures, Proceedings of the 25th Workshop on Logic Programming (WLP 2011

Search for doubly charged Higgs bosons in like-sign dilepton final states at root s=7 TeV with the ATLAS detector

A search for doubly charged Higgs bosons decaying to pairs of electrons and/or muons is presented. The search is performed using a data sample corresponding to an integrated luminosity of 4.7 fb(-1) of pp collisions at root s = 7 TeV collected by the ATLAS detector at the LHC. Pairs of prompt, isolated, high-p(T) leptons with the same electric charge (e(+/-)e(+/-), e(+/-)mu, mu(+/-)mu(+/-)) are selected, and their invariant mass distribution is searched for a narrow resonance. No significant excess over Standard Model background expectations is observed, and limits are placed on the cross section times branching ratio for pair production of doubly charged Higgs bosons. The masses of doubly charged Higgs bosons are constrained depending on the branching ratio into these leptonic final states. Assuming pair production, coupling to left-handed fermions, and a branching ratio of 100% for each final state, masses below 409 GeV, 375 GeV, and 398 GeV are excluded for e(+/-)e(+/-), e(+/-)mu(+/-),and mu(+/-)mu(+/-), respectively