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: "a static analyzer for large safety critical software"
  Abstract: We show that abstract interpretation-based static program analysis can be made efficient and precise enough to formally verify a class of properties for a family of large programs with few or no false alarms. This is achieved by refinement of a general purpose static analyzer and later adaptation to particular programs of the family by the end-user through parametrization. This is applied to the proof of soundness of data manipulation operations at the machine level for periodic synchronous safety critical embedded software.The main novelties are the design principle of static analyzers by refinement and adaptation through parametrization (Sect. 3 and 7), the symbolic manipulation of expressions to improve the precision of abstract transfer functions (Sect. 6.3), the octagon (Sect. 6.2.2), ellipsoid (Sect. 6.2.3), and decision tree (Sect. 6.2.4) abstract domains, all with sound handling of rounding errors in oating point computations, widening strategies (with thresholds: Sect. 7.1.2, delayed: Sect. 7.1.3) and the automatic determination of the parameters (parametrized packing: Sect. 7.2).

Connected through hyperedge HE-1 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable"):
  with members:
    - "get rid of inline assembly through verification oriented lifting"
    - "structural analysis shape information via points to computation"
    - "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"
    - "symbolic methods to enhance the precision of numerical abstract domains"

Connected through hyperedge HE-2 (induced by source paper "verismart a highly precise safety verifier for ethereum smart contracts"):
  with members:
    - "finding the greedy prodigal and suicidal contracts at scale"
    - "online detection of effectively callback free objects with applications to smart contracts"
    - "gastap a gas analyzer for smart contracts"
    - "contractfuzzer fuzzing smart contracts for vulnerability detection"
    - "a semantic framework for the security analysis of ethereum smart contracts"
    - "formal specification and verification of smart contracts for azure blockchain"
    - "vandal a scalable security analysis framework for smart contracts"
    - "securify practical security analysis of smart contracts"

Connected through hyperedge HE-3 (induced by source paper "a hypergraph based approach for the 4 constraint satisfaction problem tractability"):
  with members:
    - "language emptiness of continuous time parametric timed automata"
    - "schaefer s theorem for graphs"
    - "a new numerical abstract domain based on difference bound matrices"
    - "the octagon abstract domain"
    - "the essence of constraint propagation"

Connected through hyperedge HE-4 (induced by source paper "syminfer inferring program invariants using symbolic states"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "using dynamic analysis to generate disjunctive invariants"

Connected through hyperedge HE-5 (induced by source paper "an open source sensor platform for analysis of group dynamics"):
  with members:
    - "the architecture of innovation tracking face to face interactions with ubicomp technologies"

Connected through hyperedge HE-6 (induced by source paper "evaluating design tradeoffs in numeric static analysis for java"):
  with members:
    - "modular construction of shape numeric analyzers"
    - "pagai a path sensitive static analyzer"
    - "relational abstract domains for the detection of floating point run time errors"
    - "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-7 (induced by source paper "a verified certificate checker for finite precision error bounds in coq and hol4"):
  with members:
    - "on sound relative error bounds for floating point arithmetic"
    - "certified roundoff error bounds using semidefinite programming"
    - "a linear first order functional intermediate language for verified compilers"
    - "towards a compiler for reals"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "robustness analysis of finite precision implementations"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "certification of bounds on expressions involving rounded operators"

Connected through hyperedge HE-8 (induced by source paper "sound mixed precision optimization with rewriting"):
  with members:
    - "on sound relative error bounds for floating point arithmetic"
    - "certified roundoff error bounds using semidefinite programming"
    - "towards a compiler for reals"
    - "robustness analysis of finite precision implementations"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "synthesis of minimal error control 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)