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: "higher order symbolic execution via contracts"
  Abstract: We present a new approach to automated reasoning about higher-order programs by extending symbolic execution to use behavioral contracts as symbolic values, enabling symbolic approximation of higher-order behavior. #R##N#Our approach is based on the idea of an abstract reduction semantics that gives an operational semantics to programs with both concrete and symbolic components. Symbolic components are approximated by their contract and our semantics gives an operational interpretation of contracts-as-values. The result is a executable semantics that soundly predicts program behavior, including contract failures, for all possible instantiations of symbolic components. We show that our approach scales to an expressive language of contracts including arbitrary programs embedded as predicates, dependent function contracts, and recursive contracts. Supporting this feature-rich language of specifications leads to powerful symbolic reasoning using existing program assertions. #R##N#We then apply our approach to produce a verifier for contract correctness of components, including a sound and computable approximation to our semantics that facilitates fully automated contract verification. Our implementation is capable of verifying contracts expressed in existing programs, and of justifying valuable contract-elimination optimizations.

Connected through hyperedge HE-1 (induced by source paper "symbolic execution game semantics"):
  with members:
    - "finding the greedy prodigal and suicidal contracts at scale"
    - "higher order linearisability"

Connected through hyperedge HE-2 (induced by source paper "size change termination as a contract"):
  with members:
    - "soft contract verification for higher order stateful programs"
    - "abstracting definitional interpreters functional pearl"
    - "soft contract verification"
    - "from safety to termination and back smt based verification for lazy languages"
    - "abstracting abstract machines a systematic approach to higher order program analysis"
    - "abstracting abstract machines"
    - "a dynamic approach to characterizing termination of general logic programs"

Connected through hyperedge HE-3 (induced by source paper "interval based resource usage verification by translation into horn clauses and an application to energy consumption"):
  with members:
    - "energy transparency for deeply embedded programs"
    - "towards energy consumption verification via static analysis"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
    - "resource usage analysis of logic programs via abstract interpretation using sized types"
    - "more precise yet efficient type inference for logic programs"

Connected through hyperedge HE-4 (induced by source paper "gradual liquid type inference"):
  with members:
    - "learning to blame localizing novice type errors with data driven diagnosis"
    - "soft contract verification for higher order stateful programs"
    - "refinement reflection complete verification with smt"
    - "dynamic witnesses for static type errors or ill typed programs usually go wrong"
    - "soft contract verification"

Connected through hyperedge HE-5 (induced by source paper "abstracting definitional interpreters functional pearl"):
  with members:
    - "pushdown control flow analysis for free"
    - "galois transformers and modular abstract interpreters reusable metatheory for program analysis"
    - "soft contract verification"
    - "pushdown flow analysis with abstract garbage collection"
    - "simulation of two way pushdown automata revisited"
    - "abstracting abstract control extended"
    - "introspective pushdown analysis of higher order programs"
    - "systematic abstraction of abstract machines"

Connected through hyperedge HE-6 (induced by source paper "soft contract verification for higher order stateful programs"):
  with members:
    - "pushdown control flow analysis for free"
    - "soft contract verification"
    - "dependent types for javascript"
    - "abstracting abstract machines"

Connected through hyperedge HE-7 (induced by source paper "exploiting term hiding to reduce run time checking overhead"):
  with members:
    - "practical run time checking via unobtrusive property caching"
    - "xsb extending prolog with tabled logic programming"
    - "eclipse from lp to clp"
    - "sicstus prolog the first 25 years"

Connected through hyperedge HE-8 (induced by source paper "space efficient latent contracts"):
  with members:
    - "space efficient manifest contracts"

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)