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 "pointer life cycle types for lock free data structures with memory reclamation"):
  Abstract: We consider the verification of lock-free data structures that manually manage their memory with the help of a safe memory reclamation (SMR) algorithm. Our first contribution is a type system that checks whether a program properly manages its memory. If the type check succeeds, it is safe to ignore the SMR algorithm and consider the program under garbage collection. Intuitively, our types track the protection of pointers as guaranteed by the SMR algorithm. There are two design decisions. The type system does not track any shape information, which makes it extremely lightweight. Instead, we rely on invariant annotations that postulate a protection by the SMR. To this end, we introduce angels, ghost variables with an angelic semantics. Moreover, the SMR algorithm is not hard-coded but a parameter of the type system definition. To achieve this, we rely on a recent specification language for SMR algorithms. Our second contribution is to automate the type inference and the invariant check. For the type inference, we show a quadratic-time algorithm. For the invariant check, we give a source-to-source translation that links our programs to off-the-shelf verification tools. It compiles away the angelic semantics. This allows us to infer appropriate annotations automatically in a guess-and-check manner. To demonstrate the effectiveness of our type-based verification approach, we check linearizability for various list and set implementations from the literature with both hazard pointers and epoch-based memory reclamation. For many of the examples, this is the first time they are verified automatically. For the ones where there is a competitor, we obtain a speed-up of up to two orders of magnitude.

Includes members:
  Member "hyaline fast and transparent lock free memory reclamation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "universal wait free memory reclamation")
  Member "decoupling lock free data structures from memory reclamation for static analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "safe deferred memory reclamation with types")
  Member "safe deferred memory reclamation with types":
    also connected through other hyperedges:
      (none)
  Member "reasoning about tso programs using reduction and abstraction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "checking robustness against snapshot isolation")
  Member "reclaiming memory for lock free data structures there has to be a better way":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "quantifiability concurrent correctness from first principles")
  Member "verifying concurrent stacks by divergence sensitive bisimulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decoupling lock free data structures from memory reclamation for static analysis")
  Member "effect summaries for thread modular analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decoupling lock free data structures from memory reclamation for static analysis")

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)