K. R. Abrahamson, Modal logic of concurrent nondeterministic programs, Semantics of Concurrent Computation, pp.21-33, 1979.
DOI : 10.1007/BFb0022461

P. Balbiani and J. Boudou, Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition, CADE-25, pp.539-554, 2015.
DOI : 10.1007/978-3-319-21401-6_37

URL : https://hal.archives-ouvertes.fr/hal-01650183

P. Balbiani and T. Tinchev, Definability and computability for PRSPDL Advances in Modal Logic -AiML, pp.16-33, 2014.

M. R. Benevides, R. P. De-freitas, and J. P. Viana, Propositional Dynamic Logic with Storing, Recovering and Parallel Composition, Logical and Semantic Frameworks, with Applications -LSFA. ENTCS, pp.95-107, 2011.
DOI : 10.1016/j.entcs.2011.03.008

URL : https://doi.org/10.1016/j.entcs.2011.03.008

J. Boudou, Exponential-Size Model Property for PDL with Separating Parallel Composition, MFCS 2015, pp.129-140, 2015.
DOI : 10.1007/978-3-662-48057-1_10

S. Brookes, A semantics for concurrent separation logic, Theoret. Comput. Sci, vol.37513, pp.227-270, 2007.
DOI : 10.1007/978-3-540-28644-8_2

URL : http://www.cs.cmu.edu/~brookes/concur2004tutorialpaper.pdf

C. Calcagno, H. Yang, and P. W. O-'hearn, Computability and Complexity Results for a Spatial Assertion Language for Data Structures, FSTTCS 2001, pp.108-119, 2001.
DOI : 10.1007/3-540-45294-X_10

S. Demri and M. Deters, Separation logics and modalities: a survey, Journal of Applied Non-Classical Logics, vol.2, issue.23, pp.50-99, 2015.
DOI : 10.1007/11690634_7

J. Van-eijck and M. Stokhof, The gamut of dynamic logics, Logic and the Modalities in the Twentieth Century. Handbook of the History of Logic, pp.499-600, 2006.
DOI : 10.1016/S1874-5857(06)80033-6

M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol.18, issue.2, pp.194-211, 1979.
DOI : 10.1016/0022-0000(79)90046-1

URL : https://doi.org/10.1016/0022-0000(79)90046-1

M. F. Frias, Fork Algebras in Algebra, Logic and Computer Science, Advances in Logic World Scientific, vol.2, 2002.
DOI : 10.1142/9789812777928

D. Harel, Recurring dominoes: Making the highly undecidable highly understandable (preliminary report), LNCS, vol.158, pp.177-194, 1983.
DOI : 10.1007/3-540-12689-9_103

A. Herzig, A simple separation logic Decidable and undecidable logics with a binary modality, WoLLIC 2013, pp.168-178, 1995.

M. Lange, Model checking propositional dynamic logic with all extras, Journal of Applied Logic, vol.4, issue.1, pp.39-49, 2006.
DOI : 10.1016/j.jal.2005.08.002

URL : https://doi.org/10.1016/j.jal.2005.08.002

M. Lange and C. Lutz, Abstract, The Journal of Symbolic Logic, vol.B, issue.04, pp.1072-1086, 2005.
DOI : 10.3166/jancl.15.115-135

D. Larchey-wendling and D. Galmiche, The Undecidability of Boolean BI through Phase Semantics, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.140-149, 2010.
DOI : 10.1109/LICS.2010.18

URL : https://hal.archives-ouvertes.fr/hal-00577919

M. Marx, L. Pólos, and M. Masuch, Arrow Logic and Multi-modal Logic, 1996.

A. J. Mayer and L. J. Stockmeyer, The complexity of PDL with interleaving, Theoretical Computer Science, vol.161, issue.1-2, pp.109-122, 1996.
DOI : 10.1016/0304-3975(95)00095-X

O. 'hearn and P. W. , Resources, concurrency, and local reasoning, Theoret. Comput. Sci, vol.37513, pp.271-307, 2007.

D. Peleg, Concurrent dynamic logic, Journal of the ACM, vol.34, issue.2, pp.450-479, 1987.
DOI : 10.1145/23005.23008

V. R. Pratt, Models of program logics, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.115-122, 1979.
DOI : 10.1109/SFCS.1979.24

D. J. Pym, The Semantics and Proof Theory of the Logic of Bunched Implications, Applied Logic Series, vol.26, 2002.
DOI : 10.1007/978-94-017-0091-7

J. C. Reynolds, Separation logic: a logic for shared mutable data structures, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.55-74, 2002.
DOI : 10.1109/LICS.2002.1029817

URL : http://ttic.uchicago.edu/~dreyer/seplogic.pdf

K. Schild, A correspondence theory for terminological logics: preliminary report, International Joint Conference on Artificial Intelligence -IJCAI, pp.466-471, 1991.

Y. Venema, A Modal Logic for Chopping Intervals, Journal of Logic and Computation, vol.1, issue.4, pp.453-476, 1991.
DOI : 10.1093/logcom/1.4.453