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: "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"
  Abstract: We propose a memory abstraction able to lift existing numerical static analyses to C programs containing union types, pointer casts, and arbitrary pointer arithmetics. Our framework is that of a combined points-to and data-value analysis. We abstract the contents of compound variables in a field-sensitive way, whether these fields contain numeric or pointer values, and use stock numerical abstract domains to find an overapproximation of all possible memory states--with the ability to discover relationships between variables. A main novelty of our approach is the dynamic mapping scheme we use to associate a flat collection of abstract cells of scalar type to the set of accessed memory locations, while taking care of byte-level aliases - i.e., C variables with incompatible types allocated in overlapping memory locations. We do not rely on static type information which can be misleading in C programs as it does not account for all the uses a memory zone may be put to. Our work was incorporated within the Astr\'{e}e static analyzer that checks for the absence of run-time-errors in embedded, safety-critical, numerical-intensive software. It replaces the former memory domain limited to well-typed, union-free, pointer-cast free data-structures. Early results demonstrate that this abstraction allows analyzing a larger class of C programs, without much cost overhead.

Connected through hyperedge HE-1 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable"):
  with members:
    - "get rid of inline assembly through verification oriented lifting"
    - "structural analysis shape information via points to computation"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-2 (induced by source paper "exploiting pointer analysis in memory models for deductive verification"):
  with members:
    - "on the complexity of pointer arithmetic in separation logic an extended version"
    - "a decision procedure for separation logic in smt"
    - "mechanized semantics for the clight subset of the c language"

Connected through hyperedge HE-3 (induced by source paper "thread modular static analysis for relaxed memory models"):
  with members:
    - "flow sensitive composition of thread modular abstract interpretation"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "abstract interpretation using a language of symbolic approximation"):
  with members:
    - "modular construction of shape numeric analyzers"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "hierarchical shape abstraction for analysis of free list memory allocators"):
  with members:
    - "on automated lemma generation for separation logic with inductive definitions"
    - "modular construction of shape numeric analyzers"

Connected through hyperedge HE-6 (induced by source paper "on the verification of scoop programs"):
  with members:
    - "towards practical graph based verification for an object oriented concurrency model"
    - "expression based aliasing for oo languages"

Connected through hyperedge HE-7 (induced by source paper "expression based aliasing for oo languages"):
  with members:
    - "alias and change calculi applied to frame inference"

Connected through hyperedge HE-8 (induced by source paper "formal verification of a c value analysis based on abstract interpretation"):
  with members:
    - "a formally verified compiler back end"
    - "separation logic for small step cminor"

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)