Name
Abstract | ||
|---|---|---|
We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatization via reduction axioms, thereby establishing decidability. We also prove that the complexity of both the model checking and the satisfiability problem stay in PSPACE. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jlamp.2021.100683 | Journal of Logical and Algebraic Methods in Programming |
Keywords | DocType | Volume |
Dynamic logic,Separation logic,Propositional assignments,Parallel composition,Concurrency | Journal | 121 |
ISSN | Citations | PageRank |
2352-2208 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joseph Boudou | 1 | 0 | 1.35 |
| Andreas Herzig | 2 | 655 | 48.55 |
| Nicolas Troquard | 3 | 266 | 29.54 |