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 "reasoning about block based cloud storage systems"):
  Abstract: Owing to the massive growth in the storage demands of big data, Cloud Storage Systems (CSSs) have been put forward to improve the storage capacity. Compared with traditional storage systems, CSSs have lots of advantages, such as higher capacity, lower cost, and easier scalability. But they are also with higher complexity. In order to ensure CSSs to be reliable, it is necessary to prove the correctness of CSSs management programs. In fact, we are going to verify Block-based Cloud Storage Systems (BCSSs), since BCSSs are the most popular CSSs. #R##N#In this paper, the correctness of management programs in BCSSs have been proven, and a verification framework based on separation logic is proposed to finish the proven process. The main contributions are as follows. (1) A novel framework with two-tier heap structure is constructed to reflect the characteristics of BCSSs, and a modeling language is defined based on it. (2) Assertions based on separation logic is constructed to describe the properties of BCSSs. (3) The Hoare-style specifications are proposed to reason about the BCSSs. The results demonstrate that the correctness and reliability of BCSSs can be verified by the above proposed methods. Furthermore, the proposed specifications is sound in the application of reasoning about BCSSs.

Includes members:
  Member "biabduction and related problems in array separation logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "permission inference for array programs")
  Member "automated mutual explicit induction proof in separation logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sling using dynamic analysis to infer program invariants in separation logic")

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)