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: "thread modular static analysis for relaxed memory models"
  Abstract: We propose a memory-model-aware static program analysis method for accurately analyzing the behavior of concurrent software running on processors with weak consistency models such as x86-TSO, SPARC-PSO, and SPARC-RMO. At the center of our method is a unified framework for deciding the feasibility of inter-thread interferences to avoid propagating spurious data flows during static analysis and thus boost the performance of the static analyzer. We formulate the checking of interference feasibility as a set of Datalog rules which are both efficiently solvable and general enough to capture a range of hardware-level memory models. Compared to existing techniques, our method can significantly reduce the number of bogus alarms as well as unsound proofs. We implemented the method and evaluated it on a large set of multithreaded C programs. Our experiments showthe method significantly outperforms state-of-the-art techniques in terms of accuracy with only moderate run-time overhead.

Connected through hyperedge HE-1 (induced by source paper "abstract interpretation under speculative execution"):
  with members:
    - "mitigating power side channels during compilation"
    - "eliminating timing side channel leaks using program repair"
    - "adversarial symbolic execution for detecting concurrency related cache timing leaks"
    - "spectre attacks exploiting speculative execution"
    - "canal a cache timing analysis framework via llvm transformation"
    - "time protection the missing os abstraction"
    - "modular verification of interrupt driven software"
    - "flow sensitive composition of thread modular abstract interpretation"

Connected through hyperedge HE-2 (induced by source paper "dynamic verification with observational equivalence of c c concurrency"):
  with members:
    - "data centric dynamic partial order reduction"
    - "stateless model checking for power"
    - "unfolding based partial order reduction"
    - "stateless model checking for tso and pso"

Connected through hyperedge HE-3 (induced by source paper "datalog based scalable semantic diffing of concurrent programs"):
  with members:
    - "modular verification of interrupt driven software"
    - "flow sensitive composition of thread modular abstract interpretation"
    - "variable and thread bounding for systematic testing of multithreaded programs"

Connected through hyperedge HE-4 (induced by source paper "modular verification of interrupt driven software"):
  with members:
    - "flow sensitive composition of thread modular abstract interpretation"
    - "static analysis of run time errors in embedded real time parallel c programs"

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.PL(Programming Languages)