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 "backward reachability of array based systems by smt solving termination and invariant synthesis"):
  Abstract: The safety of infinite state systems can be checked by a backward#N#reachability procedure. For certain classes of systems, it is possible to prove#N#the termination of the procedure and hence conclude the decidability of the#N#safety problem. Although backward reachability is property-directed, it can#N#unnecessarily explore (large) portions of the state space of a system which are#N#not required to verify the safety property under consideration. To avoid this,#N#invariants can be used to dramatically prune the search space. Indeed, the#N#problem is to guess such appropriate invariants. In this paper, we present a#N#fully declarative and symbolic approach to the mechanization of backward#N#reachability of infinite state systems manipulating arrays by Satisfiability#N#Modulo Theories solving. Theories are used to specify the topology and the data#N#manipulated by the system. We identify sufficient conditions on the theories to#N#ensure the termination of backward reachability and we show the completeness of#N#a method for invariant synthesis (obtained as the dual of backward#N#reachability), again, under suitable hypotheses on the theories. We also#N#present a pragmatic approach to interleave invariant synthesis and backward#N#reachability so that a fix-point for the set of backward reachable states is#N#more easily obtained. Finally, we discuss heuristics that allow us to derive an#N#implementation of the techniques in the model checker MCMT, showing remarkable#N#speed-ups on a significant set of safety problems extracted from a variety of#N#sources.

Includes members:
  Member "on model checking data independent systems with arrays without reset":
    also connected through other hyperedges:
      (none)
  Member "predicate abstraction with indexed predicates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "inferring inductive invariants from phase structures")

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)