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: "on the completeness of verifying message passing programs under bounded asynchrony"
  Abstract: We address the problem of verifying message passing programs, defined as a set of parallel processes communicating through unbounded FIFO buffers. We introduce a bounded analysis that explores a special type of computations, called k-synchronous. These computations can be viewed as (unbounded) sequences of interaction phases, each phase allowing at most k send actions (by different processes), followed by a sequence of receives corresponding to sends in the same phase. We give a procedure for deciding k-synchronizability of a program, i.e., whether every computation is equivalent (has the same happens-before relation) to one of its k-synchronous computations. We also show that reachability over k-synchronous computations and checking k-synchronizability are both PSPACE-complete. Furthermore, we introduce a class of programs called {\em flow-bounded} for which the problem of deciding whether there exists a k>0 for which the program is k-synchronizable, is decidable.

Connected through hyperedge HE-1 (induced by source paper "verifying asynchronous interactions via communicating session automata"):
  with members:
    - "synchronizability of communicating finite state machines is not decidable"
    - "multiparty compatibility for concurrent objects"
    - "timed runtime monitoring for multiparty conversations"
    - "multiparty session actors"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"
    - "propositional dynamic logic for message passing systems"

Connected through hyperedge HE-2 (induced by source paper "on the k synchronizability of systems"):
  with members:
    - "synchronizability of communicating finite state machines is not decidable"

Connected through hyperedge HE-3 (induced by source paper "verifying asynchronous event driven programs using partial abstract transformers extended manuscript"):
  with members:
    - "abstract interpretation with unfoldings"

Connected through hyperedge HE-4 (induced by source paper "combining symbolic execution and model checking to verify mpi programs"):
  with members:
    - "adversarial symbolic execution for detecting concurrency related cache timing leaks"
    - "static analysis of communicating processes using symbolic transducers"
    - "abstraction driven concolic testing"
    - "mpise symbolic execution of mpi programs"

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)