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: "flow sensitive composition of thread modular abstract interpretation"
  Abstract: We propose a constraint-based flow-sensitive static analysis for concurrent programs by iteratively composing thread-modular abstract interpreters via the use of a system of lightweight constraints. Our method is compositional in that it first applies sequential abstract interpreters to individual threads and then composes their results. It is flow-sensitive in that the causality ordering of interferences (flow of data from global writes to reads) is modeled by a system of constraints. These interference constraints are lightweight since they only refer to the execution order of program statements as opposed to their numerical properties: they can be decided efficiently using an off-the-shelf Datalog engine. Our new method has the advantage of being more accurate than existing, flow-insensitive, static analyzers while remaining scalable and providing the expected soundness and termination guarantees even for programs with unbounded data. We implemented our method and evaluated it on a large number of benchmarks, demonstrating its effectiveness at increasing the accuracy of thread-modular abstract interpretation.

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"
    - "thread modular static analysis for relaxed memory models"

Connected through hyperedge HE-2 (induced by source paper "datalog based scalable semantic diffing of concurrent programs"):
  with members:
    - "modular verification of interrupt driven software"
    - "thread modular static analysis for relaxed memory models"
    - "variable and thread bounding for systematic testing of multithreaded programs"

Connected through hyperedge HE-3 (induced by source paper "thread modular static analysis for relaxed memory models"):
  with members:
    - "stateless model checking for power"
    - "stateless model checking for tso and pso"
    - "herding cats modelling simulation testing and data mining for weak memory"
    - "software verification for weak memory via program transformation"
    - "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"

Connected through hyperedge HE-4 (induced by source paper "abstract interpretation with unfoldings"):
  with members:
    - "dynamic reductions for model checking concurrent software"
    - "static analysis of run time errors in embedded real time parallel c programs"
    - "from single thread to multithreaded an efficient static analysis algorithm"

Connected through hyperedge HE-5 (induced by source paper "modular verification of interrupt driven software"):
  with members:
    - "thread modular static analysis for relaxed memory models"
    - "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)