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 "compositional verification of heap manipulating programs through property guided learning"):
  Abstract: Analyzing and verifying heap-manipulating programs automatically is challenging. A key for fighting the complexity is to develop compositional methods. For instance, many existing verifiers for heap-manipulating programs require user-provided specification for each function in the program in order to decompose the verification problem. The requirement, however, often hinders the users from applying such tools. To overcome the issue, we propose to automatically learn heap-related program invariants in a property-guided way for each function call. The invariants are learned based on the memory graphs observed during test execution and improved through memory graph mutation. We implemented a prototype of our approach and integrated it with two existing program verifiers. The experimental results show that our approach enhances existing verifiers effectively in automatically verifying complex heap-manipulating programs with multiple function calls.

Includes members:
  Member "sling using dynamic analysis to infer program invariants in separation logic":
    also connected through other hyperedges:
      (none)
  Member "concolic testing heap manipulating programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing symbolic execution of heap based programs with separation logic for test input generation")
  Member "enhancing symbolic execution of heap based programs with separation logic for test input generation":
    also connected through other hyperedges:
      (none)
  Member "gated graph sequence neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "fully automated shape analysis based on forest automata":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")
  Member "learning universally quantified invariants of linear data structures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "horn ice learning for synthesizing invariantsand contracts")
  Member "cpachecker a tool for configurable software verification":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proving differential privacy with shadow execution")
  Member "the octagon abstract domain":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reludiff differential verification of deep neural networks")

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)