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 "decoupling lock free data structures from memory reclamation for static analysis"):
  Abstract: Verification of concurrent data structures is one of the most challenging tasks in software verification. The topic has received considerable attention over the course of the last decade. Nevertheless, human-driven techniques remain cumbersome and notoriously difficult while automated approaches suffer from limited applicability. The main obstacle for automation is the complexity of concurrent data structures. This is particularly true in the absence of garbage collection. The intricacy of lock-free memory management paired with the complexity of concurrent data structures makes automated verification prohibitive. #R##N#In this work we present a method for verifying concurrent data structures and their memory management separately. We suggest two simpler verification tasks that imply the correctness of the data structure. The first task establishes an over-approximation of the reclamation behavior of the memory management. The second task exploits this over-approximation to verify the data structure without the need to consider the implementation of the memory management itself. To make the resulting verification tasks tractable for automated techniques, we establish a second result. We show that a verification tool needs to consider only executions where a single memory location is reused. We implemented our approach and were able to verify linearizability of Michael&Scott's queue and the DGLM queue for both hazard pointers and epoch-based reclamation. To the best of our knowledge, we are the first to verify such implementations fully automatically.

Includes members:
  Member "verification of tree based hierarchical read copy update in the linux kernel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "safe deferred memory reclamation with types")
  Member "reclaiming memory for lock free data structures there has to be a better way":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis and evaluation of non blocking interpolation search trees")
  Member "proving linearizability using forward simulations":
    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 "verifying concurrent stacks by divergence sensitive bisimulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")
  Member "effect summaries for thread modular analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")
  Member "concurrent data structures linked in time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")
  Member "pointer race freedom":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")
  Member "faster linearizability checking via p compositionality":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")

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)