Switch to: References

Citations of:

Definability and Computability for PRSPDL

In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 16-33 (2014)

Add citations

You must login to add citations.
  1. Separation Logics and Modalities: A Survey.Stéphane Demri & Morgan Deters - 2015 - Journal of Applied Non-Classical Logics 25 (1):50-99.
    Like modal logic, temporal logic, and description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. In a broad sense, separation logic is often understood as a programming language, an assertion language and a family of rules involving Hoare triples. In this survey, we present similarities between separation logic as an assertion language and modal and temporal logics. Moreover, we (...)
    Export citation  
  • Complexity and Expressivity of Propositional Dynamic Logics with Finitely Many Variables.Mikhail Rybakov & Dmitry Shkatov - 2018 - Logic Journal of the IGPL 26 (5):539-547.
    Export citation  
    Bookmark   3 citations