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 modular abstractions for linear constraints"
  Abstract: We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operating on rational, real or floating-point variables and containing linear assignments and tests. In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions. Our algorithms are based on new quantifier elimination and symbolic manipulation techniques. Given the specification of an abstract domain, and a program block, our method automatically outputs an implementation of the corresponding abstract transformer. It is thus a form of program transformation. The motivation of our work is data-flow synchronous programming languages, used for building control-command embedded systems, but it also applies to imperative and functional programming.

Connected through hyperedge HE-1 (induced by source paper "compositional invariant generation via linear recurrence analysis"):
  with members:
    - "abstract acceleration of general linear loops"
    - "an algebraic framework for compositional program analysis"
    - "symbolic methods to enhance the precision of numerical abstract domains"

Connected through hyperedge HE-2 (induced by source paper "an instantiation based approach for solving quantified linear arithmetic"):
  with members:
    - "smt based model checking for recursive programs"

Connected through hyperedge HE-3 (induced by source paper "parametric strategy iteration"):
  with members:
    - "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-4 (induced by source paper "abstract acceleration of general linear loops"):
  with members:
    - "the octagon abstract domain"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "transfer function synthesis without quantifier elimination"):
  with members:
    - "automatic modular abstractions for template numerical constraints"
    - "logic programming with satisfiability"
    - "accelerated data flow analysis"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-6 (induced by source paper "invariant stream generators using automatic abstract transformers based on a decidable logic"):
  with members:
    - "using bounded model checking to focus fixpoint iterations"
    - "pkind a parallel k induction based model checker"
    - "improving strategies via smt solving"

Connected through hyperedge HE-7 (induced by source paper "bound analysis of imperative programs with the size change abstraction extended version"):
  with members:
    - "monotonicity constraints for termination in the integer domain"
    - "software model checking via large block encoding"

Connected through hyperedge HE-8 (induced by source paper "improving strategies via smt solving"):
  with members:
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "a quantifier elimination algorithm for linear real arithmetic"
    - "a new numerical abstract domain based on difference bound matrices"
    - "accelerated data flow analysis"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

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)