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 "verification of programs via intermediate interpretation"):
  Abstract: We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin's supercompilation is used to specialize some interpreters with respect to the program models. We show that several safety properties of functional programs modeling a class of cache coherence protocols can be proved by a supercompiler and compare the results with our earlier work on direct verification via supercompilation not using intermediate interpretation. #R##N#Our approach was in part inspired by an earlier work by E. De Angelis et al. (2014-2015) where verification via program transformation and intermediate interpretation was studied in the context of specialization of constraint logic programs.

Includes members:
  Member "generating counterexamples for model checking by transformation":
    also connected through other hyperedges:
      (none)
  Member "generating counterexamples for model checking by transformation":
    also connected through other hyperedges:
      (none)
  Member "turchin s relation for call by name computations a formal approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "verifying programs via intermediate interpretation")
  Member "verifying temporal properties of reactive systems by transformation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generating counterexamples for model checking by transformation")
  Member "proving correctness of imperative programs by linearizing constrained horn clauses":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lemma generation for horn clause satisfiability a preliminary study")
  Member "generalization strategies for the verification of infinite state systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "verification and synthesis of symmetric uni rings for leads to properties")
  Member "positive supercompilation for a higher order call by value language":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "verifying programs via intermediate interpretation")

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)