Zhang, F.Zhao, YSanan, DavidLiu, YangTiu, AlwenLin, Shang-WeiSun, Jun2024-02-12July 15-17978-331995581-0http://hdl.handle.net/1885/313397Scalable and automatic formal verification for concurrent systems is always demanding. In this paper, we propose a verification framework to support automated compositional reasoning for concurrent programs with shared variables. Our framework models concurrent programs as succinct automata and supports the verification of multiple important properties. Safety verification and simulations of succinct automata are parallel compositional, and safety properties of succinct automata are preserved under refinements. We generate succinct automata from infinite state concurrent programs in an automated manner. Furthermore, we propose the first automated approach to checking rely-guarantee based simulations between infinite state concurrent programs. We have prototyped our algorithms and applied our tool to the verification of multiple refinements.This research is supported (in part) by the National Research Foundation, Prime Ministers Office, Singapore under its National Cybersecurity R&D Program (Award No. NRF2014NCR-NCR001-30) and administered by the National Cybersecurity R&D Directorate.application/pdfen-AU© Springer International Publishing AG, part of Springer Nature 2018201810.1007/978-3-319-95582-7_312022-10-02