human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "model checker execution reports"
  Abstract: Verification techniques and software model checking in particular have gained considerable traction in industry, especially after a number of high-profile success stories tackling specific problems. However, widespread adoption remains distant and, among other causes, one obstacle is the huge number of systems that software model checkers cannot fully verify within predetermined time and memory bounds. The majority of tools available fail to provide any information for partial verification attempts, which makes them useless unless either full verification can be achieved or a bug is found. #R##N#The purpose of this work is to provide a conceptual framing to extend software model checkers in a way that allows users to access information about incomplete model checker runs. We characterize the information that model checkers themselves provide, in terms of what we call exploration oracles, and present the notion of execution reports, which we also formalize with respect to a safety property of interest and a system-under-analysis. #R##N#We instantiate these concepts for a family of techniques based on Abstract Reachability Trees and implement the approach using the software model checker CPAchecker. #R##N#We evaluate our approach empirically and discuss two case studies to illustrate the execution reports produced and the information that can be extracted.

Connected through hyperedge HE-1 (induced by source paper "verification artifacts in cooperative verification survey and unifying component framework"):
  with members:
    - "abstraction driven concolic testing"
    - "cpachecker a tool for configurable software verification"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.SE(Software Engineering)