Download PDFOpen PDF in browser

C2PDLS: A Combination of Combinatory and Converse PDL with Substitutions

13 pagesPublished: March 26, 2017

Abstract

We introduce a logic called C2PDLS, motivated by some reasoning
about 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

Links:
BibTeX entry
@inproceedings{SCSS2017:C2PDLS_Combination_of_Combinatory,
  author    = {Jon Hael Brenas and Rachid Echahed and Martin Strecker},
  title     = {C2PDLS: A Combination of Combinatory and Converse PDL with Substitutions},
  booktitle = {SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017},
  editor    = {Mohamed Mosbah and Michael Rusinowitch},
  series    = {EPiC Series in Computing},
  volume    = {45},
  pages     = {29--41},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/dx4z},
  doi       = {10.29007/gwcz}}
Download PDFOpen PDF in browser