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: "what good are strong specifications"
  Abstract: Experience with lightweight formal methods suggests that programmers are willing to write specification if it brings tangible benefits to their usual development activities. This paper considers stronger specifications and studies whether they can be deployed as an incremental practice that brings additional benefits without being unacceptably expensive. We introduce a methodology that extends Design by Contract to write strong specifications of functional properties in the form of preconditions, postconditions, and invariants. The methodology aims at being palatable to developers who are not fluent in formal techniques but are comfortable with writing simple specifications. We evaluate the cost and the benefits of using strong specifications by applying the methodology to testing data structure implementations written in Eiffel and C#. In our extensive experiments, testing against strong specifications detects twice as many bugs as standard contracts, with a reasonable overhead in terms of annotation burden and run-time performance while testing. In the wide spectrum of formal techniques for software quality, testing against strong specifications lies in a "sweet spot" with a favorable benefit to effort ratio.

Connected through hyperedge HE-1 (induced by source paper "autoframe automatic frame inference for object oriented languages"):
  with members:
    - "autoalias automatic variable precision alias analysis for object oriented programs"
    - "autoproof auto active functional verification of object oriented programs"
    - "specifying reusable components"
    - "inferring loop invariants using postconditions"

Connected through hyperedge HE-2 (induced by source paper "class invariants concepts problems solutions"):
  with members:
    - "flexible invariants through semantic collaboration"
    - "steps towards a theory and calculus of aliasing"

Connected through hyperedge HE-3 (induced by source paper "a theoretical framework for understanding mutation based testing methods"):
  with members:
    - "software mutational robustness"

Connected through hyperedge HE-4 (induced by source paper "inferring loop invariants by mutation dynamic analysis and static checking"):
  with members:
    - "using dynamic analysis to generate disjunctive invariants"
    - "flexible invariants through semantic collaboration"
    - "loop invariants analysis classification and examples"
    - "specifying reusable components"
    - "inferring loop invariants using postconditions"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "contracts in practice"):
  with members:
    - "flexible invariants through semantic collaboration"
    - "class schema evolution for persistent object oriented software model empirical study and automated support"
    - "stateful testing finding more errors in code and contracts"
    - "collaborative software development on the web"

Connected through hyperedge HE-6 (induced by source paper "automated fixing of programs with contracts"):
  with members:
    - "contracts in practice"
    - "code based automated program fixing"
    - "specifying reusable components"

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.SE(Software Engineering)