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 "permission inference for array programs"):
  Abstract: Information about the memory locations accessed by a program is, for instance, required for program parallelisation and program verification. Existing inference techniques for this information provide only partial solutions for the important class of array-manipulating programs. In this paper, we present a static analysis that infers the memory footprint of an array program in terms of permission pre- and postconditions as used, for example, in separation logic. This formulation allows our analysis to handle concurrent programs and produces specifications that can be used by verification tools. Our analysis expresses the permissions required by a loop via maximum expressions over the individual loop iterations. These maximum expressions are then solved by a novel maximum elimination algorithm, in the spirit of quantifier elimination. Our approach is sound and is implemented; an evaluation on existing benchmarks for memory safety of array programs demonstrates accurate results, even for programs with complex access patterns and nested loops.

Includes members:
  Member "decision procedure for entailment of symbolic heaps with arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decidability for entailments of symbolic heaps with arrays")
  Member "automating deductive verification for weak memory programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "concise read only specifications for better synthesis of programs with pointers extended version")
  Member "verifying array manipulating programs by tiling":
    also connected through other hyperedges:
      (none)
  Member "biabduction and related problems in array separation logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reasoning about block based cloud storage systems")
  Member "automatic verification of iterated separating conjunctions using symbolic execution":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "modular verification of heap reachability properties in separation logic")
  Member "definability of accelerated relations in a theory of arrays and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a simple abstraction of arrays and maps by program translation")

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)