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: "verification of java bytecode using analysis and transformation of logic programs"
  Abstract: State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verification of Java bytecode (jvml). In order to achieve our goal, we rely on well-known techniques for meta-programming and program specialization. More precisely, we propose to partially evaluate a jvml interpreter implemented in LP together with (an LP representation of) a jvml program and then analyze the residual program. Interestingly, at least for the examples we have studied, our approach produces very simple LP representations of the original jvml programs. This can be seen as a decompilation from jvml to high-level LP source. By reasoning about such residual programs, we can automatically prove in the CiaoPP system some non-trivial properties of jvml programs such as termination, run-time error freeness and infer bounds on its resource consumption. We are not aware of any other system which is able to verify such advanced properties of Java bytecode.

Connected through hyperedge HE-1 (induced by source paper "solving horn clauses on inductive data types without induction"):
  with members:
    - "predicate pairing for program verification"
    - "automating induction for solving horn clauses"
    - "proving correctness of imperative programs by linearizing constrained horn clauses"
    - "automatic abstraction in smt based unbounded software model checking"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-2 (induced by source paper "predicate pairing for program verification"):
  with members:
    - "proving correctness of imperative programs by linearizing constrained horn clauses"
    - "the octagon abstract domain"
    - "logic program specialisation through partial deduction control issues"

Connected through hyperedge HE-3 (induced by source paper "proving correctness of imperative programs by linearizing constrained horn clauses"):
  with members:
    - "generalization strategies for the verification of infinite state systems"

Connected through hyperedge HE-4 (induced by source paper "verifying procedural programs via constrained rewriting induction"):
  with members:
    - "quasi reductivity of logically constrained term rewriting systems"
    - "termination of lctrss"
    - "t2 temporal property verification"
    - "software verification and graph similarity for automated evaluation of students assignments"
    - "software model checking via large block encoding"
    - "automated induction for complex data structures"
    - "removing redundant arguments automatically"
    - "a divergence critic for inductive proof"

Connected through hyperedge HE-5 (induced by source paper "verification of programs by combining iterated specialization with interpolation"):
  with members:
    - "analysis and transformation tools for constrained horn clause verification"
    - "generalization strategies for the verification of infinite state systems"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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)