Download PDFOpen PDF in browserC2PDLS: A Combination of Combinatory and Converse PDL with Substitutions13 pages•Published: March 26, 2017AbstractWe introduce a logic called C2PDLS, motivated by some reasoningabout graph rewriting systems. C2PDLS is an extension of both combinatory propositional dynamic logic, usually written CPDL, and converse propositional dynamic logic, usually written CPDL too. In addition to the existing features of both CPDLs, the introduced logic offers the possibility to use the notion of substitutions à la Hoare within its formulae. Such substitutions reflect the effect of some actions on graph structures such as addition or deletion of edges or nodes. These last features led us to introduce restricted universal roles over subsets of the universe. We propose a sound and complete deductive system for C2PDLS and show that its validity problem is decidable. Keyphrases: dynamic logic, hoare logic, program verification In: Mohamed Mosbah and Michael Rusinowitch (editors). SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017, vol 45, pages 29-41.
|