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 "size change termination as a contract"):
  Abstract: Program termination is an undecidable, yet important, property relevant to program verification, optimization, debugging, partial evaluation, and dependently-typed programming, among many other topics. This has given rise to a large body of work on static methods for conservatively predicting or enforcing termination. A simple effective approach is the size-change termination (SCT) method, which operates in two-phases: (1) abstract programs into "size-change graphs," and (2) check these graphs for the size-change property: the existence of paths that lead to infinitely decreasing value sequences. #R##N#This paper explores the termination problem starting from a different vantage point: we propose transposing the two phases of the SCT analysis by developing an operational semantics that accounts for the run time checking of the size-change property, postponing program abstraction or avoiding it entirely. This choice has two important consequences: SCT can be monitored and enforced at run-time and termination analysis can be rephrased as a traditional safety property and computed using existing abstract interpretation methods. #R##N#We formulate this run-time size-change check as a contract. This contributes the first run-time mechanism for checking termination in a general-purporse programming language. The result nicely compliments existing contracts that enforce partial correctness to obtain the first contracts for total correctness. Our approach combines the robustness of SCT with precise information available at run-time. To obtain a sound and computable analysis, it is possible to apply existing abstract interpretation techniques directly to the operational semantics; there is no need for an abstraction tailored to size-change graphs. We apply higher-order symbolic execution to obtain a novel termination analysis that is competitive with existing, purpose-built termination analyzers.

Includes members:
  Member "soft contract verification for higher order stateful programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gradual liquid type inference")
  Member "abstracting definitional interpreters functional pearl":
    also connected through other hyperedges:
      (none)
  Member "soft contract verification":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gradual liquid type inference")
  Member "from safety to termination and back smt based verification for lazy languages":
    also connected through other hyperedges:
      (none)
  Member "abstracting abstract machines a systematic approach to higher order program analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "skeletal semantics and their interpretations")
  Member "higher order symbolic execution via contracts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "symbolic execution game semantics")
  Member "abstracting abstract machines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "skeletal semantics and their interpretations")
  Member "a dynamic approach to characterizing termination of general logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "productive corecursion in logic programming")

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)