human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "static analysis of run time errors in embedded real time parallel c programs"):
  Abstract: We present a static analysis by Abstract Interpretation to check for run-time#N#errors in parallel and multi-threaded C programs. Following our work on#N#Astr\'ee, we focus on embedded critical programs without recursion nor dynamic#N#memory allocation, but extend the analysis to a static set of threads#N#communicating implicitly through a shared memory and explicitly using a finite#N#set of mutual exclusion locks, and scheduled according to a real-time#N#scheduling policy and fixed priorities. Our method is thread-modular. It is#N#based on a slightly modified non-parallel analysis that, when analyzing a#N#thread, applies and enriches an abstract set of thread interferences. An#N#iterator then re-analyzes each thread in turn until interferences stabilize. We#N#prove the soundness of our method with respect to the sequential consistency#N#semantics, but also with respect to a reasonable weakly consistent memory#N#semantics. We also show how to take into account mutual exclusion and thread#N#priorities through a partitioning over an abstraction of the scheduler state.#N#We present preliminary experimental results analyzing an industrial program#N#with our prototype, Th\'es\'ee, and demonstrate the scalability of our#N#approach.

Includes members:
  Member "from single thread to multithreaded an efficient static analysis algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "abstract interpretation with unfoldings")
  Member "field sensitive value analysis of embedded c programs with union types and pointer arithmetics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable")
  Member "the octagon abstract domain":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reludiff differential verification of deep neural networks")
  Member "a static analyzer for large safety critical software":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable")

Question: Please tell me which class the source paper 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)