Propositional Dynamic Logic with Storing, Recovering and Parallel Composition

Authors:
Mario R. F. Benevides;Renata de Freitas;Petrucio Viana
Affiliations:
Computer Science Department and Systems and Computer Engineering Program, Federal University of Rio de Janeiro, Brazil;Institute of Mathematics, Fluminense Federal University, Brazil;Institute of Mathematics, Fluminense Federal University, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 12
Cited 0

Concurrent dynamic logic

Journal of the ACM (JACM)
Communication in concurrent dynamic logic

Journal of Computer and System Sciences
The complexity of PDL with interleaving

Theoretical Computer Science
Fork algebras

Relational methods in computer science
Dynamic Logic

Dynamic Logic
Fork Algebras in Algebra, Logic and Computer Science

Fork Algebras in Algebra, Logic and Computer Science
Reasoning about Information Change

Journal of Logic, Language and Information
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Separation Logic Semantics for Communicating Processes

Electronic Notes in Theoretical Computer Science (ENTCS)
A Propositional Dynamic Logic for CCS Programs

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work extends Propositional Dynamic Logic (PDL) with parallel composition operator and four atomic programs which formalize the storing and recovering of elements in data structures. A generalization of Kripke semantics is proposed that instead of using set of possible states it uses structured sets of possible states. This new semantics allows for representing data structures and using the five new operator one is capable of reasoning about the manipulation of these data structures. The use of the new language (PRSPDL) is illustrated with some examples. We present sound and complete set of axiom schemata and inference rules to prove all the valid formulas for a restricted fragment called RSPDLo.