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: "automatic verification of iterated separating conjunctions using symbolic execution"
  Abstract: In permission logics such as separation logic, the iterated separating conjunction is a quantifier denoting access permission to an unbounded set of heap locations. In contrast to recursive predicates, iterated separating conjunctions do not prescribe a structure on the locations they range over, and so do not restrict how to traverse and modify these locations. This flexibility is important for the verification of random-access data structures such as arrays and data structures that can be traversed in multiple ways such as graphs. Despite its usefulness, no automatic program verifier natively supports iterated separating conjunctions; they are especially difficult to incorporate into symbolic execution engines, the prevalent technique for building verifiers for these logics. #R##N#In this paper, we present the first symbolic execution technique to support general iterated separating conjunctions. We propose a novel representation of symbolic heaps and flexible support for logical specifications that quantify over heap locations. Our technique exhibits predictable and fast performance despite employing quantifiers at the SMT level, by carefully controlling quantifier instantiations. It is compatible with other features of permission logics such as fractional permissions, recursive predicates, and abstraction functions. Our technique is implemented as an extension of the Viper verification infrastructure.

Connected through hyperedge HE-1 (induced by source paper "modular verification of heap reachability properties in separation logic"):
  with members:
    - "the relationship between separation logic and implicit dynamic frames"
    - "simulating reachability using first order logic with applications to verification of linked data structures"

Connected through hyperedge HE-2 (induced by source paper "local reasoning for global graph properties"):
  with members:
    - "modular verification of heap reachability properties in separation logic"
    - "deciding entailments in inductive separation logic with tree automata"

Connected through hyperedge HE-3 (induced by source paper "permission inference for array programs"):
  with members:
    - "decision procedure for entailment of symbolic heaps with arrays"
    - "automating deductive verification for weak memory programs"
    - "verifying array manipulating programs by tiling"
    - "biabduction and related problems in array separation logic"
    - "definability of accelerated relations in a theory of arrays and its applications"

Connected through hyperedge HE-4 (induced by source paper "automating deductive verification for weak memory programs"):
  with members:
    - "stateless model checking for power"
    - "the relationship between separation logic and implicit dynamic frames"

Connected through hyperedge HE-5 (induced by source paper "enhancing symbolic execution of heap based programs with separation logic for test input generation"):
  with members:
    - "concolic testing heap manipulating programs"

Connected through hyperedge HE-6 (induced by source paper "biabduction and related problems in array separation logic"):
  with members:
    - "subclasses of presburger arithmetic and the weak exp hierarchy"
    - "the tree width of separation logic with recursive definitions"

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)