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 "formula slicing inductive invariants from preconditions"):
  Abstract: We propose a "formula slicing" method for finding inductive invariants. It is based on the observation that many loops in the program affect only a small part of the memory, and many invariants which were valid before a loop are still valid after. #R##N#Given a precondition of the loop, obtained from the preceding program fragment, we weaken it until it becomes inductive. The weakening procedure is guided by counterexamples-to-induction given by an SMT solver. Our algorithm applies to programs with arbitrary loop structure, and it computes the strongest invariant in an abstract domain of weakenings of preconditions. We call this algorithm "formula slicing", as it effectively performs "slicing" on formulas derived from symbolic execution. #R##N#We evaluate our algorithm on the device driver benchmarks from the International Competition on Software Verification (SV-COMP), and we show that it is competitive with the state-of-the-art verification techniques.

Includes members:
  Member "program analysis with local policy iteration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "combining forward and backward abstract interpretation of horn clauses")
  Member "automatic abstraction in smt based unbounded software model checking":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consort context and flow sensitive ownership refinement types for imperative programs")
  Member "pagai a path sensitive static analyzer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an observational investigation of reverse engineers processes")
  Member "using bounded model checking to focus fixpoint iterations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "combining forward and backward abstract interpretation of horn clauses")
  Member "software model checking via large block encoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "translating xd c programs to msvl programs")
  Member "cpachecker a tool for configurable software verification":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proving differential privacy with shadow execution")

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.LO(Logic in Computer Science)